A discrete estimation of distribution particle swarm optimization for combinatorial optimization problems

Proceedings - Third International Conference on Natural Computation, ICNC 2007

Volumn 4, Issue , 2007, Pages 80-84

  Zhou, Yalan ^a   Wang, Jiahai ^a   Yin, Jian ^a  

^a SUN YAT SEN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; PARAMETER ESTIMATION; PROBLEM SOLVING; STATISTICAL METHODS;

COMBINATORIAL OPTIMIZATION PROBLEMS; DISCRETE ESTIMATION; DISTRIBUTION PARTICLE SWARM OPTIMIZATION; ESTIMATION OF DISTRIBUTION ALGORITHMS (EDA);

GLOBAL OPTIMIZATION;

EID: 38049009421     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNC.2007.18     Document Type: Conference Paper

References (16)

1. J. Kennedy, R.C. Eberhart, "Particle swarm optimization", Proceedings of IEEE International Conference on Neural Networks, NJ: Piscataway, 1995, pp. 1942-1948.
2. F. Van den Bergh, A.P. Engelbrecht, "Cooperative learning in neural network using particle swarm optimizers", South African Computer Journal, vol. 26, 2000, pp. 84-90.
3. AI. El-Galland, ME. El-Hawary, and AA. Sallam, "Swarming of intelligent particles for solving the nonlinear constrained optimization problem", Engineering Intelligent Systems for Electrical Engineering and Communications, 2001, vol. 9, pp. 155-163.
4. K.E. Parsopoulos, M.N. Vrahatis, "Recent approaches to global optimization problems through Particle Swarm Optimization", Natural Computing, vol. 1, no. 2-3, 2002, pp. 235-306.
5. J. Kennedy, R.C. Eberhart, "A discrete binary version of the particle swarm algorithm", Proceedings of the World Multiconference on Systemics, Cybernetics and Informatics, NJ: Piscatawary, 1997, pp. 4104-4109.
6. S.Y. Yang, M. Wang, and L.C. Jiao, "A quantum particle swarm optimization", Proceeding of the 2004 IEEE Congress on Evolutionary Computation, vol. 1, 2004, pp. 320-324.
7. P.Y. Yin, "Genetic particle swarm optimization for polygonal approximation of digital curves", Pattern Recognition and Image Analysis, vol. 16, no. 2, 2006, pp. 223-233.
8. H. Muhlenbein, G. Paaß, "From recombination of genes to the estimation of distributions", in Proceedings of the 4th Conference on Parallel Problem Solving from Nature-PPSN IV, H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schwefel, Eds. Lecture Notes in Computer Science, vol. 1411. Springer, Berlin, 1996, pp. 178-187.
9. M. Pelikan, D.E. Goldberg, and F. Lobo, "A survey of optimization by building and using probabilistic models", Computational Optimization and Applications, vol. 21, no. 1, 2002, pp. 5-20.
10. S. Kern, S.D. Muller, N. Hansen, D. Buche, J. Ocenasek, and P. Koumoutsakos, "Learning probability distributions in continuous evolutionary algorithms-a comparative review", Natural Computing, vol. 3, no. 1, 2004, pp. 77-112.
11. P. Larranaga, J. Lozano, " Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation", Genetic Algorithms and Evolutionary Computation, vol. 2. Springer, 2001.
12. H. Müehlenbein, "The equation for response to selection and its use for prediction," Evol. Comput., vol. 5, no. 3, 1997, pp. 303-346.
13. S. Baluja, "Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning", School of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, Tech. Rep. CMU-CS-94-163, 1994.
14. G.R. Harik, F.G. Lobo, and D.E. Goldberg, "The compact genetic algorithm", IEEE Trans. Evol. Comput., vol. 3, no. 4, 1999, pp. 287-297.
15. Q. Zhang, J. Sun, and E. Tsang, "An evolutionary algorithm with guided mutation for the maximum clique problem", IEEE Transactions on Evolutionary Computation, vol. 9, Apr. 2005, pp. 192-200.
16. R.M. Karp, "Reducibility among combinatorial problems", Complexity of Computer Computations, Plenum Press, R. Miller and J. Thatcher, eds., New York, Jul. 1972, pp. 85-104.