EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

A co-evolutionary algorithm with adaptive penalty function for constrained optimization

Vinícius Veloso de Melo, Alexandre Moreira Nascimento, Giovanni Iacca

Soft Computing · 2024-10 · 28 (19) · 11343-11376

DOI: 10.1007/s00500-024-09896-5 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Soft Computing, online erschienen am 26.07.2024. Verfasst von Vinícius Veloso de Melo und 2 weiteren Autor:innen. Die Arbeit wurde bisher 10-mal zitiert (Crossref) und nennt 119 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Università degli Studi di Trento.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Several constrained optimization problems have been adequately solved over the years thanks to the advances in the area of metaheuristics. Nevertheless, the question as to which search logic performs better on constrained optimization often arises. In this paper, we present Dual Search Optimization (DSO), a co-evolutionary algorithm that includes an adaptive penalty function to handle constrained problems. Compared to other self-adaptive metaheuristics, one of the main advantages of DSO is that it is able auto-construct its own perturbation logics, i.e., the ways solutions are modified to create new ones during the optimization process. This is accomplished by co-evolving the solutions (encoded as vectors of integer/real values) and perturbation strategies (encoded as Genetic Programming trees), in order to adapt the search to the problem. In addition to that, the adaptive penalty function allows the algorithm to handle constraints very effectively, yet with a minor additional algorithmic overhead. We compare DSO with several algorithms from the state-of-the-art on two sets of problems, namely: (1) seven well-known constrained engineering design problems and (2) the CEC 2017 benchmark for constrained optimization. Our results show that DSO can achieve state-of-the-art performances, being capable to automatically adjust its behavior to the problem at hand.

Förderung

  • Università degli Studi di Trento

Zitieren

APA

Melo, V. V. D., Nascimento, A. M., & Iacca, G. (2024). A co-evolutionary algorithm with adaptive penalty function for constrained optimization. Soft Computing, 28(19), 11343-11376. https://doi.org/10.1007/s00500-024-09896-5

Vancouver

Melo VVD, Nascimento AM, Iacca G. A co-evolutionary algorithm with adaptive penalty function for constrained optimization. Soft Computing. 2024;28(19):11343-11376. doi:10.1007/s00500-024-09896-5

BibTeX
@article{Melo2024,
  author = {Melo, Vinícius Veloso de and Nascimento, Alexandre Moreira and Iacca, Giovanni},
  title = {A co-evolutionary algorithm with adaptive penalty function for constrained optimization},
  journal = {Soft Computing},
  year = {2024},
  volume = {28},
  number = {19},
  pages = {11343--11376},
  doi = {10.1007/s00500-024-09896-5}
}
Kostenlos starten →