Spatial-temporal-demand clustering for solving large-scale vehicle routing problems with time windows

Christoph Kerscher, Stefan Minner

Several metaheuristics use decomposition and pruning strategies to solve large-scale instances of the vehicle routing problem (VRP). Those complexity reduction techniques often rel…