A high performance hybrid metaheuristic for traveling salesman problem

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

研究成果: Conference 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.

原文English
主出版物標題2010 World Automation Congress, WAC 2010
頁面1-6
頁數6
出版狀態Published - 2010 十二月 1
事件2010 World Automation Congress, WAC 2010 - Kobe, Japan
持續時間: 2010 九月 192010 九月 23

出版系列

名字2010 World Automation Congress, WAC 2010

Other

Other2010 World Automation Congress, WAC 2010
國家Japan
城市Kobe
期間10-09-1910-09-23

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering

指紋 深入研究「A high performance hybrid metaheuristic for traveling salesman problem」主題。共同形成了獨特的指紋。

引用此