EUVIMEDEUVIMED entdecken
Crossref

The Importance of Being Constrained: Dealing with Infeasible Solutions in Differential Evolution and Beyond

Anna V Kononova, Diederick Vermetten, Fabio Caraffini, Madalina-A Mitran, Daniela Zaharie

Evolutionary Computation · 01.03.2024 · 32 (1) · 3-48

DOI: 10.1162/evco_a_00333 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Evolutionary Computation, online erschienen am 01.03.2024. Verfasst von Anna V Kononova und 4 weiteren Autor:innen. Beteiligte Einrichtung: LIACS, Leiden University, The Netherlands a.kononova@liacs.leidenuniv.nl. Hauptthemen laut MEDLINE: Algorithms, Gastropoda. Die Arbeit wurde bisher 26-mal zitiert (Crossref) und nennt 89 Literaturangaben.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We argue that results produced by a heuristic optimisation algorithm cannot be considered reproducible unless the algorithm fully specifies what should be done with solutions generated outside the domain, even in the case of simple bound constraints. Currently, in the field of heuristic optimisation, such specification is rarely mentioned or investigated due to the assumed triviality or insignificance of this question. Here, we demonstrate that, at least in algorithms based on Differential Evolution, this choice induces notably different behaviours in terms of performance, disruptiveness, and population diversity. This is shown theoretically (where possible) for standard Differential Evolution in the absence of selection pressure and experimentally for the standard and state-of-the-art Differential Evolution variants, on a special test function and the BBOB benchmarking suite, respectively. Moreover, we demonstrate that the importance of this choice quickly grows with problem dimensionality. Differential Evolution is not at all special in this regard—there is no reason to presume that other heuristic optimisers are not equally affected by the aforementioned algorithmic choice. Thus, we urge the heuristic optimisation community to formalise and adopt the idea of a new algorithmic component in heuristic optimisers, which we refer to as the strategy of dealing with infeasible solutions. This component needs to be consistently: (a) specified in algorithmic descriptions to guarantee reproducibility of results, (b) studied to better understand its impact on an algorithm's performance in a wider sense (i.e., convergence time, robustness, etc.), and (c) included in the (automatic) design of algorithms. All of these should be done even for problems with bound constraints.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

AlgorithmsGastropodaAnimalsReproducibility of ResultsHeuristics

Stichwörter der Autor:innen

Bound constraintalgorithmic behaviour

Autor:innen und Institutionen

  • LIACS, Leiden University, The Netherlands a.kononova@liacs.leidenuniv.nl.
  • LIACS, Leiden University, The Netherlands d.l.vermetten@liacs.leidenuniv.nl.
  • Department of Computer Science, Swansea University, United Kingdom fabio.caraffini@swansea.ac.uk.
  • Department of Computer Science, West University of Timişoara, Romania madalina.mitran96@e-uvt.ro.
  • Department of Computer Science, West University of Timişoara, Romania daniela.zaharie@e-uvt.ro.

Zitieren

APA

Kononova, A. V., Vermetten, D., Caraffini, F., Mitran, M. A., & Zaharie, D. (2024). The Importance of Being Constrained: Dealing with Infeasible Solutions in Differential Evolution and Beyond. Evolutionary Computation, 32(1), 3-48. https://doi.org/10.1162/evco_a_00333

Vancouver

Kononova AV, Vermetten D, Caraffini F, Mitran MA, Zaharie D. The Importance of Being Constrained: Dealing with Infeasible Solutions in Differential Evolution and Beyond. Evolutionary Computation. 2024;32(1):3-48. doi:10.1162/evco_a_00333

BibTeX
@article{Kononova2024,
  author = {Kononova, Anna V and Vermetten, Diederick and Caraffini, Fabio and Mitran, Madalina-A and Zaharie, Daniela},
  title = {The Importance of Being Constrained: Dealing with Infeasible Solutions in Differential Evolution and Beyond},
  journal = {Evolutionary Computation},
  year = {2024},
  volume = {32},
  number = {1},
  pages = {3--48},
  doi = {10.1162/evco_a_00333}
}
Kostenlos starten →