Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
Published Online:1 Nov 2007https://doi.org/10.1287/ijoc.1060.0202
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.
