The probabilistic pickup-and-delivery travelling salesman problem

•Two new formulations for the Probabilistic Pickup-and-Delivery Travelling Salesman Problem.•The need of approaching the probabilistic case is discussed.•An efficient branch-and-cut algorithm based on the non-compact formulation is proposed.•None of the formulations clearly dominates the other. Tran...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Expert systems with applications 2019-05, Vol.121, p.313-323
Hauptverfasser:	Benavent, Enrique, Landete, Mercedes, Salazar-González, Juan-José, Tirado, Gregorio
Format:	Artikel
Sprache:	eng
Schlagworte:	Commodities Formulations Heuristic methods Logistics Pickup-and-delivery Polynomials Probabilistic TSP Route planning Routing Statistical analysis Traveling salesman problem Travelling Salesman Vehicle routing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!