EUVIMEDEUVIMED entdecken
Crossref

Decomposition Algorithms for a Multi-Hard Problem

M R Przybylek, A Wierzbicki, Z Michalewicz

Evolutionary Computation · 2018-09 · 26 (3) · 507-533

DOI: 10.1162/evco_a_00211 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Evolutionary Computation, 2018-09. Verfasst von M R Przybylek und 2 weiteren Autor:innen. Beteiligte Einrichtung: Polish-Japanese Academy of Information Technology, Warsaw, Poland mrp@pja.edu.pl. Hauptthemen laut MEDLINE: Algorithms, Heuristics, Models, Theoretical, Problem Solving. Die Arbeit wurde bisher 7-mal zitiert (Crossref) und nennt 43 Literaturangaben.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Real-world optimization problems have been studied in the past, but the work resulted in approaches tailored to individual problems that could not be easily generalized. The reason for this limitation was the lack of appropriate models for the systematic study of salient aspects of real-world problems. The aim of this article is to study one of such aspects: multi-hardness. We propose a variety of decomposition-based algorithms for an abstract multi-hard problem and compare them against the most promising heuristics.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

AlgorithmsHeuristicsModels, TheoreticalProblem SolvingComputational BiologyHumans

Stichwörter der Autor:innen

Traveling Thief Problemcoevolutionmetaheuristicsmulti-hard problemsmulti-objective optimizationnon-separable problemsreal-world optimization problems.

Autor:innen und Institutionen

  • Polish-Japanese Academy of Information Technology, Warsaw, Poland mrp@pja.edu.pl.
  • Polish-Japanese Academy of Information Technology, Warsaw, Poland adamw@pja.edu.pl.
  • Complexica, Adelaide, Australia zm@complexica.com.

Zitieren

APA

Przybylek, M. R., Wierzbicki, A., & Michalewicz, Z. (2018). Decomposition Algorithms for a Multi-Hard Problem. Evolutionary Computation, 26(3), 507-533. https://doi.org/10.1162/evco_a_00211

Vancouver

Przybylek MR, Wierzbicki A, Michalewicz Z. Decomposition Algorithms for a Multi-Hard Problem. Evolutionary Computation. 2018;26(3):507-533. doi:10.1162/evco_a_00211

BibTeX
@article{Przybylek2018,
  author = {Przybylek, M R and Wierzbicki, A and Michalewicz, Z},
  title = {Decomposition Algorithms for a Multi-Hard Problem},
  journal = {Evolutionary Computation},
  year = {2018},
  volume = {26},
  number = {3},
  pages = {507--533},
  doi = {10.1162/evco_a_00211}
}
Kostenlos starten →