A tour construction heuristic for the travelling salesman problem

Journal of the Operational Research Society

Volumn 50, Issue 8, 1999, Pages 797-809

  Hwang, C P ^a   Alidaee, B ^a   Johnson, J D ^a  

^a UNIVERSITY OF MISSISSIPPI   (United States)

Author keywords

Global search; Heuristics; Local search; Travelling salesman

Indexed keywords

COMPUTATIONAL METHODS; GENETIC ALGORITHMS; HEURISTIC METHODS;

NEAREST NEIGHBOR (NN) METHOD; TOUR CONSTRUCTION HEURISTICS;

TRAVELING SALESMAN PROBLEM;

EID: 0032653614     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600761     Document Type: Article

References (14)

1. Korte B (1989). Applications of combinatorial optimization. In: Iri M and Tanaka K (eds) Mathematical Programming: Recent Developments and Applications, Kluwer: Dortrect, pp 1-55.
2. Bland RG and Shallcross DF (1989). Large traveling salesman problems arising from experiments in X-ray crystallography: a preliminary report on computation. Opns Res Letts 8: 125-128.
3. Golden BL and Stewart WR (1985). Empirical analysis of heuristics (in traveling salesman problem) John Wiley: New York. 207-249.
4. Gu J and Huang X (1994). Efficient local search with search space smoothing: a case study of the travelling salesman problem. IEEE Trans Syst, Man, and Cyb 24: 728-735.
5. Aarts EH and Lenstra JK (1997). Local Search in Combinatorial Optimization. Wiley: New York.
6. Or I (1976). Traveling Salesman-type Combinatorial Problems and Their Relation to the Logistics of Regional Blood Banking, Ph.D. Dissertation. Northwestern University, Department of Industrial Engineering and Management Science.
7. Glover F (1990). Artificial intelligence, heuristic frameworks and tabu search. Managerial and Decis Econ 11: 365-375.
8. Goldberg DE (1989). Genetic Algorithms in Search, Optimization, and Machine Learnin. Addison-Wesley: New York.
9. Bean JC (1994). Genetic algorithms and random keys for sequencing and optimization. ORSA J Comp 6: 154-160.
10. Dorsey RE and Mayer WJ (1995). Genetic algorithms for estimating problems with multiple optima, nondifferentiability, and other irregular features. J Bus and Econ Stat 13: 53-66.
11. Glover F (1986). Future paths for integer programming and links to artificial intelligence. Comp & Opns Res 13: 533-549.
12. Glover F (1990). Tabu search: a tutorial. Interfaces 20: 74-94.
13. Hertz A and de Werra D (1990). The tabu search metaheuristic: how we used it. Annals of Mathe and Artif Intell 1:111-121.
14. Charon I and Hudry O (1993). The noising method: a new method for combinatorial optimization. Opns Res Letts 14: 133-137.