Optimal Sequence of Multiple Jeeps Problems

Wen Lei Chen; Xian Jia Wang

doi:10.4028/www.scientific.net/AMR.403-408.5142

Paper Titles

Automatic Recognition of Basal Cisterns on Brain CT
p.5121

Dynamics Simulation of Automatic Capsule Filling Machine with ADAMS
p.5126

Mathematical Model for Yarn Unwinding Part Ι: Cylindrical Packages
p.5131

Mathematical Model for Yarn Unwinding Part ΙΙ: Conic Packages
p.5136

Optimal Sequence of Multiple Jeeps Problems
p.5142

Integrated Learning Courses and Library Resources with Personal Knowledge Map
p.5146

A Portable Method to Improve the Performance of Commodity Servers for Massive Data Delivery
p.5150

Study about the Hierarchical Effectiveness of Henan Regional Investment
p.5155

Three-Dimensional Bubble Representation and Rule Mining for Evaluating Results of Corporate R & D Personnel’s Innovation Performance
p.5160

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 403-408Optimal Sequence of Multiple Jeeps Problems

Optimal Sequence of Multiple Jeeps Problems

Abstract:

In this paper the focus is on the logistics for a caravan of jeeps which travel in the desert. Based on the dynamic program principle, the maximum distances for the caravan when only a part of the jeeps should return and when all drivers should return is obtained. The optimal sequence for the expedition problem as well as the optimal time for the maximum distance is also carefully studied and presented.