An Exact Algorithm for the Hazardous Orienteering Problem

ABSTRACT The hazardous orienteering problem is the topic of this study. It is a variant of the well‐studied orienteering problem, where a vehicle, given a maximum mission time, has to select and visit customers out of a set of requests, aiming at maximizing the total profit associated with the custo...

Full description

Saved in:
Bibliographic Details
Published in:Networks Vol. 86; no. 2; pp. 105 - 111
Main Authors: Montemanni, Roberto, Smith, Derek H.
Format: Journal Article
Language:English
Published: Hoboken, USA John Wiley & Sons, Inc 01.09.2025
Wiley Subscription Services, Inc
Subjects:
Catastrophic events
Customers
hazardous applications
Integer programming
Linear programming
Mixed integer
mixed integer linear programming
model‐based algorithms
Orienteering
orienteering problems
ISSN:0028-3045, 1097-0037
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:ABSTRACT The hazardous orienteering problem is the topic of this study. It is a variant of the well‐studied orienteering problem, where a vehicle, given a maximum mission time, has to select and visit customers out of a set of requests, aiming at maximizing the total profit associated with the customers selected. In the hazardous version of the problem we consider, the customers are associated with parcels that have to be collected, and some of them might explode during the transportation, after having been picked up. The probability of explosion depends on the characteristics of the parcel and on the time spent by the dangerous parcel itself on the vehicle. If an explosion happens, the collected profit is totally lost. The target becomes then to select the tour that maximizes the expected profit, taking into account the probability of catastrophic events happening. In this article, we propose an exact solving approach based on a mixed integer linear programming model which is dynamically modified by adding new constraints. The computational results substantially improve the state‐of‐the‐art for the problem.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0028-3045
1097-0037
DOI:10.1002/net.22279