Affordable Access

Access to the full text

Multiple Jeeps Problem with Container Restriction

Authors
  • Hua, Xiangying1
  • 1 Wuhan University of Technology, Wuhan, 430070, China , Wuhan (China)
Type
Published Article
Journal
Acta Mathematica Scientia
Publisher
Springer-Verlag
Publication Date
Dec 17, 2019
Volume
40
Issue
1
Pages
75–89
Identifiers
DOI: 10.1007/s10473-020-0106-z
Source
Springer Nature
Keywords
License
Yellow

Abstract

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.

Report this publication

Statistics

Seen <100 times