Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
Francesco Carrabs, Jean-François Cordeau, Gilbert Laporte
INFORMS Journal on Computing · 2007 · Volume 19 · Issue 4
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.
Keywords
traveling salesman problem, pickup and delivery, LIFO loading, variable neighborhood search
Enable JavaScript for citation tools and additional paper interactions.