The multiple TSP with time windows: vehicle bounds based on precedence graphs

Authors:
Sneana Mitrović-Minić;Ramesh Krishnamurti
Affiliations:
School of Computing Science, Simon Fraser University, Burnaby, BC, Canada V5A 1S6;School of Computing Science, Simon Fraser University, Burnaby, BC, Canada V5A 1S6
Venue:
Operations Research Letters
Year:
2006

Citing 1
Cited 2

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research

An optimization approach for communal home meal delivery service: A case study

Journal of Computational and Applied Mathematics
Integrated planning of loaded and empty container movements

OR Spectrum

Quantified Score

Hi-index	0.00

Visualization

Abstract

Vehicle bounds for the multiple traveling salesman problem with time windows are found by covering two precedence graphs with the minimum number of paths. Instances with tight bounds are presented, as well as instances for which the bounds are loose. The similarity of these instances is discussed.