Meta-RaPS: A simple and effective approach for solving the traveling salesman problem

Transportation Research Part E: Logistics and Transportation Review

Volumn 41, Issue 2, 2005, Pages 115-130

  DePuy, Gail W ^a   Moraga, Reinaldo J ^b   Whitehouse, Gary E ^c  

^a University of Louisville   (United States)

^b UNIVERSIDAD DEL BÍO BÍO   (Chile)

^c UNIVERSITY OF CENTRAL FLORIDA   (United States)

Author keywords

Cheapest insertion; Meta heuristic; TSP

Indexed keywords

COST ENGINEERING; HEURISTIC ALGORITHMS;

ASSIGNMENT MODELS; CHEAP INSERTION; DEVELOPMENT AND APPLICATIONS; EFFECTIVE APPROACHES; INDUSTRY CASE STUDIES; LARGE-TRUCKS; METAHEURISTIC; SIMPLE APPROACH; SOLUTION METHODOLOGY; TEST SETS;

TRAVELING SALESMAN PROBLEM;

FREIGHT TRANSPORT; HEURISTICS; MODELING; PLANNING METHOD;

EID: 8144228804     PISSN: 13665545     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tre.2004.02.001     Document Type: Article

References (44)

1. Altinel K. Aras N. Oommen J. Fast, efficient and accurate solutions to the hamiltonian path problem using neural approaches Computers and Operations Research 27 5 2000 461-494
2. Arcus A. COMSOAL: A computer method of sequencing operations for assembly lines International Journal of Production Research 4 1966 259-277
3. Arguello M. Bard J. Yu G. A GRASP for aircraft routing in response to groundings and delays Journal of Combinatorial Optimization 1 1997 211-228
4. Burkard R. Deineko V. Van Dal R. Van Der Veen J. Woeginger G. Well-solvable special cases of the traveling salesman problem: A survey SIAM Review 40 3 1998 496-546
5. Burke L. Conscientious neural nets for tour construction in the traveling salesman problem Computers and Operations Research 23 2 1996 121-129
6. Burke L.I. Damany P. The guilty net for the traveling salesman problem Computers and Operations Research 19 4 1992 255-265
7. Chatterjee S. Carrera C. Lynch L. Genetic algorithms and traveling salesman problems European Journal of Operational Research 93 1996 490-510
8. Christofides N. 1976. Worst-case analysis of a new heuristic for the traveling salesman problem. Management Sciences Research Report No. 388, Carnegie-Mellon University
9. Clarke G. Wright J. Scheduling of vehicles from a central depot to a number of delivery points Operations Research 12 1964 568-581
10. Coy S. Golden B. Runger G. Wasil E. Using experimental design to find effective parameter setting for heuristics Journal of Heuristics 7 2001 77-97
11. DePuy G. Whitehouse G. A simple and effective heuristic for the resource constrained project scheduling problem International Journal of Production Research 39 14 2001 3275-3287
12. DePuy G. Whitehouse G. Applying the COMSOAL computer heuristic to the constrained resource allocation problem Computers and Industrial Engineering 38 2000 413-422
13. Feo T. Resende M. A probabilistic heuristic for a computationally difficult set covering problem OR Letters 8 1989 67-71
14. Feo T. Sarathy K. McGahan J. A GRASP for single machine scheduling with sequence dependent setup costs and linear delay penalties Computers and Operations Research 23 1996 881-895
15. Fischetti M. Toth P. A polyhedral approach to the asymmetric traveling salesman problem Management Science 43 11 1997 1520-1536
16. Gendreau M. Laporte G. Semet F. A tabu search heuristic for the undirected selective traveling salesman problem European Journal of Operational Research 106 2-3 1998 539-545
17. Golden B.L. Stewart W.R. Empirical analysis of heuristic In: Lawler E.L. Lenstra J.K. Rinnooy Kan A.H.G. Shmoys D.B. (Eds.) The Traveling Salesman Problem 1985 207-249 John Wiley - Sons New York
18. Ingnizio J. Cavalier T. Linear Programming 1994 Prentice Hall
19. Johnson D. 1991. The Traveling Salesman Problem: A Report on the State of the Art. In: Pehrson, B., Simon, I. (Eds.), 13th World Computer Congress, Elsevier Science, pp. 221-222
20. Johnson D.S. McGeoch L.A. Experimental analysis of heuristics for STSP In: Gutin G. Punnen (Eds.) The Traveling Salesman Problem and its Variations 2002 369-443 Kluwer Academic Publishers
21. Krasnogor N. Moscato P. Norman M.G. 1995. A new hybrid heuristic for large geometric traveling salesman problems based on the delaunay triangulation. Anales del xxvii Simposio Brasileiro de Pesquisa Operacional
22. Laporte G. Asef-Vaziri A. Sriskandarajah C. Some applications of the generalized traveling salesman problem Journal of The Operational Research Society 47 1996 1461-1467
23. Lawler E.L. Lenstra J.K. Rinnooy Kan A.H.G. Shmoys D.B. The Traveling Salesman Problem 1985 John Wiley - Sons New York
24. Lysgaard J. Cluster based branching for the asymmetric traveling salesman problem European Journal of Operational Research 119 2 1999 314-325
25. Mak K. Morton A. A modified Lin-Kernighan traveling salesman heuristic ORSA Journal on Computing 13 1992 127-132
26. Malek M. Guruswamy M. Pandya M. Owens H. Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem Annals of Operations Research 21 1989 59-84
27. Matsuyama Y. Self-organization neural networks and various euclidean traveling salesman problems Systems and Computers in Japan 23 2 1992 101-112
28. Mavridou T. Pardalos P. Pitsoulis L. Resende M. A GRASP for the bi-quadratic assignment problem European Journal of Operational Research 105 1998 613-621
29. Melamed I. Sergeev S. Sigal I. Traveling salesman problem: Theoretical issues Automation Remote Control 50 9 1990 1147-1173
30. Modares A. Somhom S. Enkawa T. A self-organizing neural network approach for multiple traveling salesman and vehicle routing problems International Transactions in Operational Research 6 1999 591-606
31. Moraga R. AlMazid M. 2000. The traveling salesman problem (TSP) and its industrial applications. Proceeding of the 4th International Conference on Engineering Design and Automation. p. 474-480
32. Padberg M. Rinaldi G. A branch-and-cut algorithm for the solution of large-scale traveling salesman problems SIAM Review 33 1991 60-100
33. Rego C. Relaxed tours and path ejections for the traveling salesman problem European Journal of Operational Research 106 2-3 1998 522-538
34. Reinelt G. 1994. The traveling salesman: Computational solutions for TSP applications. Lectures Notes in Computer Science, Springer-Verlag
35. Reinelt G. Bixby W. 1995. TSPLIB - a library of traveling salesman and related problem instances. Available from http://www.crpc.rice.edu/softlib/catalog/tsplib.html
36. Renaud J. Boctor F.F. Laporte G. A fast composite heuristic for the symmetric traveling salesman problem INFORMS Journal on Computing 8 2 1996 134-143
37. Rios-Mercado R. Bard J. Heuristics for the flow line problem with setup costs European Journal of Operational Research 1 1998 76-98
38. Schmitt L. Amini M. Performance characteristics of alternative genetic algorithmic approaches to the Traveling Salesman Problem using path representation: An empirical study European Journal of Operational Research 108 3 1998 551-580
39. Schulman N. 2001. Meta-RaPS: A randomized priority search applied to the traveling salesman problem. M. Eng. IE. Thesis, Department of Industrial Engineering, University of Louisville, Louisville, Kentucky
40. Sosnowska D. Optimization of a simplified fleet assignment problem with metaheuristics: Simulated annealing and GRASP In: Pardalos P. (Ed.), Approximation and Complexity in Numerical Optimization 2000 Kluwer Academic Publishers
41. Soylu M. Ozdemirel N. Kayaligil S. A self-organizing neural network approach for the single AGV routing problem European Journal of Operational Research 121 1 2000 124-137
42. Tsubakitani S. Evans J.R. An empirical study of a new metaheuristic for the traveling salesman problem European Journal of Operational Research 104 1998 113-128
43. Voudouris C. Tsang E. Guided local search and its application to the traveling salesman problem European Journal of Operations Research 113 1999 469-499
44. Yip P.P.C. Pao Y.H. Combinatorial optimization with use of guided evolutionary simulated annealing IEEE Transactions on Neural Networks 6 2 1995 290-295