The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm

Abstract

The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. The problem consists of determining a minimum cost tour such that each pickup vertex is visited before its corresponding delivery vertex. In this paper, the TSPPD is modeled as an… (More)
DOI: 10.1007/s10107-008-0234-9

15 Figures and Tables

Topics

  • Presentations referencing similar topics