Stefan Røpke, Technical University of Denmark

Abstract

This paper describes the ALNS++ heuristic that participated in DIMACS Vehicle Routing implementation challenge. The heuristic has been applied to the Capacitated Vehicle Routing Problem (CVRP), the Vehicle Routing Problem with Time Windows (VRPTW), the Capacitated Arc Routing Problem (CARP) and the Node, Edge, Arc Routing Problem (NEARP). The heuristic produce promising results in the computational experiments.

[Challenge Paper]   [Video]