EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC 4.0

The hazardous orienteering problem

Alberto Santini, Claudia Archetti

Networks · 2023-03 · 81 (2) · 235-252

DOI: 10.1002/net.22129 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Networks, online erschienen am 08.11.2022. Verfasst von Alberto Santini und 1 weiteren Autor:innen. Die Arbeit wurde bisher 13-mal zitiert (Crossref) und nennt 40 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0). Gefördert von: Horizon 2020 Framework Programme.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This article studies the Hazardous Orienteering Problem (HOP), a variant of the more famous Orienteering Problem (OP). In the OP, a vehicle earns a profit for each customer it visits (e.g., to pick up a parcel) subject to an upper bound on the tour time. In the HOP, the parcels picked up at some customers have a probability of triggering a catastrophic event. The probability depends on how long the parcels travel on the vehicle. If any catastrophic event triggers, the entire collected profit is lost. The goal is to determine the tour that maximizes the expected profit. The problem has interesting applications in routing of hazardous material, cash‐in‐transit, and law enforcement. We propose a mixed‐integer nonlinear formulation and techniques both to obtain dual bounds and to produce primal solutions. Computational tests investigate the efficacy of the methods proposed and allow to gain insights into solution features.

Förderung

  • Horizon 2020 Framework Programme

Zitieren

APA

Santini, A., & Archetti, C. (2023). The hazardous orienteering problem. Networks, 81(2), 235-252. https://doi.org/10.1002/net.22129

Vancouver

Santini A, Archetti C. The hazardous orienteering problem. Networks. 2023;81(2):235-252. doi:10.1002/net.22129

BibTeX
@article{Santini2023,
  author = {Santini, Alberto and Archetti, Claudia},
  title = {The hazardous orienteering problem},
  journal = {Networks},
  year = {2023},
  volume = {81},
  number = {2},
  pages = {235--252},
  doi = {10.1002/net.22129}
}
Kostenlos starten →