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

Authors:
Güneş Erdogan;Maria Battarra;Gilbert Laporte;Daniele Vigo
Affiliations:
Industrial Engineering Department, Özyegin University, Kuşbakışı Cad. 2, 34662 Altunizade, İstanbul, Turkey;School of Mathematics, University of Southampton, Southampton SO17 1BJ, UK;Canada Research Chair in Distribution Management, HEC Montréal, 3000 chemin de la Côte-Sainte-Catherine, Montreal, Canada H3T 2A7;DEIS, University of Bologna, via Venezia 52, 47521 Cesena, Italy
Venue:
Computers and Operations Research
Year:
2012

Citing 8
Cited 0

Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
Heuristics for the traveling salesman problem with pickup and delivery

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

Computers and Operations Research
An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints

Transportation Science
Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading

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

Networks - Networks Optimization Workshop, August 22–25, 2006
The Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs

Transportation Science
Exact solutions to the double travelling salesman problem with multiple stacks

Networks

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper studies the Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs. The subproblem of minimizing the handling cost for a fixed route is analyzed in detail. It is solved by means of an exact dynamic programming algorithm with quadratic complexity and by an approximate linear time algorithm. Three metaheuristics integrating these solution methods are developed. These are based on tabu search, iterated local search and iterated tabu search. The three heuristics are tested and compared on instances adapted from the related literature. The results show that the combination of tabu search and exact dynamic programming performs the best, but using the approximate linear time algorithm considerably decreases the CPU time at the cost of slightly worse solutions.