A Hybrid Discrete Particle Swarm Optimization for the Traveling Salesman Problem
暂无分享,去创建一个
[1] David S. Johnson,et al. The Traveling Salesman Problem: A Case Study in Local Optimization , 2008 .
[2] 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.
[3] Maurice Clerc,et al. Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem , 2004 .
[4] Thomas Stützle,et al. MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..
[5] Yue Shi,et al. A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).
[6] Pin Luarn,et al. A discrete version of particle swarm optimization for flowshop scheduling problems , 2007, Comput. Oper. Res..
[7] James Kennedy,et al. Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.
[8] Jigui Sun,et al. An Improved Discrete Particle Swarm Optimization Algorithm for TSP , 2007, 2007 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Workshops.
[9] Luca Maria Gambardella,et al. Solving symmetric and asymmetric TSPs by ant colonies , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.
[10] Mauro Birattari,et al. Swarm Intelligence , 2012, Lecture Notes in Computer Science.