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

Authors:
Güneş Erdoğan;Jean-François Cordeau;Gilbert Laporte
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 and Canada Research Chair in Distr ...;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;Canada Research Chair in Distribution Management and CIRRELT, HEC Montréal, 3000 chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7
Venue:
Computers and Operations Research
Year:
2009

Citing 6
Cited 7

New insertion and postoptimization procedures for the traveling salesman problem

Operations Research
Heuristics for the traveling salesman problem with pickup and delivery

Computers and Operations Research
A heuristic for the pickup and delivery traveling salesman problem

Computers and Operations Research
Perturbation heuristics for the pickup and delivery traveling salesman problem

Computers and Operations Research
Optimal routing of multiple-load AGV subject to LIFO loading constraints

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

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

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

Computers and Operations Research
The Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs

Transportation Science
Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs

Computers and Operations Research
The Traveling Salesman Problem with Draft Limits

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 addresses a variation of the traveling salesman problem with pickup and delivery in which loading and unloading operations have to be executed in a first-in-first-out fashion. It provides an integer programming formulation of the problem. It also describes five operators for improving a feasible solution, and two heuristics that utilize these operators: a probabilistic tabu search algorithm, and an iterated local search algorithm. The heuristics are evaluated on data adapted from TSPLIB instances.