A Benchmark-Suite of real-World constrained multi-objective optimization problems and some baseline results

Generally, Synthetic Benchmark Problems (SBPs) are utilized to assess the performance of metaheuristics. However, these SBPs may include various unrealistic properties. As a consequence, performance assessment may lead to underestimation or overestimation. To address this issue, few benchmark suites...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Swarm and evolutionary computation Ročník 67; s. 100961
Hlavní autoři: Kumar, Abhishek, Wu, Guohua, Ali, Mostafa Z., Luo, Qizhang, Mallipeddi, Rammohan, Suganthan, Ponnuthurai Nagaratnam, Das, Swagatam
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.12.2021
Témata:
ISSN:2210-6502
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Generally, Synthetic Benchmark Problems (SBPs) are utilized to assess the performance of metaheuristics. However, these SBPs may include various unrealistic properties. As a consequence, performance assessment may lead to underestimation or overestimation. To address this issue, few benchmark suites containing real-world problems have been proposed for all kinds of metaheuristics except for Constrained Multi-objective Metaheuristics (CMOMs). To fill this gap, we develop a benchmark suite of Real-world Constrained Multi-objective Optimization Problems (RWCMOPs) for performance assessment of CMOMs. This benchmark suite includes 50 problems collected from various streams of research. We also present the baseline results of this benchmark suite by using state-of-the-art algorithms. Besides, for comparative analysis, a ranking scheme is also proposed.
ISSN:2210-6502
DOI:10.1016/j.swevo.2021.100961