We consider variations of the classical jeep problems： the optimal logistics for a caravan of jeeps which travel together in the desert. The main purpose is to arrange the travels for the one-way trip and the round t...We consider variations of the classical jeep problems： the optimal logistics for a caravan of jeeps which travel together in the desert. The main purpose is to arrange the travels for the one-way trip and the round trip of a caravan of jeeps so that the chief jeep visits the farthest destination. Based on the dynamic program principle, the maximum distances for the caravan when only part of the jeeps should return and when all drivers should return are obtained. Some related results such as the efficiency of the abandoned jeeps, and the advantages of more jeeps in the caravan are also presented.展开更多
Jeep problem is a kind of model of logistics in extreme situation, which has application in exploration and aircraft problems. The optimal distance and driving strategy of multiple jeeps problem are known. We consider...Jeep problem is a kind of model of logistics in extreme situation, which has application in exploration and aircraft problems. The optimal distance and driving strategy of multiple jeeps problem are known. We consider multiple jeeps problem with container restriction, which is more complicated in the proof of feasibility and optimality of a driving strategy. We investigate when it can achieve the same optimal distance as without restriction.Based on the non-restricted optimal distance, a new driving strategy is proposed. We provide the necessary and sufficient condition to ensure the feasibility of the strategy, and obtain the maximal feasible distance.展开更多
基金partially Supported by National Natural Science Foundation of China(70571079,60534080)China Postdoctoral Science Foundation(20100471140)
文摘We consider variations of the classical jeep problems： the optimal logistics for a caravan of jeeps which travel together in the desert. The main purpose is to arrange the travels for the one-way trip and the round trip of a caravan of jeeps so that the chief jeep visits the farthest destination. Based on the dynamic program principle, the maximum distances for the caravan when only part of the jeeps should return and when all drivers should return are obtained. Some related results such as the efficiency of the abandoned jeeps, and the advantages of more jeeps in the caravan are also presented.
基金supported by the Fundamental Research Funds for the Central Universities(WUT:2017 IVA 073)。
文摘Jeep problem is a kind of model of logistics in extreme situation, which has application in exploration and aircraft problems. The optimal distance and driving strategy of multiple jeeps problem are known. We consider multiple jeeps problem with container restriction, which is more complicated in the proof of feasibility and optimality of a driving strategy. We investigate when it can achieve the same optimal distance as without restriction.Based on the non-restricted optimal distance, a new driving strategy is proposed. We provide the necessary and sufficient condition to ensure the feasibility of the strategy, and obtain the maximal feasible distance.
