Variants of the Adaptive Large Neighborhood Search for the Inventory Slack Routing Problem
Variants of the Adaptive Large Neighborhood Search for the Inventory Slack Routing Problem
Files
Publication or External Link
Date
2011-09-07
Authors
Yan, Zijie
Montjoy, Adam
Advisor
Herrmann, Jeffrey
Citation
DRUM DOI
Abstract
The inventory slack routing problem is a specialized vehicle routing problem that focuses on delivering waves of inventory to sites in a timely and even manner. It is difficult to find an optimal solution to this problem, thus heuristic and search techniques are necessary. This paper focuses on new variants of the Adaptive Large Neighborhood Search that incorporate new heuristics and linear programming to set delivery quantities. The search variants are tested on a set of instances to compare solution quality and computational effort.