This paper analyzes the players in the game of "crossing the desert", and puts forward the optimal customs clearance strategy to help the game players reach the destination within the specified time under the condition that the remaining funds are retained as much as possible. Firstly, the redundant paths are eliminated and the complete subgraph of the game map is drawn to improve the speed of computer optimization. Then, the multiple rules in the game are transformed into the constraints in the planning model, such as load constraint, remaining fund constraint, resource margin constraint and so on. By solving the model based on adjacency matrix and mixed integer programming, the rationality of the optimization strategy is verified by an example. The waiting model is used to decompose the number of players and consider different space and time to maximize the revenue of a mine as much as possible, while reducing the basic consumption of latecomers in a certain area and the consumption of resources purchased in the same village.
Read full abstract