An Improved PSO-ACO Algorithm for Solving Large-Scale TSP

Ai Jia Ouyang; Yong Quan Zhou

doi:10.4028/www.scientific.net/AMR.143-144.1154

Paper Titles

Partheno Genetic Ant Colony Optimization Algorithm and its Application
p.1132

Prediction for the Sulfur Content in Pig Iron of Blast Furnace by Combining Artificial Neural Network with Genetic Algorithm
p.1137

Four Quadrants Numerical Prediction for Hydrodynamic Performance of Open-Water Propeller
p.1143

On the Convergence of Parallel Broyden Method
p.1148

An Improved PSO-ACO Algorithm for Solving Large-Scale TSP
p.1154

OneAPI Restful Services and Java Implementation
p.1159

The Mid-Long Term Power Load Forecasting Based on Gray and SVM Algorithm
p.1164

The Converse Theorem of Lyapunov Exponential Stability Theorem
p.1170

Model of Pollutant Loads and Rainfall Physical Parameters for Urban Surface Runoff
p.1175

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 143-144An Improved PSO-ACO Algorithm for Solving...

An Improved PSO-ACO Algorithm for Solving Large-Scale TSP

Abstract:

In this paper, an improved particle swarm optimization-ant colony algorithm (PSO-ACO) is presented by inserting delete-crossover strategy into it for the shortcoming which PSO-ACO can’t solve the large-scale TSP. The experiments results show that the PSO-ACO has better performance than ant colony algorithm (ACO) on searching the shortest paths, error and robustness for the TSP.

You might also be interested in these eBooks

Smart Materials and Intelligent Systems, SMIS2010

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 143-144)

Pages:

1154-1158

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.143-144.1154

Citation:

Cite this paper

Online since:

October 2010

Authors:

Ai Jia Ouyang, Yong Quan Zhou

Keywords:

Ant Colony Optimization (ACO), Delete Crossover, Particle Swarm Optimization Algorithm (PSO), TSP

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Aybars Ugur, Dogan Aydin. An Interactive Simulation and Analysis Software for Solving TSP Using Ant Colony Optimization Algorithms. Advances in Engineering Software, Vol. 40, (2009), pp.341-349.

DOI: 10.1016/j.advengsoft.2008.05.004

Google Scholar

[2] Goldberg D E. Genetic Algorithms in Search, Optimization and Machine Learning. MA: Addison-Wesley, Reading (1989).

Google Scholar

[3] Laarhoven P V, Aarts E H L. Simulated Annealing: Theory and Applications. Kluwer Academic Publishers (1987).

Google Scholar

[4] Dorigo M, Maniezzo V, Colorni A. The Ant System: Optimization by A Colony of Cooperating Agents. IEEE Trans Syst Man Cyber Part-B, 26: 29-41(1996).

DOI: 10.1109/3477.484436

Google Scholar

[5] Dorigo, M., & Gambardella, L. M. Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation, 1: 53-66 (1997).

DOI: 10.1109/4235.585892

Google Scholar

[6] Bullnheimer, B., Hartl, R. F., & Strauss, C. A New Rank-based Version of the Ant System: A Computational Study. Central European Journal of Operations Research and Economics, 7: 25-38 (1999).

Google Scholar

[7] Stutzle T., & Hoos, H. H. Max-Min ant system. Future Generation ComputerSystems, 16: 889-914 (2000).

Google Scholar

[8] Feng-Cheng Yang, Yon-Chun Chou. Superior/inferior Segment-Discriminated Ant System for Combinatorial Optimization Problems. Computers &Industrial Engineering, 57: 475-495 (2009).

DOI: 10.1016/j.cie.2007.12.016

Google Scholar