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

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

0.00 Avg rating0 Votes
Article ID: iaor20102988
Volume: 37
Issue: 5
Start Page Number: 333
End Page Number: 338
Publication Date: Sep 2009
Journal: Operations Research Letters
Authors: ,
Keywords: heuristics
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.

Reviews

Required fields are marked *. Your email address will not be published.