A Multiswarm Intelligence Algorithm for Expensive Bound Constrained Optimization Problems. (28th February 2021)
- Record Type:
- Journal Article
- Title:
- A Multiswarm Intelligence Algorithm for Expensive Bound Constrained Optimization Problems. (28th February 2021)
- Main Title:
- A Multiswarm Intelligence Algorithm for Expensive Bound Constrained Optimization Problems
- Authors:
- Mashwani, Wali Khan
Haider, Ruqayya
Brahim Belhaouari, Samir - Other Names:
- Khan Atif Academic Editor.
- Abstract:
- Abstract : Constrained optimization plays an important role in many decision-making problems and various real-world applications. In the last two decades, various evolutionary algorithms (EAs) were developed and still are developing under the umbrella of evolutionary computation. In general, EAs are mainly categorized into nature-inspired and swarm-intelligence- (SI-) based paradigms. All these developed algorithms have some merits and also demerits. Particle swarm optimization (PSO), firefly algorithm, ant colony optimization (ACO), and bat algorithm (BA) have gained much popularity and they have successfully tackled various test suites of benchmark functions and real-world problems. These SI-based algorithms follow the social and interactive principles to perform their search process while approximating solution for the given problems. In this paper, a multiswarm-intelligence-based algorithm (MSIA) is developed to cope with bound constrained functions. The suggested algorithm integrates the SI-based algorithms to evolve population and handle exploration versus exploitation issues. Thirty bound constrained benchmark functions are used to evaluate the performance of the proposed algorithm. The test suite of benchmark function is recently designed for the special session of EAs competition in IEEE Congress on Evolutionary Computation (IEEE-CEC′13). The suggested algorithm has approximated promising solutions with good convergence and diversity maintenance for most of the usedAbstract : Constrained optimization plays an important role in many decision-making problems and various real-world applications. In the last two decades, various evolutionary algorithms (EAs) were developed and still are developing under the umbrella of evolutionary computation. In general, EAs are mainly categorized into nature-inspired and swarm-intelligence- (SI-) based paradigms. All these developed algorithms have some merits and also demerits. Particle swarm optimization (PSO), firefly algorithm, ant colony optimization (ACO), and bat algorithm (BA) have gained much popularity and they have successfully tackled various test suites of benchmark functions and real-world problems. These SI-based algorithms follow the social and interactive principles to perform their search process while approximating solution for the given problems. In this paper, a multiswarm-intelligence-based algorithm (MSIA) is developed to cope with bound constrained functions. The suggested algorithm integrates the SI-based algorithms to evolve population and handle exploration versus exploitation issues. Thirty bound constrained benchmark functions are used to evaluate the performance of the proposed algorithm. The test suite of benchmark function is recently designed for the special session of EAs competition in IEEE Congress on Evolutionary Computation (IEEE-CEC′13). The suggested algorithm has approximated promising solutions with good convergence and diversity maintenance for most of the used bound constrained single optimization problems. … (more)
- Is Part Of:
- Complexity. Volume 2021(2021)
- Journal:
- Complexity
- Issue:
- Volume 2021(2021)
- Issue Display:
- Volume 2021, Issue 2021 (2021)
- Year:
- 2021
- Volume:
- 2021
- Issue:
- 2021
- Issue Sort Value:
- 2021-2021-2021-0000
- Page Start:
- Page End:
- Publication Date:
- 2021-02-28
- Subjects:
- Chaotic behavior in systems -- Periodicals
Complexity (Philosophy) -- Periodicals
003 - Journal URLs:
- https://onlinelibrary.wiley.com/journal/10990526 ↗
http://onlinelibrary.wiley.com/ ↗
https://www.hindawi.com/journals/complexity/ ↗ - DOI:
- 10.1155/2021/5521951 ↗
- Languages:
- English
- ISSNs:
- 1076-2787
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 3364.585500
British Library HMNTS - ELD Digital store - Ingest File:
- 16111.xml