6533b86dfe1ef96bd12c9423

RESEARCH PRODUCT

A powerful route minimization heuristic for the vehicle routing problem with time windows

Yuichi NagataOlli Bräysy

subject

Mathematical optimizationComputer scienceTime windowsApplied MathematicsVehicle routing problemGuided Local SearchMinificationManagement Science and Operations ResearchHeuristicsAlgorithmIndustrial and Manufacturing EngineeringSoftware

description

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.

yearjournalcountryeditionlanguage
2009-09-01Operations Research Letters
https://doi.org/10.1016/j.orl.2009.04.006