A Time-Efficient Method for Metaheuristics: Using Tabu Search and Tabu GA as a Case

This paper presents an efficient algorithm for reducing the computation time of metaheuristics. The proposed algorithm is motivated by the observation that some of the subsolutions of metaheuristics will eventually end up being part of the final solutions. As such, if they can be saved away as soon as they were found, then most, if not all, of the redundant computations can be eliminated to save the computation time of metaheuristics. To evaluate the performance of the proposed algorithm, we use it to cut the computation time of a single-solution based algorithm called Tabu Search (TS) and a population-based algorithm called Tabu Genetic Algorithm (Tabu GA) in solving the traveling salesman problem (TSP). The test benchmarks for the TSP problem are from 198 up to 1,655 cities. Our experimental results indicate that the proposed algorithm can reduce the computation time from 65.72% up to about 94.25% compared to those of TS and Tabu GA alone.

[1]  Enrique Alba,et al.  Parallel Hybrid Metaheuristics , 2005 .

[2]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[3]  Bruce L. Golden,et al.  Solving the traveling salesman problem with annealing-based heuristics: a computational study , 2002, IEEE Trans. Syst. Man Cybern. Part A.

[4]  Zong Woo Geem,et al.  A New Heuristic Optimization Algorithm: Harmony Search , 2001, Simul..

[5]  Rong Yang,et al.  Solving large travelling salesman problems with small populations , 1997 .

[6]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[7]  G. Reinelt.  The traveling salesman: computational solutions for TSP applications , 1994 .

[8]  Chu-Sing Yang,et al.  Fast genetic algorithm based on pattern reduction , 2008, 2008 IEEE International Conference on Systems, Man and Cybernetics.

[9]  Chu-Sing Yang,et al.  A fast VQ codebook generation algorithm via pattern reduction , 2009, Pattern Recognit. Lett..

[10]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[11]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[12]  Sheng-Tun Li,et al.  TGA: a new integrated approach to evolutionary algorithms , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[13]  Chungnan Lee,et al.  On the harmonious mating strategy through tabu search , 2003, Inf. Sci..

[14]  Anoop Ghanwani,et al.  Improved Neural Heuristics for Multicast Routing , 1997, IEEE J. Sel. Areas Commun..

[15]  Ching-Fang Liaw,et al.  A hybrid genetic algorithm for the open shop scheduling problem , 2000, Eur. J. Oper. Res..

[16]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[17]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[18]  Christian Blum,et al.  Hybrid Metaheuristics: An Introduction , 2008, Hybrid Metaheuristics.

[19]  Md. Nasir Sulaiman,et al.  Selecting quality initial random seed for metaheuristic pproaches: a case of timetabling problem , 2008 .

[20]  Erick Cantú-Paz,et al.  A Survey of Parallel Genetic Algorithms , 2000 .

[21]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[22]  Ching-Chi Hsu,et al.  An annealing framework with learning memory , 1998, IEEE Trans. Syst. Man Cybern. Part A.

[23]  Ryszard S. Michalski,et al.  LEARNABLE EVOLUTION MODEL: Evolutionary Processes Guided by Machine Learning , 2004, Machine Learning.

[24]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[25]  El-Ghazali Talbi,et al.  A Taxonomy of Hybrid Metaheuristics , 2002, J. Heuristics.

[26]  Andrew Lim,et al.  A new GA approach for the vehicle routing problem , 1999, Proceedings 11th International Conference on Tools with Artificial Intelligence.

[27]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[28]  Chuan-Kang Ting,et al.  Incorporating tabu search into the survivor selection of genetic algorithm , 2008, 2008 IEEE International Conference on Systems, Man and Cybernetics.

[29]  Chu-Sing Yang,et al.  A Time efficient Pattern Reduction algorithm for k-means based clustering , 2007, 2007 IEEE International Conference on Systems, Man and Cybernetics.