Abstract
Estimation of Distribution Algorithms (EDAs) is an evolutionary computation optimization paradigm that relies the evolution of each generation on calculating a probabilistic graphical model able to reflect dependencies among variables out of the selected individuals of the population. This showed to be able to improve results with GAs for complex problems.
This paper presents a new hybrid approach combining EDAs and particle swarm optimization, with the aim to take advantage of EDAs capability to learn from the dependencies between variables while profiting particle swarm’s optimization ability to keep a sense of ”direction” towards the most promising areas of the search space. Experimental results show the validity of this approach with widely known combinatorial optimization problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ackley, D.H.: A Connectionist Machine for Genetic Hillclimbing. Kluwer, Dordrecht (1987)
Angeline, P.: Using selection to improve particle swarm optimization. In: Proceedings of the IEEE Congress on Evolutionary Computation, Anchorage AK, pp. 84–89 (1998)
Bengoetxea, E., Miquélez, T., Larrañaga, P., Lozano, J.A.: Experimental results in function optimization with EDAs in continuous domain. In: Larrañaga, P., Lozano, J.A. (eds.) Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation, pp. 181–194. Kluwer Academic Publishers, Dordrecht (2001)
van den Bergh, F., Engelbrecht, A.: A cooperative approach to particle swarm optimization. IEEE Transactions on Evolutionary Computation 8(3), 225–239 (2004)
Brits, R., Engelbrecht, A., van den Bergh, F.: Locating multiple optima using particle swarm optimization. Applied Mathematics and Computation 189(2), 1859–1883 (2007)
Chatterjee, A., Siarry, P.: Non linear inertia weight variation for dynamic adaptation in particle swarm optimization. Computers and Operations Research 33(3), 859–871 (2004)
Chen, Y., Peng, W., Jian, M.: Particle swarm optimization with recombination and dynamic linkage discovery. IEEE Transactions on Systems, Man, and Cybernetics 37(6), 1460–1470 (2007)
Eberhart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings of the 6th IEEE Symposium MIcromachines and Human Science (MHS), pp. 39–43 (1995)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)
Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of the IEEE Conference on Neural Networks (ICNN), vol. 4, pp. 1942–1948 (1995)
Kulkani, R., Venayagamoorthy, G.: An estimation of distribution improved particle swarm optimization algorithm. In: Proceedings of the Third International Conference on Intelligent Sensors, Sensor Networks and Information (ISSNIP), pp. 539–544 (2007)
Larrañaga, P., Etxeberria, R., Lozano, J.A., Peña, J.M.: Optimization in continuous domains by learning and simulation of Gaussian networks. In: Proceedings of the Workshop in Optimization by Building and Using Probabilistic Models. A Workshop within the 2000 Genetic and Evolutionary Computation Conference, GECCO 2000, Las Vegas, Nevada, USA, pp. 201–204 (2000)
Larrañaga, P., Lozano, J.A.: Estimation of Distribution Algorithms. In: A New Tool for Evolutionary Computation. Kluwer Academic Publishers, Dordrecht (2001)
Lozano, J., Larrañaga, P., Inza, I., Bengoetxea, E.: Towards a New Evolutionary Computation. In: Advances in Estimation of Distribution Algorithms. Springer, Heidelberg (2006)
Miquélez, T., Bengoetxea, E., Mendiburu, A., Larrañaga, P.: Combining Bayesian classifiers and estimation of distribution algorithms for optimization in continuous domains. Connection Science 19(4), 297–319 (2007)
Mühlenbein, H., Paaß, G.: From recombination of genes to the estimation of distributions: I. Binary parameters. In: Ebeling, W., Rechenberg, I., Voigt, H.-M., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol. 1141, pp. 178–187. Springer, Heidelberg (1996)
Parrott, D., Li, X.: Locating and tracking multiple dynamic optima by a particle swarm model using speciation. IEEE Transactions on Evolutionary Computation 10(4), 440–458 (2006)
Parsopoulos, K., Vrahatis, M.: On the computation of all global minimizers through particle swarm optimization. IEEE Transactions on Evolutionary Computation 8(3), 211–224 (2004)
Ratnaweera, A., Halgamuge, S., Watson, H.: Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients. IEEE Transactions on Evolutionary Computation 8(3), 240–255 (2004)
Törn, A., Z̆ilinskas, A. (eds.): Global Optimization. LNCS, vol. 350. Springer, Heidelberg (1989)
Wang, J., Kuang, Z., Xu, X., Zhou, Y.: Discrete particle swarm optimization based on estimation of distribution for polygonal approximation problems. Expert Systems with Applications 36(5), 9398–9408 (2009)
Zhan, Z.H., Zhang, J., Li, Y., Chung, H.H.: Adaptive particle swarm optimization. IEEE Transactions on Systems, Man, and Cybernetics 39(6), 1362–1381 (2009)
Zhou, Y., Wang, J., Yin, J.: A discrete estimation of distribution particle swarm optimization for combinatorial optimization problems. In: Proceedings of the Third International Conference on Natural Computation (ICNC), vol. 4, pp. 80–84 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bengoetxea, E., Larrañaga, P. (2010). EDA-PSO: A Hybrid Paradigm Combining Estimation of Distribution Algorithms and Particle Swarm Optimization. In: Dorigo, M., et al. Swarm Intelligence. ANTS 2010. Lecture Notes in Computer Science, vol 6234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15461-4_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-15461-4_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15460-7
Online ISBN: 978-3-642-15461-4
eBook Packages: Computer ScienceComputer Science (R0)