EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

A Biased-Randomized Algorithm for the Bi-Objective Capacitated Dispersion Problem with Symmetries

Juan F. Gomez, Wenwen Chen, Laura Calvet, Majsa Ammouriova, Angel A. Juan

Symmetry · 07.01.2026 · 18 (1) · 110

DOI: 10.3390/sym18010110 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Symmetry, online erschienen am 07.01.2026. Verfasst von Juan F. Gomez und 4 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 35 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Given a network of nodes and a certain demand that needs to be satisfied, the capacitated dispersion problem (CDP) involves selecting a subset of nodes to maximize dispersion between them. In many practical instances, symmetry in the structure of the selected nodes (e.g., using nodes of the same type) can lead to synergies. Hence, this paper studies a bi-objective variant of the CDP to account for these symmetries. The first goal seeks to maximize the minimum distance between opened nodes, while the second goal accounts for symmetry by penalizing the use of nodes of different types (in our case, represented by different colors). We formalize the problem as a bi-objective mathematical program and address it through a classical multiobjective strategy, the ϵ-constraint method. Exact methods are used when the problem size allows, even though the problem is NP-hard. To tackle larger instances, we design a biased-randomized algorithm based on a constructive heuristic. Computational experiments show that our biased-randomized algorithm provides high-quality approximations of the Pareto frontier.

Zitieren

APA

Gomez, J. F., Chen, W., Calvet, L., Ammouriova, M., & Juan, A. A. (2026). A Biased-Randomized Algorithm for the Bi-Objective Capacitated Dispersion Problem with Symmetries. Symmetry, 18(1), 110. https://doi.org/10.3390/sym18010110

Vancouver

Gomez JF, Chen W, Calvet L, Ammouriova M, Juan AA. A Biased-Randomized Algorithm for the Bi-Objective Capacitated Dispersion Problem with Symmetries. Symmetry. 2026;18(1):110. doi:10.3390/sym18010110

BibTeX
@article{Gomez2026,
  author = {Gomez, Juan F. and Chen, Wenwen and Calvet, Laura and Ammouriova, Majsa and Juan, Angel A.},
  title = {A Biased-Randomized Algorithm for the Bi-Objective Capacitated Dispersion Problem with Symmetries},
  journal = {Symmetry},
  year = {2026},
  volume = {18},
  number = {1},
  pages = {110},
  doi = {10.3390/sym18010110}
}
Kostenlos starten →