This paper considers the problem of planning paths for a collection of identical vehicles visiting a given set of targets, such that the total lengths of their paths are minimum. Each vehicle starts at a specified location (called a depot) and it is required that each target to be on the path of at least one vehicle. The path of every vehicle must satisfy the motion constraints of every vehicle. In this paper, we develop a method to compute lower bound to the minimum total path lengths by relaxing some of the constraints and posing it as a standard multiple traveling salesmen problem (MTSP). A lower bound is often important to ascertain suboptimality bounds for heuristics and for developing stopping criterion for algorithms computing an optimal solution. Simulation results are presented to show that the proposed method can be used to improve the lower bounds of instances with four vehicles and 40 targets by approximately 39%.
Computation of Lower Bounds for a Multiple Depot, Multiple Vehicle Routing Problem With Motion Constraints
Contributed by the Dynamic Systems Division of ASME for publication in the JOURNAL OF DYNAMIC SYSTEMS, MEASUREMENT, AND CONTROL. Manuscript received March 6, 2014; final manuscript received April 5, 2015; published online May 28, 2015. Assoc. Editor: Junmin Wang.
- Views Icon Views
- Share Icon Share
- Cite Icon Cite
- Search Site
Manyam, S. G., Rathinam, S., and Darbha, S. (September 1, 2015). "Computation of Lower Bounds for a Multiple Depot, Multiple Vehicle Routing Problem With Motion Constraints." ASME. J. Dyn. Sys., Meas., Control. September 2015; 137(9): 094501. https://doi.org/10.1115/1.4030354
Download citation file:
- Ris (Zotero)
- Reference Manager