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

Operations Research Letters

Volumn 34, Issue 1, 2006, Pages 111-120

  Mitrović Minić, Snežana ^a   Krishnamurti, Ramesh ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Bounds for the minimum number of vehicles; Multiple traveling salesman problem with time windows

Indexed keywords

GRAPH THEORY;

BOUNDS FOR THE MINIMUM NUMBER OF VEHICLES; MULTIPLE TRAVELING SALESMAN PROBLEM WITH TIME WINDOWS;

TRAVELING SALESMAN PROBLEM;

EID: 28044443830     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2005.01.009     Document Type: Article

References (15)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin Network Flows 1993 Prentice-Hall Englewood Cliffs, NJ
2. M.O. Ball, T.L. Magnanti, C.L. Monma, G.L. Nemhauser (Eds.), Network Routing, Handbooks in Operations Research and Management Science, vol. 8, North-Holland, Amsterdam, 1995.
3. R. Dilworth A decomposition theorem for partially ordered sets Ann. Math. 51 1950 161 166
4. L.R. Ford, and D.R. Fulkerson Flows in Networks 1962 Princeton University Press Princeton, NJ
5. J.N. Hooker, N.R. Natraj, A generalized Dilworth's theorem, with application to routing and scheduling, Working paper, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, USA, 1992.
6. J.N. Hooker, and N.R. Natraj A generalized Dilworth's theorem, with application to routing and scheduling Transport. Sci. 29 1995 30 44
7. G. Kontoravdis, and J.F. Bard A GRASP for the vehicle routing problem with time windows ORSA J. Comput. 7 1995 10 23
8. O.B.G. Madsen, The vehicle routing problem with time windows, Spring School on Logistics and Distribution Management, Sponsored by the Canada Research Chair in Distribution Management and MITACS, École des Hautes Études Commerciales, Montréal, 8-10 May 2002.
9. S. Mitrović-Minić, The dynamic pickup and delivery problem with time windows, Ph.D. Dissertation, School of Computing Science, Simon Fraser University, Burnaby, Canada, 2001.
10. D.F. Robinson, and L.R. Foulds Digraphs: Theory and Techniques 1980 Gordon and Breach Science Publishers New York
11. M.W.P. Savelsbergh Local search in routing problems with time windows Ann. Oper. Res. 4 1985 285 305
12. M.M. Solomon On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints Networks 16 1986 161 174
13. M.M. Solomon Algorithms for the vehicle routing and scheduling problem with time window constraints Oper. Res. 35 1987 254 265
14. P. Toth, and D. Vigo The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications 2002 SIAM Philadelphia
15. W.T. Trotter Combinatorics and Partially Ordered Sets 1992 The Johns Hopkins University Press Baltimore