Chaotic Particle Swarm Optimization Algorithm for Traveling Salesman Problem
暂无分享,去创建一个
Li Liao | Yaohua Wu | Liliang Yang | Zheng Yuan | Liliang Yang | Yaohua Wu | Li Liao | Guoqiang Li | Zhenglei Yuan | Guoqiang Li
[1] Russell C. Eberhart,et al. A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.
[2] Peter J. Angeline,et al. Evolutionary Optimization Versus Particle Swarm Optimization: Philosophy and Performance Differences , 1998, Evolutionary Programming.
[3] Chunguang Zhou,et al. Particle swarm optimization for traveling salesman problem , 2003, Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693).
[4] Ioan Cristian Trelea,et al. The particle swarm optimization algorithm: convergence analysis and parameter selection , 2003, Inf. Process. Lett..
[5] Wang Yuan-yuan,et al. Particle Swarm Optimization Algorithm , 2009 .
[6] Maurice Clerc,et al. Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem , 2004 .
[7] Ma Long-hua,et al. A new optimization algorithm based on chaos , 2006 .
[8] Tim Hendtlass,et al. Preserving Diversity in Particle Swarm Optimisation , 2003, IEA/AIE.
[9] Li-Li Bing. Chaos Optimization Method and Its Application , 1997 .
[10] George L. Nemhauser,et al. The Traveling Salesman Problem: A Survey , 1968, Oper. Res..
[11] Riccardo Poli,et al. Particle swarm optimization , 1995, Swarm Intelligence.
[12] Yanchun Liang,et al. Particle swarm optimization-based algorithms for TSP and generalized TSP , 2007, Inf. Process. Lett..