Abstract
A multi-agent system is divided into groups forming sub-populations of agents. These groups of agents are evolving simultaneously with the aim of searching for all the local extrema of a given function with complex landscape. Mathematically, this multi-agent system is represented by a multi-population genetic algorithm (MPGA). Each population contains a set of agents that are binary coded chromosomes undergoing evolution with mutation and crossover. A migration operator is used to control the exchange of chromosomes between different populations. Since the location of the extrema for the given function f is defined by the condition of vanishing first derivative, we define the fitness of a chromosome as a monotonically decreasing function of the absolute value of the differential df. To evaluate the performance of our multi-agent system in mapping out the landscape, we introduce two measures: the cover degree, which is the percentage of the extrema found, and the precision, which is the average fitness of the last generation among all the groups. A good landscape mapping algorithm will maximize both the cover degree and the precision. Numerical experiments were performed on a set of benchmark functions. We observe a general feature similar to the ”uncertainty relation” in physics, in which the cover degree increases and precision decreases as the strength of migration decreases. Our results on benchmark functions show that MPGA provides a good tool for landscape mapping. Application of our method to map out complex landscape of functions that cannot be written down explicitly, such as protein folding, is suggested.
This is a preview of subscription content, log in via an institution to check access.
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
Clote, P.: An Efficient Algorithm to Compute the Landscape of Locally Optimal RNA Secondary Structures with Respect to the Nussinov-Jacobson Energy Model. Journal of computational biology 12(1), 83–101 (2005)
Cupal, J., Hofacker, I., Stadler, P.: Dynamic programming algorithm for the density of states of RNA secondary structures. In: Proc. German Conference on Bioinformatics, pp. 184–186 (1996)
Debenedetti, P.G., Stillinger, F.H.: Supercooled liquids and the glass transition. Nature 410, 259–267 (2001)
Denzinger, J., Kidney, J.: Improving migration by diversity. In: Proc. CEC 2003, Canberra, pp. 700–707 (2003)
Denzinger, J., Offermann, T.: On Cooperation between Evolutionary Algorithms and other Search Paradigms. In: Proc. CEC 1999, pp. 2317–2324 (1999)
Doyle, J.P.K.: Network Topology of a Potential Energy Landscape: A Static Scale-Free Network. Phys. Rev. Lett. 88, 238701 (2002)
Flamm, C., Fontana, W., Hofacker, I.L., Schuster, P.F.: RNA folding at elementary step resolution. RNA 6, 325–338 (2000)
Flamm, C., Hofacker, I.L., Stadler, P.F., Wolfinger, M.: Barrier trees of degenerate landscapes. Z. Phys. Chem. 216, 155–173 (2002)
Law, N.L., Szeto, K.Y.: Adaptive Genetic Algorithm with Mutation and Crossover Matrices. In: Proceeding of the 12th International Joint Conference on Artificial Intelligence (IJCAI 2007), Hyderabad, India, January 6-12, 2007, pp. 2330–2333 (2007)
Mathews, D.H., Sabina, J., Zuker, M., Turner, D.H.: Expanded sequence dependence of ther-modynamic parameters improves prediction of RNA secondary structure. J. Mol. Biol. 288, 911–940 (1999)
Sali, A., Shakhnovich, E., Karplus, M.: How does a protein fold? Nature 369, 248–251 (1994)
Szeto, K.Y., Zhang, J.: Adaptive Genetic Algorithm and Quasi-Parallel Genetic Algorithm: Application to low-dimensional Physics. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds.) LSSC 2005. LNCS, vol. 3743, pp. 189–196. Springer, Heidelberg (2006)
Wales, D.J., Miller, M.A., Walsh, T.R.: Archetypal energy landscapes. Nature 394, 758–760 (1998)
Wales, D.J., Doye, J.P.K., Miller, M.A., Mortenson, P.N., Walsh, T.R.: Energy landscapes: from clusters to biomolecules. Adv. Chem. Phys. 115, 1–111 (2000)
Wu, Y.L., Lu, J.G., Sun, Y.X.: An Improved Multi-Population Genetic Algorithm for Constrained Nonlinear Optimization. In: Proc. the 6th World Congress on Intelligent Control and Automation (WCICA 2006), vol. 1, pp. 1910–1914 (2006)
Yao, J., Kharma, N., Grogono, P.: BMPGA: a bi-objective multi-population genetic algorithm for multi-modal function optimization. In: Proc. 2005 IEEE Congress on Evolutionary Computation, vol. 1, pp. 816–823 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Guo, Y.B., Szeto, K.Y. (2009). Landscape Mapping by Multi-population Genetic Algorithm. In: Krasnogor, N., Melián-Batista, M.B., Pérez, J.A.M., Moreno-Vega, J.M., Pelta, D.A. (eds) Nature Inspired Cooperative Strategies for Optimization (NICSO 2008). Studies in Computational Intelligence, vol 236. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03211-0_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-03211-0_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03210-3
Online ISBN: 978-3-642-03211-0
eBook Packages: EngineeringEngineering (R0)