Evolutionary algorithm to traveling salesman problems

Yen Far Liao, Dun Han Yau, Chieh Li Chen

研究成果: Article同行評審

33 引文 斯高帕斯(Scopus)

摘要

This paper proposed an improved version of the Particle Swarm Optimization (PSO) approach to solve Traveling Salesman Problems (TSP). This evolutionary algorithm includes two phases. The first phase includes Fuzzy C-Means clustering, a rule-based route permutation, a random swap strategy and a cluster merge procedure. This approach firstly generates an initial non-crossing route, such that the TSP can be solved more efficiently by the proposed PSO algorithm. The use of sub-cluster also reduces the complexity and achieves better performance for problems with a large number of cities. The proposed Genetic-based PSO procedure is then applied to solve the TSP with better efficiency in the second phase. The proposed Genetic-based PSO procedure is applied to TSPs with better efficiency. Fixed runtime performance was used to demonstrate the efficiency of the proposed algorithm for the cases with a large number of cities.

原文English
頁(從 - 到)788-797
頁數10
期刊Computers and Mathematics with Applications
64
發行號5
DOIs
出版狀態Published - 2012 九月

All Science Journal Classification (ASJC) codes

  • Modelling and Simulation
  • Computational Theory and Mathematics
  • Computational Mathematics

指紋 深入研究「Evolutionary algorithm to traveling salesman problems」主題。共同形成了獨特的指紋。

引用此