| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1143396 | Operations Research Letters | 2009 | 6 Pages |
Abstract
We suggest an efficient route minimization heuristic for the vehicle routing problem with time windows. The heuristic is based on the ejection pool, powerful insertion and guided local search strategies. Experimental results on the Gehring and Homberger’s benchmarks demonstrate that our algorithm outperforms previous approaches and found 18 new best-known solutions.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Yuichi Nagata, Olli Bräysy,