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.