EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

A Learnheuristic Algorithm for the Capacitated Dispersion Problem under Dynamic Conditions

Juan F. Gomez, Antonio R. Uguina, Javier Panadero, Angel A. Juan

Algorithms · 22.11.2023 · 16 (12) · 532

DOI: 10.3390/a16120532 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Algorithms, online erschienen am 22.11.2023. Verfasst von Juan F. Gomez und 3 weiteren Autor:innen. Die Arbeit wurde bisher 9-mal zitiert (Crossref) und nennt 33 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Spanish Ministry of Science and Innovation, SUN project of the Horizon Europe program, i4OPT project of the Generalitat Valenciana.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The capacitated dispersion problem, which is a variant of the maximum diversity problem, aims to determine a set of elements within a network. These elements could symbolize, for instance, facilities in a supply chain or transmission nodes in a telecommunication network. While each element typically has a bounded service capacity, in this research, we introduce a twist. The capacity of each node might be influenced by a random Bernoulli component, thereby rendering the possibility of a node having zero capacity, which is contingent upon a black box mechanism that accounts for environmental variables. Recognizing the inherent complexity and the NP-hard nature of the capacitated dispersion problem, heuristic algorithms have become indispensable for handling larger instances. In this paper, we introduce a novel approach by hybridizing a heuristic algorithm with reinforcement learning to address this intricate problem variant.

Förderung

  • Spanish Ministry of Science and Innovation
  • SUN project of the Horizon Europe program
  • i4OPT project of the Generalitat Valenciana

Zitieren

APA

Gomez, J. F., Uguina, A. R., Panadero, J., & Juan, A. A. (2023). A Learnheuristic Algorithm for the Capacitated Dispersion Problem under Dynamic Conditions. Algorithms, 16(12), 532. https://doi.org/10.3390/a16120532

Vancouver

Gomez JF, Uguina AR, Panadero J, Juan AA. A Learnheuristic Algorithm for the Capacitated Dispersion Problem under Dynamic Conditions. Algorithms. 2023;16(12):532. doi:10.3390/a16120532

BibTeX
@article{Gomez2023,
  author = {Gomez, Juan F. and Uguina, Antonio R. and Panadero, Javier and Juan, Angel A.},
  title = {A Learnheuristic Algorithm for the Capacitated Dispersion Problem under Dynamic Conditions},
  journal = {Algorithms},
  year = {2023},
  volume = {16},
  number = {12},
  pages = {532},
  doi = {10.3390/a16120532}
}
Kostenlos starten →