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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
