Title :
A TSP engine for performing tabu search
Author :
Karamcheti, Vijay ; Malek, Miroslaw
Author_Institution :
Dept. of Electr. & Comput. Eng., Texas Univ., Austin, TX, USA
Abstract :
The tabu search is a new promising optimization heuristic used for obtaining near-optimum solutions of combinatorial optimization problems. This paper looks into an implementation of tabu search on dedicated hardware and shows a potential for improvements of two orders of magnitude in the time taken to perform a fixed number of iterations for the traveling salesman problem (TSP)
Keywords :
combinatorial mathematics; computational complexity; operations research; optimisation; search problems; NP-complete problem; combinatorial optimization; dedicated hardware; fixed number of iterations; optimization heuristic; tabu search; traveling salesman problem; Circuit testing; Cities and towns; Computational modeling; Cost function; Engines; Genetic algorithms; Hardware; Integrated circuit interconnections; Simulated annealing; Traveling salesman problems;
Conference_Titel :
Application Specific Array Processors, 1991. Proceedings of the International Conference on
Conference_Location :
Barcelona
Print_ISBN :
0-8186-9237-5
DOI :
10.1109/ASAP.1991.238912
