Abstract
Population-based evolutionary algorithms (EAs) have been widely applied to solve various real-world optimization problems. In essence, they are a type of optimization techniques and traverse the population landscape in whatever direction that can lead to a peak or an optimal solution through climbing hills. The differences between different EAs are operators and combinations. Each EA has its own particular operators and its own particular combination of these operators. Typically, in EAs, there are three operators (i.e., crossover and/or mutation, and selection). Each EA utilizes its crossover operator and/or mutation operator to exploit and/or explore the search space of the problem, and utilizes its selection operator to guide the search towards the optimal region. Differential evolution (DE) and particle swarm optimization (PSO) are two relatively recent branches of EAs, have been successful in solving many real-world optimization problems, and have increasingly attracted researchers’ attention. Through comparing and contrasting similarities and dissimilarities between DE and PSO, in this study, we make an attempt to develop some variants of mutation inspired by PSO in DE. Numerical experiments are conducted on a test set of global 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
Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)
Rechenberg, I.: Evolution Strategy: Optimization of Technical Systems by Means of Biological Evolution. Fromman-Holzboog (1973)
Koza, J.R.: Genetic Programming: on the Programming of Computers by Means of Natural Selection. The MIT Press, Cambridge (1992)
Fogel, D.B.: Applying Evolutionary Programming to Selected Traveling Salesman Problems. Cybernetics and Systems 24, 27–36 (1993)
Yao, X., Xu, Y.: Recent Advances in Evolutionary Computation. Journal of Computer Science and Technology 21(1), 1–18 (2006)
Storn, R., Price, K.: Differential Evolution- A Simple and Efficient Adaptive Scheme for Global Optimization over Continuous Spaces. Technical Report TR-95-012, International Computer Science Institute, Berkeley, CA (1995)
Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: Proceedings of IEEE International Conference on Neural Networks, Perth, Australia, vol. 4, pp. 1942–1948. IEEE Service Center, Piscataway (1995)
Duan, H., Yu, X.: Hybrid Ant Colony Optimization Using Memetic Algorithm for Traveling Salesman Problem. In: Proceedings of the IEEE Symposium on Approximate Dynamic Programming and Reinforcement Learning, pp. 92–95 (2007)
Tsutsui, S., Yamamure, M., Higuchi, T.: Multi-Parent Recombination with Simplex Crossover in Real Coded Genetic Algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 1999), pp. 657–664. Morgan Kaufmann Publisher, San Mateo (1999)
Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, 3rd edn. Springer, New York (1996)
Costa, L., Oliveira, P.: An Evolution Strategy for Multiobjective Optimization. In: Congress on Evolutionary Computation (CEC 2002), vol. 1, pp. 97–102. IEEE Service Center, Piscataway (2002)
Ammaruekarat, P., Meesad, P.: A Chaos Search for Multi-Objective Memetic Algorithm. In: 2011 International Conference on Information and Electronics Engineering (IPCSIT 2011), vol. 6, pp. 140–144. IACSIT Press, Sinapore (2011)
Hedar, R., Fukushima, M.: Tabu Search Directed by Direct Search Methods for Nonlinear Global Optimization. European Journal of Operational Research 170(2), 329–349 (2006)
Bertsimas, D., Tsitsiklis, J.: Simulated Annealing. Statistical Science 8(1), 10–15 (1993)
Senaratna, N.I.: Genetic Algorithms: The Crossover-Mutation Debate. Degree of Bachelor of Computer Science of the University of Colombo (2005)
Fogel, D.B., Atmar, J.W.: Comparing Genetic Operators with Gaussian Mutations in Simulated Evolutionary Processes Using Linear Systems. Biological Cybernetics (1990)
Matsui, S., Tokoro, K.I.: Improving the Performance of a Genetic Algorithm for Minimum Span Frequency Assignment Problem with an Adaptive Mutation Rate and a New Initialization Method. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2001), pp. 1359–1366. Morgan Kaufmann Publishers, San Francisco (2001)
Younes, Ghenniwa, H., Areibi, S.: An Adaptive Genetic Algorithm for Multiobjective Flexible Manufacturing Systems. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002), pp. 1241–1248. Morgan Kaufmann Publishers, San Francisco (2002)
Deb, K., Padhye, N.: Improving a Particle Swarm Optimization Algorithm Using an Evolutionary Algorithm Framework. KanGAL Report Number 2010003, Kanpur Genetic Algorithms Laboratory, Department of Mechanical Engineering, Indian Institute of Technology Kanpur, PIN 208016, India, February 21 (2010)
Das, S., Abraham, A., Chakraborty, U.K., Konar, A.: Differential Evolution Using a Neighborhood-Based Mutation Operator. IEEE Transactions on Evolutionary Computation 13(3), 526–553 (2009)
Rahnamayan, S., Tizhoosh, H.R., Salama, M.M.A.: Opposition-Based Differential Evolution. IEEE Transactions on Evolutionary Computation 12(1), 64–79 (2008)
Bergh, F.V.D., Engelbrecht, A.P.: A Cooperative Approach to Particle Swarm Optimization. IEEE Transactions on Evolutionary Computation 8(3), 1–15 (2004)
Coelho, L.D.S.: Gaussian Quantum-Behaved Particle Swarm Optimization Approaches for Constrained Engineering Design Problems. Expert Systems with Applications 37(2), 1676–1683 (2010)
Storn, R., Price, K.: Differential Evolution- A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces. Journal of Global Optimization 11(4), 341–359 (1997)
Eberhart, R.C., Kennedy, J.: A New Optimizer Using Particle Swarm Theory. In: Proceedings of the Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, pp. 39–43. IEEE Service Center, Piscataway (1995)
Shi, Y., Eberhart, R.C.: Empirical Study of Particle Swarm Optimization. In: Proceedings of the Congress on Evolutionary Computation, Washington DC, USA, pp. 1945–1949. IEEE Service Center, Piscataway (1999)
Helwig, S., Wanka, R.: Particle Swarm Optimization in High-Dimensional Bounded Search Spaces. In: Proceedings of the 2007 IEEE Swarm Intelligence Symposium (SIS 2007), Honolulu, Hawaii, USA, pp. 198–205. IEEE Press (April 2007)
Zahara, E., Hu, C.H.: Solving Constrained Optimization Problems with Hybrid Particle Swarm Optimization. Engineering Optimization 40(11), 1031–1049 (2008)
Kennedy, J.: The Particle Swarm: Social Adaptation of Knowledge. In: Proceedings of the International Conference on Evolutionary Computation, Indianapolis, IN, USA, pp. 303–308 (1997)
Clerc, M.: The Swarm and the Queen: towards a Deterministic and Adaptive Particle Swarm Optimization. In: Proceedings of the Congress on Evolutionary Computation, Washington DC, USA, pp. 1951–1957. IEEE Service Center, Piscataway (1999)
Bäck, T., Schwefel, H.: An Overview of Evolution Algorithms for Parameter Optimizations. Evolutionary Computation 1(1), 1–23 (1993)
Floudas, C.A., Pardalos, P.M., Adjiman, C.S., Esposito, W.R., Gumus, Z., Harding, S.T., Klepeis, J.L., Meyer, C.A., Schweiger, C.A. (eds.): Handbook of Test Problems for Local and Global Optimization. Kluwer Academic Publishers, Boston (1999)
Ao, Y., Chi, H.: Experimental Study on Differential Evolution Strategies. In: 2009 Global Congress on Intelligent Systems (GCIS 2009), vol. 2, pp. 19–24 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ao, Y. (2012). Simulated Mutation in Differential Evolution. In: Zhao, M., Sha, J. (eds) Communications and Information Processing. Communications in Computer and Information Science, vol 288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31965-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-31965-5_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31964-8
Online ISBN: 978-3-642-31965-5
eBook Packages: Computer ScienceComputer Science (R0)