Discrete particle swarm optimization with greedy randomized adaptive search procedure for linear order problem
暂无分享,去创建一个
[1] Maurice Clerc,et al. Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem , 2004 .
[2] James Kennedy,et al. Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.
[3] Chukwudi Anyakoha,et al. A review of particle swarm optimization. Part II: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications , 2008, Natural Computing.
[4] Andries Petrus Engelbrecht,et al. Using neighbourhoods with the guaranteed convergence PSO , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).
[5] Fred W. Glover,et al. An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem , 2001, J. Glob. Optim..
[6] 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.
[7] Rafael Martí,et al. Scatter Search: Diseño Básico y Estrategias avanzadas , 2002, Inteligencia Artif..
[8] M. Resende,et al. Greedy Randomized Adaptive Search Procedures. , 2003 .
[9] J. Mitchell,et al. Solving Linear Ordering Problems with a Combined Interior Point/Simplex Cutting Plane Algorithm , 2000 .
[10] Chukwudi Anyakoha,et al. A review of particle swarm optimization. Part I: background and development , 2007, Natural Computing.
[11] 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).
[12] Gerhard Reinelt,et al. The linear ordering problem: algorithms and applications , 1985 .