Integer Models for the Asymmetric Traveling Salesman Problem with Pickup and Delivery

We propose a new Mixed Integer Programming formulation for the Asymmetric Traveling Salesman Problem with Pickup and Delivery, along with valid inequalities for the Sarin-Sherali-Bhootra formulation. We study these models in their complete forms, relax complicating constraints of these models, and compare their performance. Finally, we present computational results showing the promise of these formulations when applied to pickup and delivery problems.

Article

Download

View Integer Models for the Asymmetric Traveling Salesman Problem with Pickup and Delivery