Abstract
This paper considers the effect of swapping vectors during mutation, which are used for mutant vector construction. In the classic/canonical differential evolution three mutually different vector are picked from the population, where one represents the base vector, and the difference of the remaining two represents the difference vector. Motivated by the fact that there is no selection pressure in selecting the base vector, the effect of setting the best one of the selected three as the base vector is investigated. This way, a corresponding selection pressure is achieved and the exploration of the search space is directed more towards better solutions. Additionally, the order of the vectors used for generating the difference vector is considered as well. The experimental analysis conducted on a fair number of standard benchmark functions of different dimensionalities and properties indicates that the aforementioned approach performs competitively or better compared to the canonical differential evolution.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Storn, R., Price, K.: Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11, 342–359 (1997)
Price, K., Storn, R.M., Lampinen, J.A.: Differential Evolution: A Practical Approach to Global Optimization. Springer-Verlag New York Inc., Secaucus (2005)
Quaranta, G., Monti, G., Marano, G.C.: Parameters identification of Van der Pol-Duffing oscillators via particle swarm optimization and differential evolution. Mech. Syst. Signal Process. 24, 2076–2095 (2010)
Martinović, G., Bajer, D.: Data clustering with differential evolution incorporating macromutations. In: Panigrahi, B.K., Suganthan, P.N., Das, S., Dash, S.S. (eds.) SEMCCO 2013, Part I. LNCS, vol. 8297, pp. 158–169. Springer, Heidelberg (2013)
Martinović, G., Bajer, D., Zorić, B.: A differential evolution approach to dimensionality reduction for classification needs. Int. J. Appl. Math. Comput. Sci. 24, 111–122 (2014)
Salman, A.A., Ahmad, I., Omran, M.G.H., Mohammad, M.Gh.: Frequency assignment problem in satellite communications using differential evolution. Comput. Operat. Res. 37, 2152–2163 (2010)
Das, S., Suganthan, P.N.: Differential evolution: a survey of the state-of-the-art. IEEE Trans. Evol. Comput. 15, 4–31 (2011)
Das, S., Konar, A., Chakraborty, U.K.: Two improved differential evolution schemes for faster global search. In: 7th Annual Conference on Genetic and Evolutionary Computation, pp. 991–998. ACM, New York (2005)
Zhan, Z.-H., Zhang, J.: Enhance differential evolution with random walk. In: 14th International Conference on Genetic and Evolutionary Computation Conference Companion, pp. 1513–1514. ACM, New York (2012)
Liu, Y., Sun, F.: A fast differential evolution algorithm using k-nearest neighbour predictor. Expert Syst. Appl. 28, 4254–4258 (2011)
Huang, Z., Chen, Y.: An improved differential evolution algorithm based on adaptive parameter. J. Control Sci. Eng. 2013, 5 (2013)
Li, R., Xu, L., Shi, X.-W., Zhang, N., Lv, Z.-Q.: Improved differential evolution strategy for antenna array pattern synthesis problems. Prog. Electromagnet. Res. 113, 429–441 (2011)
Kaelo, P., Ali, M.M.: A numerical study of some modified differential evolution algorithms. Eur. J. Op. Res. 169, 1176–1184 (2006)
Neri, F., Tirronen, V.: Recent advances in differential evolution: a survey and experimental analysis. Artif. Intell. Rev. 33, 61–106 (2010)
Blickle, T., Thiele, L.: A comparison of selection schemes used in evolutionary algorithms. Evol. Comput. 4, 361–394 (1996)
Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J. Glob. Optim. 39, 459–471 (2007)
Noman, N., Bollegala, D., Iba, H.: An adaptive differential evolution algorithm. In: 2011 IEEE Congress on Evolutionary Computation, pp. 2229–2236 (2011)
Bansal, J.C., Singh, P.K., Saraswat, M., Verma, A., Jadon, S.S., Abraham, A.: Inertia weight strategies in particle swarm optimization. In: Third World Congress on Nature and Biologically Inspired Computing, pp. 633–640. IEEE (2011)
Yao, S., Liu, Y., Lin, G.: Evolutionary programming made faster. IEEE Trans. Evol. Comput. 3, 82–102 (1999)
Das, S., Abraham, A., Chakraborty, U.K., Konar, A.: Differential evolution using a neighborhood-based mutation operator. IEEE Trans. Evol. Comput. 13, 526–553 (2009)
Ji, M., Klinowski, J.: Taboo evolutionary programming: a new method of global optimization. Proc. R. Soc. A 462, 3613–3627 (2006)
Jamil, M., Yang, X.-S.: A literature survey of benchmark functions for global optimisation problems. Int. J. Math. Model. Numer. Optim. 4, 150–194 (2013)
Acknowledgments
This work was supported by research project grant No. 165-0362980-2002 from the Ministry of Science, Education and Sports of the Republic of Croatia. The authors would like to thank the anonymous reviewers for their useful comments that helped improve the paper.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Martinović, G., Bajer, D. (2015). The Effect of Swapping Vectors During Mutation in Differential Evolution. In: Panigrahi, B., Suganthan, P., Das, S. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2014. Lecture Notes in Computer Science(), vol 8947. Springer, Cham. https://doi.org/10.1007/978-3-319-20294-5_47
Download citation
DOI: https://doi.org/10.1007/978-3-319-20294-5_47
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-20293-8
Online ISBN: 978-3-319-20294-5
eBook Packages: Computer ScienceComputer Science (R0)