A high performance hybrid metaheuristic for traveling salesman problem

Chun Wei Tsai, Jui Le Chen, Shih Pang Tseng, Ming Chao Chiang, Chu Sing Yang

Research output: Chapter in Book/Report/Conference proceedingConference contribution


Genetic algorithm (GA) is one of the most widely used metaheuristics in finding the approximate solutions of complex problems in a variety of domains. As such, many researchers have focused their attention on enhancing the performance of GA - in terms of either the speed or the quality but rarely in terms of both. This paper presents an efficient hybrid metaheuristic to resolve these two seemingly conflicting goals. That is, the proposed method can not just reduce the running time of GA and its variants, but it can also make the loss of quality small, called High Performance Hybrid Metaheuristic (or HPHM for short). The underlying idea of the proposed algorithm is to leverage the strengths of GA, Tabu Search, and the notion of Pattern Reduction. To evaluate the performance of the proposed algorithm, we use it to solve the traveling salesman problem. Our experimental results indicate that the proposed algorithm can significantly enhance the performance of GA and its variants - especially the speed.

Original languageEnglish
Title of host publication2010 World Automation Congress, WAC 2010
Number of pages6
Publication statusPublished - 2010 Dec 1
Event2010 World Automation Congress, WAC 2010 - Kobe, Japan
Duration: 2010 Sep 192010 Sep 23

Publication series

Name2010 World Automation Congress, WAC 2010


Other2010 World Automation Congress, WAC 2010

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering

Fingerprint Dive into the research topics of 'A high performance hybrid metaheuristic for traveling salesman problem'. Together they form a unique fingerprint.

Cite this