News
New publication: Solving heterogeneous vehicle routing problems using decomposition and set covering
News |
Solving Heterogeneous Vehicle Routing Problems Using Decomposition and Set Covering by Christoph Kerscher, Stefan Minner, Fabien Lehuédé, and Guillaume Massonnet has now been published in Computers & Operations Research; the paper presents an iterative matheuristic framework that decomposes large heterogeneous vehicle routing problems into smaller homogeneous subproblems and combines the resulting routes through a set covering approach to obtain high-quality overall solutions.