“穿越沙漠”最佳策略研究  

Research on the Best Strategy of “Crossing the Desert”

作　　者：朱传辉 杨赵苡宏 王树艳[1] 

机构地区：[1]临沂大学,山东 临沂

出　　处：《运筹与模糊学》2021年第1期70-74,共5页Operations Research and Fuzziology

摘　　要：本文主要研究“穿越沙漠”游戏的最佳策略。“穿越沙漠”游戏,实质是以剩余资金最大化为目标的策略最优化问题。在只有一名玩家,且整个游戏时段天气状况事先已知的情况下,首先,根据是否补给物资和挖矿的条件,将全部路径分为三类,运用Dijstra算法计算每类最短路径。其次,针对每类路径建立单目标最优化模型,结合物资的携带率和天气情况,对比得到最佳策略。最后,分析算法的复杂度,可知本文算法复杂度低于遍历算法。In this paper, the best strategy of “crossing the desert” is studied. The essence of “crossing the desert” game is a strategic optimization problem aiming at maximizing the remaining funds. When there is only one player and the weather condition of the whole game period is known in advance, firstly, according to the conditions of supplying materials and mining, all paths are divided into three categories, and the shortest path of each type is calculated by Dijstra algorithm. Secondly, a single objective optimization model is established for each type of path, and the best strategy is obtained by comparing the material carrying rate and weather conditions. Finally, the complexity of the algorithm is analyzed, which shows that the complexity of this algorithm is lower than that of the traversal algorithm.

关 键 词：单目标最优化模型 复杂度 DIJKSTRA算法 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]