Optimizing tabu list size for the traveling salesman problem

Computers and Operations Research

Volumn 25, Issue 2, 1998, Pages 91-97

  Tsubakitani, Shigeru ^a,c   Evans, James R ^b  

^a Bender Consulting Inc   (United States)

^b UNIVERSITY OF CINCINNATI   (United States)

^c Bender Management Consultants Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; HEURISTIC METHODS;

TABU SEARCH;

TRAVELING SALESMAN PROBLEM;

EID: 0031995491     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(97)00030-0     Document Type: Article

References (16)

1. Malek, M., Search Methods for Traveling Salesman Problems, Department of Electrical Engineering, The University of Texas, Austin, 1988.
2. Malek, M., Guruswamy, M., Owens, H. and Pandya, M., Serial and parallel search techniques for the traveling salesman problem, In Annals of OR: Linkages with Artificial Intelligence, Vol. 21, ed P. L. Hammer, J.C. Baltzer AG, Basel, Switzerland, 1989, pp. 59-84.
3. Hertz, A. and De Werra, D., Using tabu serach techniques for graph coloring. Computing, 1987, 29, 345-351.
4. Glover, F., Heuristics for integer programming using surrogate constraints. Decision Science, 1977, 8, 1 156-166.
5. Glover, F., Tabu search - part I. ORSA Journal of Computing, 1989, 1, 3 190-206.
6. Glover, F., Future paths for integer programming and links to artificial intelligence. Computers and Operations Research, 1986, 13, 5 533-549.
7. Knox, J. and Glover, F., Comparative Testing of Traveling Salesman Heuristics Derived from Tabu Search, Genetic Algorithms and Simulated Annealing, Working paper, California State Polytechnic University, September 1989.
8. Press, W. H., Flannery, B. P., Teukosky, S. A. and Vetterling, W. T., Numerical Recipes in C, Cambridge University Press, Cambridge, 1988.
9. Lin, S., Computer solutions of the traveling salesman problem. Bell System Technical Journal, 1965, 44, 2245-2269.
10. Lin, S. and Kernighan, B. W., An effective heuristic algorithm for the traveling salesman problem. Operations Research, 1973, 21, 498-516.
11. Volgenant, S. and van der Hout, A. N., Private communication.
12. Volgenant, A. and Jonker, R., A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation. Eur. J. Opnl. Res., 1982, 9, 83-89.
13. Jonker, R. and Volgenant, A., Non-optimal edges for the symmetric traveling salesman problem. Opns Res., 1984, 32, 837-846.
14. Jonker, R. and Volgenaut, A. The symmetric traveling salesman problem and edge exchanges in minimal 1 - trees. European Journal of Operational Research, 1983, 12, 394-403.
15. Held, M. and Karp, R. M., The traveling salesman problem and minimum spanning trees. Part 2. Mathematical Programming, 1971, 1, 6-25.
16. Held, M. and Karp, R. M., The traveling salesman problem and minimum spanning trees. Operations Research, 1970, 18, 1138-1162.