Effective local and guided variable neighbourhood search methods for the asymmetric travelling salesman problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2037, Issue , 2001, Pages 203-212

  Burke, Edmund K ^a   Cowling, Peter I ^a   Keuthen, Ralf ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC ALGORITHMS; LOCAL SEARCH (OPTIMIZATION); PRINTED CIRCUIT BOARDS; PRINTED CIRCUIT MANUFACTURE; PRINTED CIRCUITS;

ASYMMETRIC TRAVELLING SALESMAN PROBLEMS; ELECTRONICS ASSEMBLY; EXACT ALGORITHMS; LOCAL SEARCH HEURISTICS; REAL-LIFE PROBLEMS; SEQUENCING PROBLEMS; SOLUTION SPACE; VARIABLE NEIGHBOURHOOD SEARCH;

TRAVELING SALESMAN PROBLEM;

EID: 84958047824     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45365-2_21     Document Type: Conference Paper

References (23)

1. Johnson, D.S., McGeoch, L.A.: The travelling salesman problem: A case study. In: Aarts, E.H.L. and Lenstra, J.K. (eds.): Local Search in Combinatorial Optimization. John Wiley & Sons, New York (1997) 215-310
2. Reinelt, G.: The travelling salesman: Computational solutions for TSP applications. Lecture Notes in Computer Science, Springer-Verlag, Berlin Heidelberg New York (1994)
3. Bentley, J.L.: Fast algorithms for geometric traveling salesman problems. ORSA Journal on Computing, 4 (1992) 387-411
4. Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the travelling salesman problem. Operat. Res. 21 (1973) 498-516
5. Lawler, E.J., Lenstra, J.K., Rinnoy Kan, A.H.G., Shmoys, D.B.: The travelling salesman problem: A guided tour of combinatorial optimization. Wiley, New York (1985)
6. Martello, S., Toth, P.: Linear assignment problems. Annals of Discrete Mathematics 31 (1987) 259-282
7. A. Frieze, Galbiati, G., Maffioli, F: On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks 12 (1982) 23-39
8. Karp, R.M.: A patching algorithm for the nonsymmetric traveling salesman problem. SIAM Journal on Computing 8 (1979) 561-573
9. Glover, F., Gutin, G., Yeo, A., Zverovich, A.: Construction heuristics for the asymmetric TSP. European Journal of Operational Research 129 (2000) 555-568
10. Zhang, W.: Depth-first branch-and-bound versus local search: A case study. In: Proceedings of the 17th National Conference on Artificial Intelligence (AAAI 2000), Austin, TX, USA (2000) 260-266
11. Kanellakis, P.C., Papadimitriou, C.H.: Local search for the asymmetric traveling salesman problem. Oper. Res. 28 (1980) 1086-1099
12. Merz, P., Freisleben, B.: Genetic local search for the TSP: New results. In: Proceedings of the 1997 IEEE International Conference on Evolutionary Computation (1997) 159-164
13. Papadimitriou, C.H., Steiglitz, K.: The complexity of local search for the traveling salesman problem. SIAM Journal on Computing 6 (1977) 76-83
14. Pekney, J.F., Miller, D.L.: Exact solution of the no-wait flowshop scheduling problem with a comparison to heuristic methods. Computers & Chemical Engineering 15 (1991) 741-748
15. Cowling, P.I.: Optimization in steel hot rolling. In: Optimization in Industry. John Wiley & Sons, Chichester, England, (1995) 55-66
16. Kolohan, F., Liang, M.: A tabu search approach to optimization of drilling operations. Comp. in Eng. 31 (1996) 371-374
17. Walas, R.A., Askin, R.G.: An algorithm for NC turret punch press tool location and hit sequencing. IIE Transactions 16 (1984) 280-287
18. Burke, E.K., Cowling, P.I., Keuthen, R.: New models and heuristics for component placement in printed circuit board assembly. In: Proceedings of the 1999 International Conference on Information, Intelligence and Systems (ICIIS99), Bethesda, MD, USA. IEEE Computer Society Press, (1999) 133-140
19. Burke, E.K., Cowling, P.I., Keuthen, R.: Effective heuristic and metaheuristic approaches to optimize component placement in printed circuit board assembly. In: Proceedings of the Congress on Evolutionary Computation CEC2000, San Diego, CA, USA. IEEE Computer Society Press, (2000) 301-308
20. Hansen, P., Mladenovic, N.: An introduction to variable neighborhood search. In: S. Voss, S. Martello, I.H. Osman and C. Roucairol (eds.): Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pages 433-458, Kluwer Academic Publishers, Boston, MA (1999)
21. Hansen, P., Mladenovic, N.: Variable neighborhood search: Principles and applications. In: Invited papers at Euro XVI. Brussels, Belgium, (1998)
22. Burke, E.K., Cowling, P.I., Keuthen, R.: Embedded local search and variable neighborhood search heuristics applied to the travelling salesman problem. University of Nottingham, Technical Report (2000)
23. Reinelt, G.: TSPLIB-A travelling salesman problem library. ORSA-Journal of the Computing 3 (1991) 376-38