A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading

  • Authors:

  • Jean-François Cordeau;Manuel Iori;Gilbert Laporte;Juan José Salazar González

  • Affiliations:

  • CIRRELT, HEC Montréal, 3000 chemin de la Côte-Sainte-Catherine, Montréal, Canada, H3T 2A7;DISMI, Università di Modena e Reggio Emilia, Via Amendola 2, Reggio Emilia 42100, Italy;CIRRELT, HEC Montréal, 3000 chemin de la Côte-Sainte-Catherine, Montréal, Canada, H3T 2A7;DEIOC, Universidad de La Laguna, 38271 La Laguna, Tenerife, Spain

  • Venue:
  • Networks - Networks Optimization Workshop, August 22–25, 2006
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the Traveling Salesman Problem with Pickup and Delivery (TSPPD) a single vehicle must serve a set of customer requests, each defined by an origin location where a load must be picked up, and a destination location where the load must be delivered. The problem consists of determining a shortest Hamiltonian cycle through all locations while ensuring that the pickup of each request is performed before the corresponding delivery. This article addresses a variant of the TSPPD in which pickups and deliveries must be performed according to a Last-In First-Out (LIFO) policy. We propose three mathematical formulations for this problem and several families of valid inequalities which are used within a branch-and-cut algorithm. Computational results performed on test instances from the literature show that most instances with up to 17 requests can be solved in less than 10 min, whereas the largest instance solved contains 25 requests. © 2009 Wiley Periodicals, Inc. NETWORKS, 2010