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.

Key words: jeep problem, caravan, container restriction, driving strategy