Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading

Authors:
Jean-François Cordeau;Mauro Dell'Amico;Manuel Iori
Affiliations:
Canada Research Chair in Logistics and Transportation and CIRRELT, HEC Montréal, 3000 chemin de la Côte-Sainte-Catherine, Montréal, Canada, H3T 2A7;DISMI, University of Modena and Reggio Emilia, via Amendola 2, Padiglione Morselli, 42122 Reggio Emilia, Italy;DISMI, University of Modena and Reggio Emilia, via Amendola 2, Padiglione Morselli, 42122 Reggio Emilia, Italy
Venue:
Computers and Operations Research
Year:
2010

Citing 11
Cited 4

The precedence-constrained asymmetric traveling salesman polytope

Mathematical Programming: Series A and B
A heuristic for the pickup and delivery traveling salesman problem

Computers and Operations Research
Algorithm 97: Shortest path

Communications of the ACM
Branch-and-cut algorithms for the capacitated VRP

The vehicle routing problem
Perturbation heuristics for the pickup and delivery traveling salesman problem

Computers and Operations Research
Solving a Practical Pickup and Delivery Problem

Transportation Science
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem

Operations Research
The pickup and delivery traveling salesman problem with first-in-first-out loading

Computers and Operations Research
Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading

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

Mathematical Programming: Series A and B
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading

Networks - Networks Optimization Workshop, August 22–25, 2006

Efficient algorithms for the double traveling salesman problem with multiple stacks

Computers and Operations Research
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks

Networks
A branch-and-bound algorithm for the double travelling salesman problem with two stacks

Networks
A hybrid approach for the vehicle routing problem with three-dimensional loading constraints

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper introduces a branch-and-cut algorithm for a variant of the pickup and delivery traveling salesman problem in which pickups and deliveries must obey the first-in-first-out policy. We propose a new mathematical formulation of the problem and several families of valid inequalities which are used within the branch-and-cut algorithm. Computational experiments on instances from the literature show that this algorithm outperforms existing exact algorithms, and that some instances with up to 25 requests (50 nodes) can be solved in reasonable computing time.