A time-efficient method for metaheuristics: Using tabu search and tabu GA as a case

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

研究成果: Conference contribution

2 引文 斯高帕斯(Scopus)

摘要

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 sub-solutions 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.

原文English
主出版物標題Proceedings - 2009 9th International Conference on Hybrid Intelligent Systems, HIS 2009
頁面24-29
頁數6
DOIs
出版狀態Published - 2009 十一月 27
事件2009 9th International Conference on Hybrid Intelligent Systems, HIS 2009 - Shenyang, China
持續時間: 2009 八月 122009 八月 14

出版系列

名字Proceedings - 2009 9th International Conference on Hybrid Intelligent Systems, HIS 2009
2

Other

Other2009 9th International Conference on Hybrid Intelligent Systems, HIS 2009
國家/地區China
城市Shenyang
期間09-08-1209-08-14

All Science Journal Classification (ASJC) codes

  • 人工智慧
  • 資訊系統
  • 軟體

指紋

深入研究「A time-efficient method for metaheuristics: Using tabu search and tabu GA as a case」主題。共同形成了獨特的指紋。

引用此