An efficient algorithm for the VRPTW with short routes
J.P.M. van Tatenhove · 2016
We introduce a competitive algorithm for the Vehicle Routing Problem with Time Windows (VRPTW). The algorithm will be tweaked to perform optimally in a specific situation, since this algorithm will be used when planning the delivery of groceries in an urban setting. We compare this algorithm to established algorithms on benchmark instances, and then we tweak further and introduce new concepts in order to fully support the specific demands of the company the algorithm is created for. The algorithm outperforms state-of-the-art algorithms when routes are short.