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

Authors:
Francesco Carrabs;Jean-François Cordeau;Gilbert Laporte
Affiliations:
Dipartimento di Matematica ed Informatica, Università di Salerno, 84084 Fisciano (SA), Italy;Center for Research on Transportation, HEC Montréal, Montréal, Québec H3T 2A7, Canada;Center for Research on Transportation, HEC Montréal, Montréal, Québec H3T 2A7, Canada
Venue:
INFORMS Journal on Computing
Year:
2007

Citing 0
Cited 15

The double traveling salesman problem with multiple stacks: A variable neighborhood search approach

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

Computers and Operations Research
Variable neighborhood search for the dial-a-ride problem

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

Transportation Science
Multiple pickup and delivery TSP with LIFO and distance constraints: a VNS approach

IEA/AIE'11 Proceedings of the 24th international conference on Industrial engineering and other applications of applied intelligent systems conference on Modern approaches in applied intelligence - Volume Part II
Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs

Computers and Operations Research
Efficient algorithms for the double traveling salesman problem with multiple stacks

Computers and Operations Research
Heuristic and exact algorithms for the multi-pile vehicle routing problem

OR Spectrum
Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks

Networks
The time-dependent prize-collecting arc routing problem

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
A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks

INFORMS Journal on Computing
Survey of Green Vehicle Routing Problem: Past and future trends

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

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 last-in-first-out (LIFO) order. We introduce three new local search operators for this problem, which are then embedded within a variable neighborhood search heuristic. We evaluate the performance of the heuristic on data adapted from TSPLIB instances.