A test-suite of non-convex constrained optimization problems from the real-world and some baseline results

Real-world optimization problems have been comparatively difficult to solve due to the complex nature of the objective function with a substantial number of constraints. To deal with such problems, several metaheuristics as well as constraint handling approaches have been suggested. To validate the...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Swarm and evolutionary computation Ročník 56; s. 100693
Hlavní autori: Kumar, Abhishek, Wu, Guohua, Ali, Mostafa Z., Mallipeddi, Rammohan, Suganthan, Ponnuthurai Nagaratnam, Das, Swagatam
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 01.08.2020
Predmet:
Benchmark suite
Constraint handling technique
Metaheuristics
Real-world optimization problem
Benchmark suite
Real-world optimization problem
Metaheuristics
Constraint handling technique
ISSN:2210-6502
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Real-world optimization problems have been comparatively difficult to solve due to the complex nature of the objective function with a substantial number of constraints. To deal with such problems, several metaheuristics as well as constraint handling approaches have been suggested. To validate the effectiveness and strength, performance of a newly designed approach should be benchmarked by using some complex real-world problems, instead of only the toy problems with synthetic objective functions, mostly arising from the area of numerical analysis. A list of standard real-life problems appears to be the need of the time for benchmarking new algorithms in an efficient and unbiased manner. In this study, a set of 57 real-world Constrained Optimization Problems (COPs) are described and presented as a benchmark suite to validate the COPs. These problems are shown to capture a wide range of difficulties and challenges that arise from the real life optimization scenarios. Three state-of-the-art constrained optimization methods are exhaustively tested on these problems to analyze their hardness. The experimental outcomes reveal that the selected problems are indeed challenging to these algorithms, which have been shown to solve many synthetic benchmark problems easily.
ISSN:2210-6502
DOI:10.1016/j.swevo.2020.100693