Acta mathematica scientia,Series A ›› 2019, Vol. 39 ›› Issue (2): 348-357.

Previous Articles     Next Articles

Jeep Problems with Container Restriction

Xu Cheng1,2,Yiming Ding3,Xiangying Hua3,*()   

  1. 1 University of Chinese Academy of Sciences, Beijing 100049
    2 Wuhan Institute of Physics and Mathematics, CAS, Wuhan 430071
    3 Center for Mathematical Sciences, School of Science, Wuhan University of Technology, Wuhan 430070
  • Received:2017-11-06 Online:2019-04-26 Published:2019-05-05
  • Contact: Xiangying Hua E-mail:huaxiangying@whut.edu.cn
  • Supported by:
    the Fundamental Research Funds for Central Universities(2017IVA073)

Abstract:

Jeep problems with and without container restriction are studied. Optimal strategies of problems without container restriction are obtained for one-way and round trip. Strategies of jeep problems with container restriction are also given for one-way trip and round trip respectively, from which we prove that jeep with container restriction can travel any distance if enough fuel is available. To get optimal strategy of jeep problems with container restriction is a challenging task.

Key words: Jeep problem, Capacity, Container restriction, One-way trip, Round trip

CLC Number: 

  • O221
Trendmd