| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 7534818 | Transportation Research Procedia | 2017 | 8 Pages |
Abstract
We formally define the SOP and propose an adaptive neighbourhood search heuristic for determining feasible slots for inserting a new customer orders based on a given delivery schedule in real time. Our approach is tailored to the SOP and combines local search techniques with strategies to overcome local minima. In an experimental evaluation, we demonstrate the efficiency of our approach on a variety of benchmark sets.
Related Topics
Social Sciences and Humanities
Social Sciences
Safety Research
Authors
Philipp Hungerländer, Andrea Rendl, Christian Truden,