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

Authors:
Xiang Gao;Andrew Lim;Hu Qin;Wenbin Zhu
Affiliations:
Department of Management Sciences, City University of Hong Kong, Kowloon Tong, Hong Kong;Department of Management Sciences, City University of Hong Kong, Kowloon Tong, Hong Kong;School of Management, Huazhong University of Science and Technology, Wuhan, China and Department of Management Sciences, City University of Hong Kong, Kowloon Tong, Hong Kong;Department of Computer Science and Engineering, Hong Kong University of Science and Technology, Kowloon, Hong Kong
Venue:
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
Year:
2011

Citing 9
Cited 0

On the distance constrained vehicle routing problem

Operations Research
Variable neighborhood search

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

Computers and Operations Research
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms

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

INFORMS Journal on Computing
The double traveling salesman problem with multiple stacks: A variable neighborhood search approach

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
The Vehicle Routing Problem with Stochastic Demand and Duration Constraints

Transportation Science
Heuristic and exact algorithms for the multi-pile vehicle routing problem

OR Spectrum

Quantified Score

Hi-index	0.00

Visualization

Abstract

The pickup and delivery traveling salesman problem with last-in-first-out loading (TSPPDL) requires that a set of pickup and delivery requests are fulfilled such that the items to be transported are loaded in LIFO order. We generalize the TSPPDL to consider multiple vehicles as well as a maximum distance constraint for each vehicle; a solution to this problem is a set of routes for each vehicle, and each route can be represented by a tree data structure. To solve this problem practically, we propose a variable neighborhood search (VNS) heuristic using several new search operators. Our VNS approach also includes a dynamic programming component for optimally solving TSPPDL instances.