Abstract
For tackling an multi-objective optimization problem (MOP), evolutionary computation (EC) gathers much attention due to its population-based approach where several solutions can be obtained simultaneously. Since genetic algorithm (GA) and evolution strategy (ES) are often used in EC, we discuss only GA and ES in this chapter. Although both of them have global and local search capability, theoretical/empirical analysis reveals that GA is rather global search and ES is rather local search on MOP. These facts are related to how to generate offspring, i.e. crossover in GA and mutation in ES. On MOP, the crossover in GA and the mutation in ES generate differently distributed offspring. If mating in the crossover is not restricted, the crossover in GA can generate new offspring globally due to combination of parents which converge different points. Oppositely, the mutation in ES can generate the similar offspring with parent, i.e. locally distributed new offspring, because the offspring is generated by adding normally distributed random values to the parent. Recently, memetic algorithm, which combines GA with local search algorithm, is popular due to its performance. Since ES on MOP works as local search, we combine GA with ES as one of memetic algorithms in this chapter. This algorithm is called as hybrid representation. Several issues caused by the combination of GA and ES are discussed, e.g. the discretization error, self-adaptation and adaptive switching. Experiments are conducted on five well-known test functions using six different performance indices. The results show that the hybrid representation exhibits better and more stable performance than the original GA/ES.
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
Coello, C.A.C., Van Veldhuizen, D.A., Lamont, G.B.: Evolutionary Algorithms for Solving Multi-Objective Problems. Kluwer Academic Publishers, Dordrecht (2001)
Deb, K., Agrawal, R.B.: Simulated Binary Crossover for Continuous Search Space. Complex Systems 9, 115–148 (1995)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A Fast and Elitist Multi-Objective Genetic Algorithm: NSGA-II. Technical Report 200001, Indian Institute of Technology, Kanpur Genetic Algorithms Laboratory (KanGAL), Kanpur (2000)
Deb, K.: Multi-Objective Optimization using Evolutionary Algorithms. John Wiley & Sons LTD, Chichester (2001)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6(2), 182–197 (2002)
Deb, K., Anand, A., Joshi, D.: A Computationally Efficient Evolutionary Algorithms for Real-parameter Optimisation. Technical Report 2002003, Indian Institute of Technology, Kanpur Genetic Algorithms Laboratory (KanGAL), Kanpur (2002)
Eshelman, L.J., Schaffer, J.D.: Real-coded Genetic Algorithms and Interval-schemata. In: Proceedings of Foundations of Genetic Algorithms, vol. 2, pp. 187–202 (1993)
Fogel, L.J.: Autonomous Automata. Industrial Research 4, 14–19 (1962)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and machine Learning. Addison-Wesley, Reading (1989)
Hansen, M.P., Jaszkiewicz, A.: Evaluating the quality of approximations to the nondominated set. Technical Report IMM-REP-1998-7, Institute of Mathematical Modeling, Technical University of Denmark (1998)
Knowles, J., Corne, D.: On Metrics for Comparing Nondominated Sets. In: Proceedings of Congress on Evolutionary Computation (CEC-2002), pp. 711–716 (2002)
Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)
Okabe, T., Jin, Y., Sendhoff, B.: On the Dynamics of Evolutionary Multi-Objective Optimisation. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO-2002), pp. 247–255 (2002)
Okabe, T., Jin, Y., Sendhoff, B.: A Critical Survey of Performance Indices for Multi-Objective Optimisation. In: Proceedings of Congress on Evolutionary Computation (CEC-2003), pp. 878–885 (2003)
Okabe, T.: Evolutionary Multi-Objective Optimization - On the Distribution of Offspring in Parameter and Fitness Space. Sharker Verlag (2004)
Ono, I., Kobayashi, S.: A Real-coded Genetic Algorithm for Function Optimization Using Unimodal Normal Distribution Crossover. In: Proceedings of the Seventh International Conference on Genetic Algorithms, pp. 246–253 (1997)
Rechenberg, I.: Evolutionsstrategie 1994, Frommann-Holzboog (1994)
Zitzler, E., Deb, K., Thiele, L.: Comparison of Multiobjective Evolutionary Algorithms: Empirical Results. Evolutionary Computation 8(2), 173–195 (2000)
Zitzler, E., Laumanns, M., Thiele, L., Fonseca, C.M., Grunert da Fonseca, V.: Why Quality Assessment of Multiobjective Optimizers Is Difficult. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2002), pp. 666–673 (2002)
Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., Grunert da Fonseca, V.: Performance Assessment of Multiobjective Optimizers: An Analysis and Review. IEEE Transactions on Evolutionary Computation 7(2), 117–132 (2003)
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
Okabe, T., Jin, Y., Sendhoff, B. (2009). Combination of Genetic Algorithms and Evolution Strategies with Self-adaptive Switching. In: Goh, CK., Ong, YS., Tan, K.C. (eds) Multi-Objective Memetic Algorithms. Studies in Computational Intelligence, vol 171. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88051-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-88051-6_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88050-9
Online ISBN: 978-3-540-88051-6
eBook Packages: EngineeringEngineering (R0)