数学物理学报(英文版) ›› 2010, Vol. 30 ›› Issue (5): 1429-1439.doi: 10.1016/S0252-9602(10)60135-X

• 论文 • 上一篇    下一篇

OPTIMAL LOGISTICS FOR MULTIPLE JEEPS

陈文磊|丁义明|范文涛   

  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
  • 收稿日期:2009-04-24 修回日期:2010-01-31 出版日期:2010-09-20 发布日期:2010-09-20
  • 基金资助:

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

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).

PDF (PC)

1120

摘要：

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, logistics, dynamic program principle

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

中图分类号: 

  • 90B
版权所有 © 《数学物理学报(英文版)》杂志社
地址：武汉市71010号信箱(430071)　电话: 027-87199206(中文版)　027-87199087(英文版)
E-mail: actams@apm.ac.cn
本系统由北京玛格泰克科技发展有限公司设计开发