A Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems
暂无分享,去创建一个
Jun Zhang | Henry Shu-Hung Chung | Wei-neng Chen | Weigang Wu | Yu-hui Shi | Wen-liang Zhong | H. Chung | Jun Zhang | Wei-neng Chen | Yu-hui Shi | Weigang Wu | Wen-liang Zhong
[1] Xingsheng Gu,et al. A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan ☆ , 2008 .
[2] A. Rahimi-Kian,et al. A Novel Binary Particle Swarm Optimization Method Using Artificial Immune System , 2005, EUROCON 2005 - The International Conference on "Computer as a Tool".
[3] Marco César Goldbarg,et al. Particle Swarm for the Traveling Salesman Problem , 2006, EvoCOP.
[4] J. Kennedy,et al. Population structure and particle swarm performance , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).
[5] Pin Luarn,et al. A discrete version of particle swarm optimization for flowshop scheduling problems , 2007, Comput. Oper. Res..
[6] Z. Michalewicz,et al. A new version of ant system for subset problems , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).
[7] 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).
[8] James Kennedy,et al. Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).
[9] Gerhard Reinelt,et al. TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..
[10] Bernd Freisleben,et al. New Genetic Local Search Operators for the Traveling Salesman Problem , 1996, PPSN.
[11] 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.
[12] Yanchun Liang,et al. Particle swarm optimization-based algorithms for TSP and generalized TSP , 2007, Inf. Process. Lett..
[13] Cheng-Yan Kao,et al. Some issues of designing genetic algorithms for traveling salesman problems , 2004, Soft Comput..
[14] Luca Maria Gambardella,et al. Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..
[15] Christine Solnon,et al. Ant algorithm for the multidimensional knapsack problem , 2004 .
[16] 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).
[17] Mehmet Fatih Tasgetiren,et al. A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem , 2008, Comput. Oper. Res..
[18] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .
[19] Jing J. Liang,et al. Comprehensive learning particle swarm optimizer for global optimization of multimodal functions , 2006, IEEE Transactions on Evolutionary Computation.
[20] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[21] Imtiaz Ahmad,et al. Particle swarm optimization for task assignment problem , 2002, Microprocess. Microsystems.
[22] T. Stützle,et al. MAX-MIN Ant System and local search for the traveling salesman problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).
[23] Andries Petrus Engelbrecht,et al. A Cooperative approach to particle swarm optimization , 2004, IEEE Transactions on Evolutionary Computation.
[24] Leandro dos Santos Coelho,et al. Particle Swarn Optimization with Fast Local Search for the Blind Traveling Salesman Problem , 2005, Fifth International Conference on Hybrid Intelligent Systems (HIS'05).
[25] Peter J. Bentley,et al. Don't push me! Collision-avoiding swarms , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).
[26] Haozhong Cheng,et al. New discrete method for particle swarm optimization and its application in transmission network expansion planning , 2007 .
[27] Saman K. Halgamuge,et al. Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients , 2004, IEEE Transactions on Evolutionary Computation.
[28] Bin Shen,et al. Heuristic Information Based Improved Fuzzy Discrete PSO Method for Solving TSP , 2006, PRICAI.
[29] Jong-Hwan Kim,et al. Quantum-inspired evolutionary algorithm for a class of combinatorial optimization , 2002, IEEE Trans. Evol. Comput..
[30] Manuel López-Ibáñez,et al. Ant colony optimization , 2010, GECCO '10.
[31] S.G. Ponnambalam,et al. A Hybrid Discrete Particle Swarm Optimization Algorithm to Solve Flow Shop Scheduling Problems , 2006, 2006 IEEE Conference on Cybernetics and Intelligent Systems.
[32] John E. Beasley,et al. A Genetic Algorithm for the Multidimensional Knapsack Problem , 1998, J. Heuristics.
[33] Jun Zhang,et al. A novel discrete particle swarm optimization to solve traveling salesman problem , 2007, 2007 IEEE Congress on Evolutionary Computation.
[34] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[35] G. Reinelt. The traveling salesman: computational solutions for TSP applications , 1994 .
[36] Wei Pang,et al. Modified particle swarm optimization based on space transformation for solving traveling salesman problem , 2004, Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.04EX826).
[37] Zbigniew Michalewicz,et al. Inver-over Operator for the TSP , 1998, PPSN.
[38] Thomas Stützle,et al. Ant Colony Optimization , 2009, EMO.
[39] D. Y. Sha,et al. A hybrid particle swarm optimization for job shop scheduling problem , 2006, Comput. Ind. Eng..
[40] Yanchun Liang,et al. A novel quantum swarm evolutionary algorithm and its applications , 2007, Neurocomputing.
[41] Min Kong,et al. Apply the Particle Swarm Optimization to the Multidimensional Knapsack Problem , 2006, ICAISC.
[42] N. Franken,et al. Combining particle swarm optimisation with angle modulation to solve binary problems , 2005, 2005 IEEE Congress on Evolutionary Computation.
[43] Ronald L. Rivest,et al. Introduction to Algorithms, Second Edition , 2001 .
[44] B. Al-kazemi,et al. Discrete Multi-Phase Particle Swarm Optimization , 2005 .
[45] Chunguang Zhou,et al. Fuzzy discrete particle swarm optimization for solving traveling salesman problem , 2004, The Fourth International Conference onComputer and Information Technology, 2004. CIT '04..
[46] Yuhui Shi,et al. Particle swarm optimization: developments, applications and resources , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).
[47] R. Eberhart,et al. Fuzzy adaptive particle swarm optimization , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).
[48] Ching-Jong Liao,et al. A discrete particle swarm optimization for lot-streaming flowshop scheduling problem , 2008, Eur. J. Oper. Res..
[49] Shigenobu Kobayashi,et al. Edge Assembly Crossover: A High-Power Genetic Algorithm for the Travelling Salesman Problem , 1997, ICGA.
[50] Maurice Clerc,et al. The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..
[51] Riccardo Poli,et al. Particle swarm optimization , 1995, Swarm Intelligence.
[52] 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.
[53] Thomas Kiel Rasmussen,et al. Hybrid Particle Swarm Optimiser with breeding and subpopulations , 2001 .