The probabilistic pickup-and-delivery travelling salesman problem

作者：

Highlights：

• 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.

摘要

•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.

论文关键词：Travelling Salesman,Pickup-and-delivery,Probabilistic TSP

论文评审过程：Received 4 October 2018, Revised 27 November 2018, Accepted 17 December 2018, Available online 20 December 2018, Version of Record 24 December 2018.

论文官网地址：https://doi.org/10.1016/j.eswa.2018.12.028