The multiple traveling salesman problem : an overview of formulations and solution procedures

作者: Tolga Bektas

DOI: 10.1016/J.OMEGA.2004.10.004

关键词: Mathematical optimizationTravelling salesman problem2-optHeuristic (computer science)GeneralizationTraveling purchaser problemMathematicsVehicle routing problemBottleneck traveling salesman problem

摘要: … salesman located at each, the salesmen can either return to their original depot after completing their tour or return to any depot … of salesmen at each depot remains the same after all the …

参考文章(69)
E. Hadjiconstantinou, D. Roberts, Routing under uncertainty: an application in the scheduling of field service engineers The vehicle routing problem. pp. 331- 352 ,(2001)
J. Gromicho, J. Paixão, I. Bronco, Exact Solution of Multiple Traveling Salesman Problem NATO Advanced Study Institute held at Bilkent University, Ankara, Turkey, July 1990. pp. 291- 292 ,(1992) , 10.1007/978-3-642-77489-8_27
David Shmoys, Eugene L. Lawler, Alexander H. G. Rinnooy Kan, Jan Karel Lenstra, The traveling salesman problem ,(1985)
Donald Sofge, Alan Schultz, Kenneth De Jong, Evolutionary Computational Approaches to Solving the Multiple Traveling Salesman Problem Using a Neighborhood Attractor Schema Lecture Notes in Computer Science. ,vol. 2279, pp. 153- 162 ,(2002) , 10.1007/3-540-46004-7_16
A.I. Vakhutinsky, B.L. Golden, Solving vehicle routing problems using elastic nets world congress on computational intelligence. ,vol. 7, pp. 4535- 4540 ,(1994) , 10.1109/ICNN.1994.375004
Lalinka de C.T. Gomes, Fernando J. Von Zuben, Multiple criteria optimization based on unsupervised learning and fuzzy inference applied to the vehicle routing problem Journal of Intelligent and Fuzzy Systems. ,vol. 13, pp. 143- 154 ,(2002)
D. Vigo, P. Toth, Branch-and-bound algorithms for the capacitated VRP The vehicle routing problem. pp. 29- 51 ,(2001)
The vehicle routing problem Society for Industrial and Applied Mathematics. ,(2001) , 10.1137/1.9780898718515
R. Wolfler Calvo, R. Cordone, A heuristic approach to the overnight security service problem Computers & Operations Research. ,vol. 30, pp. 1269- 1287 ,(2003) , 10.1016/S0305-0548(02)00070-9