Artificial IntelligenceNo Access

An Improved Centroid-Based Boundary Constraint-Handling Method in Differential Evolution for Constrained Optimization

Artificial Intelligence Research Center, University of Veracruz, Sebastián Camacho #5, Centro, Xalapa, Veracruz, 91000, MÉXICO

E-mail Address: juarezefren@hotmail.com

Search for more papers by this author

Nancy Pérez-Castro

Artificial Intelligence Research Center, University of Veracruz, Sebastián Camacho #5, Centro, Xalapa, Veracruz, 91000, MÉXICO

E-mail Address: perez.castro.nancy@gmail.com

Search for more papers by this author

, and

Efrén Mezura-Montes

Artificial Intelligence Research Center, University of Veracruz, Sebastián Camacho #5, Centro, Xalapa, Veracruz, 91000, MÉXICO

E-mail Address: emezura@uv.mx

Search for more papers by this author

https://doi.org/10.1142/S0218001417590236Cited by:6 (Source: Crossref)

Abstract

Differential Evolution (DE) is a population-based Evolutionary Algorithm (EA) for solving optimization problems over continuous spaces. Many optimization problems are constrained and have a bounded search space from which some vectors leave when the mutation operator of DE is applied. Therefore, it is necessary the use of a boundary constraint-handling method (BCHM) in order to repair the invalid mutant vectors. This paper presents a generalized and improved version of the Centroid BCHM in order to keep the search within the valid ranges of decision variables in constrained numerical optimization problems (CNOPs), which has been tested on a robust and comprehensive set of experiments that include a variant of DE specialized in dealing with CNOPs. This new version, named Centroid $K + 1$ , relocates the mutant vector in the centroid formed by K random vectors and one vector taken from the population that is within or near the feasible region. The results show that this new version has a major impact on the algorithm’s performance, and it is able to promote better final results through the improvement of both, the approach to the feasible region and the ability to generate better solutions.

Keywords:

References

1. M. Antonelli, P. Ducange, B. Lazzerini and F. Marcelloni , Multi-objective evolutionary design of granular rule-based classifiers, Granular Comput. 1 (1) (2016) 37–58. Crossref, Google Scholar
2. J. Arabas, A. Szczepankiewicz and T. Wroniak , Experimental comparison of methods to handle boundary constraints in differential evolution, in Int. Conf. Parallel Problem Solving from Nature (Springer, 2010), pp. 411–420. Google Scholar
3. T. Bäck, D. B. Fogel and Z. Michalewicz , Handbook of Evolutionary Computation (IOP Publishing, 1997). Crossref, Google Scholar
4. J. Brest, S. Greiner, B. Boskovic, M. Mernik and V. Zumer , Self-adapting control parameters in differential evolution: A comparative study on numerical benchmark problems, IEEE Trans. Evolutionary Computation 10 (6) (2006) 646–657. Crossref, Web of Science, Google Scholar
5. W. Chu, X. Gao and S. Sorooshian , Handling boundary constraints for particle swarm optimization in high-dimensional search space, Inf. Sci. 181 (20) (2011) 4569–4581. Crossref, Web of Science, Google Scholar
6. D. Ciucci , Orthopairs and granular computing, Granular Comput. 1 (3) (2016) 159–170. Crossref, Google Scholar
7. K. Deb , An efficient constraint handling method for genetic algorithms, Comput. Methods Appl. Mech. Eng. 186 (2) (2000) 311–338. Crossref, Web of Science, Google Scholar
8. D. Dubois and H. Prade , Bridging gaps between several forms of granular computing, Granular Comput. 1 (2) (2016) 115–126. Crossref, Google Scholar
9. V. Feoktistov , Differential Evolution: In Search of Solutions (Springer Optimization and Its Applications) (Springer-Verlag, New York, 2006). Google Scholar
10. D. Fowler , The binomial coefficient function, American Math. Monthly 103 (1) (1996) 1–17. Crossref, Web of Science, Google Scholar
11. A. H. Gandomi, A. R. Kashani and M. Mousavi , Boundary constraint handling affection on slope stability analysis, in Engineering and Applied Sciences Optimization (Springer, 2015), pp. 341–358. Crossref, Google Scholar
12. A. H. Gandomi and X.-S. Yang , Evolutionary boundary constraint handling scheme, Neural Comput. Appl. 21 (6) (2012) 1449–1462. Crossref, Web of Science, Google Scholar
13. S. Helwig, J. Branke and S. Mostaghim , Experimental analysis of bound handling techniques in particle swarm optimization, IEEE Trans. Evol. Comput. 17 (2) (2013) 259–271. Crossref, Web of Science, Google Scholar
14. T. Huang and A. Mohan , A hybrid boundary condition for robust particle swarm optimization, IEEE Antennas Wirel. Propag. Lett. 4 (2005) 112–117. Crossref, Web of Science, Google Scholar
15. G. Jia, Y. Wang, Z. Cai and Y. Jin , An improved ( $μ + λ$ )-constrained differential evolution for constrained optimization, Inf. Sci. 222 (2013) 302–322. Crossref, Web of Science, Google Scholar
16. E. Juárez-Castillo, N. Pérez-Castro and E. Mezura-Montes , A novel boundary constraint-handling technique for constrained numerical optimization problems, in 2015 IEEE Congress on Evolutionary Computation (CEC) (IEEE, 2015), pp. 2034–2041. Google Scholar
17. S. Kukkonen and J. Lampinen , Gde3: The third evolution step of generalized differential evolution, in 2005 IEEE Congress on Evolutionary Computation, Vol. 1 (IEEE, 2005), pp. 443–450. Google Scholar
18. P. Lingras, F. Haider and M. Triff , Granular meta-clustering based on hierarchical, network, and temporal connections, Granular Comput. 1 (1) (2016) 71–92. Crossref, Google Scholar
19. H. Liu, A. Gegov and M. Cocea , Rule-based systems: A granular computing perspective, Granular Comput. 1 (4) (2016) 259–274. Crossref, Google Scholar
20. H.-L. Liu, C. Peng, F. Gu and J. Wen , A constrained multi-objective evolutionary algorithm based on boundary search and archive, Int. J. Pattern Recognit. Artif. Intell. 30 (1) (2016) 1659002. Link, Web of Science, Google Scholar
21. Q. Liu, B. J. van Wyk, S. Du and Y. Sun , Dynamic small world network topology for particle swarm optimization, Int. J. Pattern Recognit. Artif. Intell. 30 (09) (2016) 1660009. Link, Web of Science, Google Scholar
22. L. Livi and A. Sadeghian , Granular computing, computational intelligence, and the analysis of non-geometric input spaces, Granular Comput. 1 (1) (2016) 13–20. Crossref, Google Scholar
23. V. Loia, G. D’Aniello, A. Gaeta and F. Orciuoli , Enforcing situation awareness with granular computing: A systematic overview and new perspectives, Granular Comput. 1 (2) (2016) 127–143. Crossref, Google Scholar
24. R. Mallipeddi and P. N. Suganthan, Problem definitions and evaluation criteria for the cec 2010 competition on constrained real-parameter optimization, Nanyang Technological University, Singapore (2010). Google Scholar
25. E. Mezura-Montes and C. A. C. Coello , Constraint-handling in nature-inspired numerical optimization: Past, present and future, Swarm Evol. Comput. 1 (4) (2011) 173–194. Crossref, Web of Science, Google Scholar
26. F. Min and J. Xu , Semi-greedy heuristics for feature selection with test cost constraints, Granular Comput. 1 (3) (2016) 199–211. Crossref, Google Scholar
27. N. Padhye, K. Deb and P. Mittal , Boundary handling approaches in particle swarm optimization, in Proc. Seventh Int. Conf. Bio-Inspired Computing: Theories and Applications (BIC-TA 2012) (Springer, 2013), pp. 287–298. Google Scholar
28. S. Pei, A. Ouyang and L. Tong , A hybrid algorithm based on bat-inspired algorithm and differential evolution for constrained optimization problems, Int. J. Pattern Recognit. Artif. Intell. 29 (04) (2015) 1559007. Link, Web of Science, Google Scholar
29. G. Peters and R. Weber , Dcc: A framework for dynamic granular clustering, Granular Comput. 1 (1) (2016) 1–11. Crossref, Google Scholar
30. K. Price, R. M. Storn and J. A. Lampinen , Differential Evolution: A Practical Approach to Global Optimization, Natural Computing Series (Springer, Berlin Heidelberg, 2005). Google Scholar
31. J. Ronkkonen, S. Kukkonen and K. V. Price , Real-parameter optimization with differential evolution, in Proc. IEEE CEC, Vol. 1 (2005), pp. 506–513. Google Scholar
32. T. P. Runarsson and X. Yao , Stochastic ranking for constrained evolutionary optimization, IEEE Trans. Evol. Comput. 4 (3) (2000) 284–294. Crossref, Web of Science, Google Scholar
33. Y. Shi, S. Cheng and Q. Qin , Experimental study on boundary constraints handling in particle swarm optimization: From population diversity perspective, Int. J. Swarm Intell. Res. 2 (3) (2011) 43–69. Crossref, Google Scholar
34. A. Skowron, A. Jankowski and S. Dutta , Interactive granular computing, Granular Comput. 1 (2) (2016) 95–113. Crossref, Google Scholar
35. M. Song and Y. Wang , A study of granular computing in the agenda of growth of artificial neural networks, Granular Comput. 1 (4) (2016) 247–257. Crossref, Google Scholar
36. R. Storn and K. Price , Differential evolution–a simple and efficient heuristic for global optimization over continuous spaces, J. Glob. Optim. 11 (4) (1997) 341–359. Crossref, Web of Science, Google Scholar
37. I. N. Trivedi, A. H. Gandomi, P. Jangir and N. Jangir , Study of different boundary constraint handling schemes in interior search algorithm, International Conference on Artificial Intelligence and Evolutionary Computations in Engineering Systems, ICAIECES-2016 (2015). Google Scholar
38. P. Wang, C. Zhang, B. Zhang, T. Liu and J. Wu , A dimensional diversity based hybrid multiobjective evolutionary algorithm for optimization problem, Int. J. Pattern Recognit. Artif. Intell. 30 (7) (2016) 1659020. Link, Web of Science, Google Scholar
39. S. Wessing , Repair methods for box constraints revisited, in European Conf. Applications of Evolutionary Computation (Springer, 2013), pp. 469–478. Google Scholar
40. G. Wilke and E. Portmann , Granular computing as a basis of human–data interaction: A cognitive cities use case, Granular Comput. 1 (3) (2016) 181–197. Crossref, Google Scholar
41. S. Xu and Y. Rahmat-Samii , Boundary conditions in particle swarm optimization revisited, IEEE Trans. Antennas Propag. 55 (3) (2007) 760–765. Crossref, Web of Science, Google Scholar
42. Y. Yao , A triarchic theory of granular computing, Granular Comput. 1 (2) (2016) 145–157. Crossref, Google Scholar
43. W.-J. Zhang, X.-F. Xie and D.-C. Bi , Handling boundary constraints for numerical optimization by particle swarm flying in periodic search space, in Congress on Evolutionary Computation, 2004, (CEC2004), Vol. 2 (IEEE, 2004), pp. 2307–2311. Google Scholar