Abstract
The goal of an Evolutionary Algorithm(EA) is to find the optimal solution to a given problem by evolving a set of initial potential solutions. When the problem is multi-modal, an EA will often become trapped in a suboptimal solution(premature convergence). The Scouting-Inspired Evolutionary Algorithm(SEA) is a relatively new technique that avoids premature convergence by determining whether a subspace has been explored sufficiently, and, if so, directing the search towards other parts of the system. Previous work has only focused on EAs with point mutation operators and standard selection techniques. This paper examines the effect of scouting on EA configurations that, among others, use crossovers and the Fitness-Uniform Selection Scheme(FUSS), a selection method that was specifically designed as means to avoid premature convergence. We will experiment with a variety of problems and show that scouting significantly improves the performance of all EA configurations presented.
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
Pfaffmann, J.O., Bousmalis, K., Colombano, S.: A scouting–inspired evolutionary algorithm. In: CEC 2004. Congress on Evolutionary Computation, 2004. June 19–23, 2004, vol. 2, pp. 1706–1712 (2004)
Pfaffmann, J.O., Zauner, K.P.: Scouting context–sensitive components. In: Keymeulen, D., Stoica, A., Lohn, J., Zebulum, R.S. (eds.) The Third NASA/DoD Workshop on Evolvable Hardware–EH-2001, Long Beach, 12–14 July 2001, pp. 14–20. IEEE Computer Society, Los Alamitos (2001)
Matsumaru, N., Colombano, S., Zauner, K.P.: Scouting enzyme behavior. In: Fogel, D.B., El–Sharkawi, M.A., Yao, X., Greenwood, G., Iba, H., Marrow, P., Shackleton, M. (eds.) 2002 World Congress on Computational Intelligence, Honolulu, Hawaii, May 12–17, pp. 19–24. IEEE, Piscataway, NJ (2002)
Matsumaru, N., Centler, F., Zauner, K.P., Dittrich, P.: Self–Adaptive–Scouting Autonomous Experimentation for Systems Biology. In: Raidl, G.R., Cagnoni, S., Branke, J., Corne, D.W., Drechsler, R., Jin, Y., Johnson, C.G., Machado, P., Marchiori, E., Rothlauf, F., Smith, G.D., Squillero, G. (eds.) EvoWorkshops 2004. LNCS, vol. 3005, pp. 52–62. Springer, Heidelberg (2004)
Hutter, M., Legg, S.: Fitness uniform optimization. IEEE Transactions on Evolutionary Computation 10, 568–589 (2006)
Schmidt, M., Michalewicz, Z.: Test–case generator TCG–2 for nonlinear parameter optimization. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) Parallel Problem Solving from Nature-PPSN VI. LNCS, vol. 1917, pp. 539–548. Springer, Heidelberg (2000)
Galassi, M., Davies, J., Theiler, J., Gough, B., Jungman, G., Booth, M., Rossi, F.: GNU Scientific Library Reference Manual. Network Theory Ltd., Bristol, UK (2003)
Beyer, H.-G.: The Theory of Evolution Strategies. Springer, Berlin (2001)
Matsumoto, M., Nishimura, T.: Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Transactions on Modeling and Computer Simulation 8(1), 3–30 (1998)
Lüscher, M.: A portable high-quality random number generator for lattice field theory calculations. Computer Physics Communications 79, 1000–1110 (1994)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bousmalis, K., Hayes, G.M., Pfaffmann, J.O. (2007). Improving Evolutionary Algorithms with Scouting. In: Neves, J., Santos, M.F., Machado, J.M. (eds) Progress in Artificial Intelligence. EPIA 2007. Lecture Notes in Computer Science(), vol 4874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77002-2_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-77002-2_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77000-8
Online ISBN: 978-3-540-77002-2
eBook Packages: Computer ScienceComputer Science (R0)