EUVIMEDEUVIMED entdecken
Crossref

Automatic Configuration of Multi-Objective Local Search Algorithms for Permutation Problems

Aymeric Blot, Marie-Éléonore Kessaci, Laetitia Jourdan, Holger H Hoos

Evolutionary Computation · 2019-03 · 27 (1) · 147-171

DOI: 10.1162/evco_a_00240 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Evolutionary Computation, 2019-03. Verfasst von Aymeric Blot und 3 weiteren Autor:innen. Beteiligte Einrichtung: Univ. Lille, CNRS, Centrale Lille, UMR 9189 - CRIStAL - Centre de Recherche en Informatique Signal et Automatique de Lille, F-59000 Lille, France aym…. Hauptthemen laut MEDLINE: Algorithms, Computer Simulation, Models, Theoretical, Problem Solving. Die Arbeit wurde bisher 20-mal zitiert (Crossref) und nennt 25 Literaturangaben.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Automatic algorithm configuration (AAC) is becoming a key ingredient in the design of high-performance solvers for challenging optimisation problems. However, most existing work on AAC deals with configuration procedures that optimise a single performance metric of a given, single-objective algorithm. Of course, these configurators can also be used to optimise the performance of multi-objective algorithms, as measured by a single performance indicator. In this work, we demonstrate that better results can be obtained by using a native, multi-objective algorithm configuration procedure. Specifically, we compare three AAC approaches: one considering only the hypervolume indicator, a second optimising the weighted sum of hypervolume and spread, and a third that simultaneously optimises these complementary indicators, using a genuinely multi-objective approach. We assess these approaches by applying them to a highly-parametric local search framework for two widely studied multi-objective optimisation problems, the bi-objective permutation flowshop and travelling salesman problems. Our results show that multi-objective algorithms are indeed best configured using a multi-objective configurator.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

AlgorithmsComputer SimulationModels, TheoreticalProblem SolvingHumansInformation Storage and RetrievalPattern Recognition, Automated

Stichwörter der Autor:innen

Algorithm configurationlocal searchmulti-objective optimisationpermutation flowshop scheduling problemtravelling salesman problem.

Autor:innen und Institutionen

  • Univ. Lille, CNRS, Centrale Lille, UMR 9189 - CRIStAL - Centre de Recherche en Informatique Signal et Automatique de Lille, F-59000 Lille, France aymeric.blot@univ-lille.fr.
  • Univ. Lille, CNRS, Centrale Lille, UMR 9189 - CRIStAL - Centre de Recherche en Informatique Signal et Automatique de Lille, F-59000 Lille, France mkessaci@univ-lille.fr.
  • Univ. Lille, CNRS, Centrale Lille, UMR 9189 - CRIStAL - Centre de Recherche en Informatique Signal et Automatique de Lille, F-59000 Lille, France laetitia.jourdan@univ-lille.fr.
  • LIACS, Leiden University, Leiden, 2333 CA, The Netherlands hh@liacs.nl.

Zitieren

APA

Blot, A., Kessaci, M. É., Jourdan, L., & Hoos, H. H. (2019). Automatic Configuration of Multi-Objective Local Search Algorithms for Permutation Problems. Evolutionary Computation, 27(1), 147-171. https://doi.org/10.1162/evco_a_00240

Vancouver

Blot A, Kessaci MÉ, Jourdan L, Hoos HH. Automatic Configuration of Multi-Objective Local Search Algorithms for Permutation Problems. Evolutionary Computation. 2019;27(1):147-171. doi:10.1162/evco_a_00240

BibTeX
@article{Blot2019,
  author = {Blot, Aymeric and Kessaci, Marie-Éléonore and Jourdan, Laetitia and Hoos, Holger H},
  title = {Automatic Configuration of Multi-Objective Local Search Algorithms for Permutation Problems},
  journal = {Evolutionary Computation},
  year = {2019},
  volume = {27},
  number = {1},
  pages = {147--171},
  doi = {10.1162/evco_a_00240}
}
Kostenlos starten →