Optimization Online


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

Ryan J. O'Neil (roneil1***at***gmu.edu)
Karla Hoffman (khoffman***at***gmu.edu)

Abstract: 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.

Keywords: asymmetric traveling salesman problem; pickup and delivery; precedence constraints; subtour elimination constraints; integer programming; real-time optimization

Category 1: Applications -- OR and Management Sciences (Transportation )


Download: [PDF]

Entry Submitted: 10/02/2018
Entry Accepted: 10/02/2018
Entry Last Modified: 10/21/2018

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society