Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem

Authors:
Patrizia Beraldi;Gianpaolo Ghiani;Gilbert Laporte;Roberto Musmanno
Affiliations:
Centro di Eccellenza sul Calcolo ad Alte Prestazioni, Università degli Studi della Calabria, 87030 Rende (CS), Italy;Dipartimento di Ingegneria dell'Innovazione, Università degli Studi di Lecce, 73100 Lecce, Italy;Canada Research Chair in Distribution Management, HEC Montréal, 3000 chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7;Centro di Eccellenza sul Calcolo ad Alte Prestazioni, Università degli Studi della Calabria, 87030 Rende (CS), Italy
Venue:
Networks
Year:
2005

Citing 0
Cited 2

Aggregation for the probabilistic traveling salesman problem

Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Local search heuristics for the probabilistic dial-a-ride problem

OR Spectrum

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article the probabilistic Pickup and Delivery Travelling Salesman Problem is studied and an efficient neighborhood search procedure is developed. This procedure requires O(n3) computations for the evaluation of the neighborhood of a given solution while the straightforward approach has an O(n5)complexity. © 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 45(4), 195–198 2005