Design and Research on the Optimal Strategy of Desert-Crossing Outward Bound Training Program
Download PDF

Keywords

Enumeration method
Recursive method
Dynamic programming model
Floyd-Warshall algorithm

DOI

10.26689/ssr.v4i4.3667

Submitted : 2022-03-19
Accepted : 2022-04-03
Published : 2022-04-18

Abstract

Desert-crossing outward bound training program is an effective way to improve an individual’s judgment and execution. This paper aims to provide an optimized approach to the training program as it proposes an optimal strategy for crossing the desert with the given weather conditions, map, the upper limit of load, initial funds, deadline, basic income, weight and benchmark price of water and food, as well as basic consumption in various weather conditions.

References

Wei D, 2019, Fundamentals and Applications of Python Programming, Posts & Telecom Press, Beijing.

Ai D, 2018, Matlab and Mathematical Experiments, China Machine Press, Beijing.

Shi B, 2004, Matlab Mathematics Calculation Example Tutorial, China Railway Publishing House, Beijing.

Jiang Q, 2005, College Math Experiment, Tsinghua University Press, Beijing.

Wang W, 2006, Detailed Explanation of Mathematical Modeling and Its Basic Knowledge, Wuhan University Press, Wuhan.

Zhang X, 2006, Advanced Mathematics Experiment, East China University of Technology Press, Shanghai.

Quyang L, 2017, The Shortest Path Problem – Floyd Algorithm. Beijing Chuangxin Lezhi Network Technology Co., Ltd. https://blog.csdn.net/qq_35644234/article/details/60875818

Wang Z, 2005, Theory and Application of Control System, Beijing University of Posts and Telecommunications Press, Beijing.

Sheng Z, 2008, Probability Theory and Mathematical Statistics, Higher Education Press, Beijing.

Cheng L, 2000, Course on Models and Methods of Operational Research, Tsinghua University Press, Beijing.