A local search template

Computers and Operations Research

Volumn 25, Issue 11, 1998, Pages 969-979

  Vaessens, Rob J M ^a,d   Aarts, Emile H L ^a,b   Lenstra, Jan Karel ^a,c  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b PHILIPS RESEARCH LABORATORIES   (Netherlands)

^c CWI   (Netherlands)

^d KLM ROYAL DUTCH AIRLINES   (Netherlands)

Author keywords

Genetic algorithms; Iterative improvement; Local search; Simulated annealing; Tabu search; Threshold accepting

Indexed keywords

GENETIC ALGORITHMS; ITERATIVE METHODS; SIMULATED ANNEALING;

LOCAL SEARCH ALGORITHMS; TABU SEARCH;

PROBLEM SOLVING;

EID: 0032210589     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(97)00093-2     Document Type: Article

References (21)

1. Aarts, E. H. L. and Korst, J. H. M. (1989) Simulated Annealing and Boltzmann Machines. Wiley, Chichester.
2. Aarts, E. H. L. and Lenstra, J. K. (eds.) (1997) Local Search in Combinatorial Optimization. Wiley, Chichester.
3. Bock, F. (1958) An algorithm for solving "traveling-salesman" and related network optimization problems: abstract. Bulletin Fourteenth National Meeting of the Operations Research Society of America. p. 897.
4. Croes, G. A., A method for solving traveling salesman problems. Operations Research, 1958, 6, 791-812.
5. Dueck, G. and Scheuer, T., Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. Journal of Computational Physics, 1990, 90, 161-175.
6. Garey, M. R. and Johnson, D. S. (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA.
7. Glover, F., Tabu search: Part I. ORSA Journal on Computing, 1989, 1, 190-206.
8. Goldberg, D. E. (1989) Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading, MA.
9. Holland, J. H. (1975) Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI.
10. Johnson, D. S. and McGeoch, L. A. (1997) The traveling salesman problem: a case study. In Local Search in Combinatorial Optimization, eds. E. H. L. Aarts and J. K. Lenstra. Wiley, Chichester, pp. 215-310.
11. Johnson, D. S., Papadimitriou, C. H. and Yannakakis, M., How easy is local search? Journal of Computer and System Science, 1988, 37, 79-100.
12. Kirkpatrick, S., Gelatt, C. D., Jr. and Vecchi., M. P., Optimization by simulated annealing. Science, 1983, 220, 671-680.
13. Lin, S. and Kernighan, B. W., An effective heuristic for the traveling-salesman problem. Operations Research, 1973, 21, 498-516.
14. Martin, O., Otto, S. W. and Felten, E. W., Large-step Markov chains for the traveling salesman problem. Complex Systems, 1991, 5, 299-326.
15. Osman, I. H., and Kelly, J. P. (eds.) (1996) Metaheuristics: Theory and Applications. Kluwer, Boston, MA.
16. Papadimitriou, C. H. and Steiglitz, K. (1982) Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, New York.
17. Tovey, C. A. (1997) Local improvement on discrete structures. In Local Search in Combinatorial Optimization, eds. E. H. L. Aarts and J. K. Lenstra. Wiley, Chichester, pp. 57-89.
18. Ulder, N. L. J., Aarts, E. H. L., Bandelt, H.-J., van Laarhoven, P. J. M. and Pesch, E. (1991) Genetic local search algorithms for the traveling salesman problem. In Parallel Problem Solving from Nature. Lecture Notes in Computer Science, Vol. 496, eds. H.-P. Schwefel and R. Männer. Springer, Berlin, pp. 109-116.
19. Vaessens, R. J. M., Aarts, E. H. L. and Lenstra, J. K., Job shop scheduling by local search. INFORMS Journal on Computing, 1996, 8, 302-317.
20. Yannakakis, M. (1997), Computational complexity. In Local Search in Combinatorial Optimization, eds. E. H. L. Aarts and J. K. Lenstra. Wiley, Chichester, pp. 19-55.
21. Yannakakis, M. (1990), The analysis of local search problems and their heuristics. In STAGS 90: 7th Annual Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, Vol. 415, eds. C. Choffrut and T. Lengauer. Springer, Berlin, pp. 298-311.