Abstract
The role of parent selection is to distinguish between individuals based on their quality. Parent selection has been a key component in the design of evolutionary algorithms, since it is partially responsible for improving the quality of the population. Stochastic ranking is quite a successful approach for evolutionary constrained optimization, and has usually been employed during the survival selection process. This paper provides the first insight into the use of the stochastic ranking procedure during the parent selection mechanism in the design of new evolutionary algorithms for constraint handling. We adopted differential evolution as the base algorithm, mainly because of its outstanding performance in continuous optimization found in literature. We undertake seven experiments in order to validate our proposal. The results indicate that our proposed approach is able to find solutions that are competitive with respect to other recently proposed approaches, but uses a fraction of the required computational effort. Furthermore, our proposal can easily be incorporated into any probabilistic evolutionary algorithm that is based on parent selection.
Similar content being viewed by others
References
Back T (1994) Selective pressure in evolutionary algorithms: a characterization of selection mechanisms. In: Proceedings of the first IEEE conference on evolutionary computation, 1994. IEEE world congress on computational intelligence, vol 1, pp 57–62
Chen P, Zhao C, Li J, Liu Z (2009) Solving the economic dispatch in power system via a modified genetic particle swarm optimization. In: International joint conference on computational sciences and optimization, 2009. CSO 2009, vol 1, pp 201–204
Coello Coello CA (2012) Constraint-handling techniques used with evolutionary algorithms. In: Proceedings of the 14th annual conference companion on genetic and evolutionary computation. GECCO ’12. ACM, New York, pp 849–872
Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evolut Comput 6(2):182–197
Fan Z, Liu J, Sorensen T, Wang P (2009) Improved differential evolution based on stochastic ranking for robust layout synthesis of mems components. IEEE Trans Ind Electron 56(4):937–948
Fu H, Mei Y, Tang K, Zhu Y (2010) Memetic algorithm with heuristic candidate list strategy for capacitated arc routing problem. In: 2010 IEEE congress on evolutionary computation (CEC), pp 1–8
Gong M-G, Jiao L-C, Du H-F, Ma W-P (2007) Novel evolutionary strategy based on artificial immune response for constrained optimizations. Jisuanji Xuebao/Chinese J Comput 30(1):37–47
Jia G, Wang Y, Cai Z, Jin Y (2013) An improved (\(\mu \) + \(\lambda \))-constrained differential evolution for constrained optimization. Inf Sci 222:302–322
Jian L, Peng C, Zhiming L (2008a) Solving constrained optimization via dual particle swarm optimization with stochastic ranking. In: 2008 International conference on computer science and software engineering, vol 1, pp 1215–1218
Jian L, Peng C, Zhiming L (2008b) Solving the economic dispatch in power system by genetic particle evolutionary swarm optimization. In: 2008 International conference on computer science and software engineering, vol 1, pp 451–454
Koziel S, Michalewicz Z (1999) Evolutionary algorithms, homomorphous mappings, and constrained parameter optimization. Evol Comput 7(1):19–44
Lampinen J (2002) A constraint handling approach for the differential evolution algorithm. In: Proceedings of the 2002 congress on evolutionary computation, 2002. CEC ’02, vol 2, pp 1468–1473
Landa Becerra R, Coello Coello CA (2006) Cultured differential evolution for constrained optimization. Comput Methods Appl Mech Eng 195(3336):4303–4322
Liang JJ, Runarsson TP, Mezura-Montes E, Clerc M, Suganthan1 PN, Coello CAC, Deb K (2006) Problem definitions and evaluation criteria for the CEC 2006. Technical report, Nanyang Technological University
Liu R, Li Y, Zhang W, Jiao L (2009) Stochastic ranking based differential evolution algorithm for constrained optimization problem. In: Proceedings of the first ACM/SIGEVO summit on genetic and evolutionary computation. GEC ’09. ACM, New York, pp 887–890
Mei Y, Tang K, Yao X (2011) A memetic algorithm for periodic capacitated arc routing problem. Trans Syst Man Cybern Part B 41(6):1654–1667
Meyer B (2005) Constraint handling and stochastic ranking in ACO. In: The 2005 IEEE congress on evolutionary computation, 2005, vol 3, pp 2683–2690
Mezura-Montes E, Coello Coello CA, Tun-Morales EI (2004) Simple feasibility rules and differential evolution for constrained optimization. In: Monroy R, Arroyo-Figueroa G, Sucar LE, Sossa H (eds) MICAI 2004: advances in artificial intelligence, vol 2972. Lecture notes in computer science. Springer, Berlin, pp 707–716
Mezura-Montes E, Velazquez-Reyes J, Coello Coello C (2006) Modified differential evolution for constrained optimization. In: IEEE congress on evolutionary computation, 2006. CEC 2006, pp 25–32
Mezura-Montes E, Miranda-Varela ME, del Carmen Gómez-Ramón R (2010) Differential evolution in constrained numerical optimization: an empirical study. Inf Sci 180(22):4223–4262
Mohamed AW, Sabry HZ (2012) Constrained optimization based on modified differential evolution algorithm. Inf Sci 194:171–208. Intelligent knowledge-based models and methodologies for complex information systems
Price KV (1999) Chap An introduction to differential evolution. In: Corne D, Dorigo M, Glover F, Dasgupta D, Moscato P, Poli R, Price KV (eds) New ideas in optimization. McGraw-Hill Ltd., Maidenhead, pp 79–108
Price K, Storn RM, Lampinen JA (2005) Differential evolution: a practical approach to global optimization (natural computing series). Springer-Verlag New York Inc, Secaucus
Runarsson T, Yao X (2000) Stochastic ranking for constrained evolutionary optimization. IEEE Trans Evolut Comput 4(3):284–294
Simon D (2013) Evolutionary optimization algorithms. Wiley, New York
Storn R, Price K (1997) Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341–359
Tang K, Mei Y, Yao X (2009) Memetic algorithm with extended neighborhood search for capacitated arc routing problems. IEEE Trans Evolut Comput 13(5):1151–1166
Yang Z, Tang K, Yao X (2008a) Self-adaptive differential evolution with neighborhood search. In: IEEE congress on evolutionary computation, 2008. CEC 2008. (IEEE world congress on computational intelligence), June 2008, pp 1110–1116
Yang Z, Yao X, He J (2008b) Making a difference to differential evolution. In: Siarry P, Michalewicz Z (eds) Advances in metaheuristics for hard optimization. Natural computing series, Springer, Berlin, pp 397–414
Zhang J, Sanderson AC (2007) Jade: Self-adaptive differential evolution with fast and reliable convergence performance. In: IEEE congress on evolutionary computation, 2007. CEC 2007, Sept 2007, pp 2251–2258
Zhang Y, Hall L, Goldgof D, Sarkar S (2006) A constrained genetic approach for computing material property of elastic objects. IEEE Trans Evolut Comput 10(3):341–357
Zhang M, Luo W, Wang X (2008) Differential evolution with dynamic stochastic selection for constrained optimization. Inf Sci 178(15):3043–3074. Nature inspired problem-solving
Acknowledgments
G. Toscano and G. Leguizamón acknowledge support from MinCyT bi-lateral Project MX1103 and CONACyT bi-lateral Project No. 164626. G. Lárraga acknowledges support from CONACyT and CINVESTAV-Tamaulipas to pursue graduate studies.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Communicated by V. Loia.
Electronic supplementary material
Below is the link to the electronic supplementary material.
Rights and permissions
About this article
Cite this article
Toscano, G., Landa, R., Lárraga, G. et al. On the use of stochastic ranking for parent selection in differential evolution for constrained optimization. Soft Comput 21, 4617–4633 (2017). https://doi.org/10.1007/s00500-016-2073-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-016-2073-6