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

DOI10.1002/net.20063zbMath1068.90085OpenAlexW4245527820MaRDI QIDQ5463668

Gilbert Laporte, Gianpaolo Ghiani, Patrizia Beraldi, Roberto Musmanno

Publication date: 5 August 2005

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20063

zbMATH Keywords

pick up and deliveryprobabilistic Traveling Salesman Problem neighborhood search

Mathematics Subject Classification ID

Stochastic programming (90C15)

Related Items

The probabilistic travelling salesman problem with crowdsourcing ⋮ Local search heuristics for the probabilistic dial-a-ride problem ⋮ Challenges and Advances in A Priori Routing ⋮ EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM ⋮ Aggregation for the probabilistic traveling salesman problem ⋮ On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands ⋮ The risk-averse traveling repairman problem with profits

Cites Work

• Introduction to Stochastic Programming