Metraipolis › archive › dc_aaaf7c8f9b45

Consistent Path Selection for Bi-objective Median Location Problems on Graphs — arXiv:2608.16538

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.16538
License (as archived)
CC0-1.0
Archived
2026-10-18T20:19:09.147Z
SHA-256 of the archived text
c18e559311bd84f2e00c4149b4ab70bc5d199e49c192aa1bfdab86b63ec80ac6
Stable URL of this page
https://metraipolis.com/documento/dc_aaaf7c8f9b45

How to cite

Consistent Path Selection for Bi-objective Median Location Problems on Graphs — arXiv:2608.16538 — arXiv (en), https://arxiv.org/abs/2608.16538 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_aaaf7c8f9b45 (Metraipolis archive dc_aaaf7c8f9b45, sha256 c18e559311bd84f2e00c4149b4ab70bc5d199e49c192aa1bfdab86b63ec80ac6)
BibTeX
@misc{dcaaaf7c8f9b45,
  title = {Consistent Path Selection for Bi-objective Median Location Problems on Graphs — arXiv:2608.16538},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.16538},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_aaaf7c8f9b45; sha256 c18e559311bd84f2e00c4149b4ab70bc5d199e49c192aa1bfdab86b63ec80ac6},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.16538. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We consider single-facility median location problems on graphs where two conflicting cost values are associated with the edges. As an example, suppose that a decision maker wants to locate one new facility, e. g., a pizza delivery place, which uses bicycles for delivery. The two objective functions could then be the total traveling time and the total number of left turns, as the latter are very risky. Path choices then depend on the preferences of the decision maker, and in general, there may not exist a unique optimal path between a customer and a new facility location. In this paper, we consider the location decision and the routing decision in a coupled problem, i. e., we search for an optimal location and for consistent delivery paths simultaneously. We introduce the concept of consistent paths, where we assume that the choice of a path from the facility to a demand node implies certain preferences. All paths of a solution are consistent if the preferences of all paths do not contradict each other. We present an algorithm that computes a minimum complete set of efficient solutions with consistent path choices and illustrate the results at example instances in the city of Wuppertal in Germany.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-18 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2608.16538 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T19:45:07.853Z dalla pagina https://arxiv.org/catchup/math.OC/2026-08-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).