The Orienteering Problem is a routing problem aiming at selecting a subset of a given set of customers to be visited within a given time budget, so that a total revenue is maximized. Multiple variants of the problem have been studied. The Probabilistic Orienteering Problem is one of these variants, where customers will require a visit according to a certain given probability. Stochasticity makes the model more practical, but concurrently more difficult to solve. Tabu Search is a method widely used in combinatorial optimization problems to escape from local optima in heuristic local search procedures. In this work, we solve the Probabilistic Orienteering Problem by embedding a Monte Carlo evaluator into a Tabu Search algorithm, exploiting their interaction in an innovative way. A detailed computational study of the new approach is presented, with the aim of studying the performance of the metaheuristic algorithm in terms of precision and speed, while positioning the new method within the existing literature.

Chou, X., Gambardella, L., Montemanni, R. (2021). A Tabu Search algorithm for the Probabilistic Orienteering Problem. COMPUTERS & OPERATIONS RESEARCH, 126 [10.1016/j.cor.2020.105107].

A Tabu Search algorithm for the Probabilistic Orienteering Problem

Chou, X;
2021

Abstract

The Orienteering Problem is a routing problem aiming at selecting a subset of a given set of customers to be visited within a given time budget, so that a total revenue is maximized. Multiple variants of the problem have been studied. The Probabilistic Orienteering Problem is one of these variants, where customers will require a visit according to a certain given probability. Stochasticity makes the model more practical, but concurrently more difficult to solve. Tabu Search is a method widely used in combinatorial optimization problems to escape from local optima in heuristic local search procedures. In this work, we solve the Probabilistic Orienteering Problem by embedding a Monte Carlo evaluator into a Tabu Search algorithm, exploiting their interaction in an innovative way. A detailed computational study of the new approach is presented, with the aim of studying the performance of the metaheuristic algorithm in terms of precision and speed, while positioning the new method within the existing literature.
Articolo in rivista - Articolo scientifico
Metaheuristic algorithms; Monte Carlo Sampling; Probabilistic Orienteering Problem; Tabu Search;
English
2021
126
105107
none
Chou, X., Gambardella, L., Montemanni, R. (2021). A Tabu Search algorithm for the Probabilistic Orienteering Problem. COMPUTERS & OPERATIONS RESEARCH, 126 [10.1016/j.cor.2020.105107].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/467063
Citazioni
  • Scopus 33
  • ???jsp.display-item.citation.isi??? 23
Social impact