A parallel tabu search algorithm for large traveling salesman problems
- 1 July 1994
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 51 (3) , 243-267
- https://doi.org/10.1016/0166-218x(92)00033-i
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The tabu search metaheuristic: How we used itAnnals of Mathematics and Artificial Intelligence, 1990
- Asymptotic expected performance of some TSP heuristics: An empirical evaluationEuropean Journal of Operational Research, 1989
- Tabu Search—Part IINFORMS Journal on Computing, 1989
- Using tabu search techniques for graph coloringComputing, 1987
- Optimization of a 532-city symmetric traveling salesman problem by branch and cutOperations Research Letters, 1987
- The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis AlgorithmSIAM Review, 1984
- A thermodynamically motivated simulation procedure for combinatorial optimization problemsEuropean Journal of Operational Research, 1984
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973
- Very high-speed computing systemsProceedings of the IEEE, 1966
- The shortest path through many pointsMathematical Proceedings of the Cambridge Philosophical Society, 1959