Acta mathematica scientia,Series B ›› 2010, Vol. 30 ›› Issue (5): 1429-1439.doi: 10.1016/S0252-9602(10)60135-X

• Articles • Previous Articles     Next Articles

OPTIMAL LOGISTICS FOR MULTIPLE JEEPS

 CHEN Wen-Lei, DING Yi-Ming, FAN Wen-Tao   

  1. Economics and Management School, Wuhan University, Wuhan 430072, China Wuhan Institute of Physics and Mathematics, The Chinese Academy of Sciences, P.O. Box 71010, Wuhan 430071, China
  • Received:2009-04-24 Revised:2010-01-31 Online:2010-09-20 Published:2010-09-20
  • Supported by:

    This work is partially Supported by National Natural Science Foundation of China (70571079,  60534080) and China Postdoctoral Science Foundation (20100471140).

Abstract:

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.

Key words: jeep problem, logistics, dynamic program principle

CLC Number: 

  • 90B
Trendmd