Broadening selection competitive constraint handling algorithm for faster convergence
In this paper, a new algorithm incorporating broadening selection strategy in competitive constraint handling paradigm for finding the optimum solution in constrained problems has been proposed, referred as Broadening Selection Competitive Constraint Handling (BSCCH). Although, competitive constrain...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Published: |
Institute of Information Science
2020
|
| Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85095865575&doi=10.6688%2fJISE.202011_36%286%29.0011&partnerID=40&md5=99a4a4b2f4b20da077b8ba9c35f6bf51 http://eprints.utp.edu.my/29798/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In this paper, a new algorithm incorporating broadening selection strategy in competitive constraint handling paradigm for finding the optimum solution in constrained problems has been proposed, referred as Broadening Selection Competitive Constraint Handling (BSCCH). Although, competitive constraint handling approaches have proved to be very efficient, but they lack faster convergence due to offspring generation from random individuals. By incorporating selection strategy such as broadening selection in the competitive approach, better results are obtained and convergence rate is improved significantly. Incorporating said strategy, the BSCCH algorithm has been proposed which is generic in nature and can be coupled with various evolutionary algorithms. In this study, the BSCCH algorithm has been coupled with Differential Evolution algorithm as a proof of concept because it is found to be an efficient algorithm in the literature for constrained optimization problems. The proposed algorithm has been evaluated using 24 benchmark functions. The mean closure performance of the BSCCH algorithm is compared against seven selected state-of-the-art algorithms, namely Differential Evolution with Adaptive Trial Vector Generation Strategy and Cluster-replacement-based Feasibility Rule (CACDE), Improved Teaching Learning Based Optimization (ITLBO), Modified Global Best Artificial Bee Colony (MGABC), Stochastic Ranking Differential Evolution (SRDE), Novel Differential Evolution (NDE), Partical Swarm Optimization for solving engineering problems-a new constraint handling mechanism (CVI-PSO) and Ensemble of Constraint Handling Techniques (ECHT). The median convergence traces have been compared with two different algorithms based on differential evolution, i:e: Ensemble of Constraint Handling Techniques (ECHT) and Stochastic Ranking Differential Evolution (SRDE). ECHT is considered to be a flagship ensemble technique till date for constrained optimization problems, whereas SRDE employs a parent selection mechanism for constrained optimization. The proposed algorithm is found to provide better solutions and achieve significantly faster convergence in most of the problems. © 2020 Institute of Information Science. All rights reserved. |
|---|