A decomposition-based method for solving the clustered vehicle routing problem

DOI10.1093/jigpal/jzx037zbMath1499.90025OpenAlexW2791485794MaRDI QIDQ5384360

Daniela Dănciulescu, Andrei Horvat-Marc, Petrică C. Pop, Levente Fuksz

Publication date: 24 June 2019

Published in: Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/jigpal/jzx037

zbMATH Keywords

vehicle routing problemclustered vehicle routing problemdecomposion methods

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Transportation, logistics and supply chain management (90B06)

Related Items (2)

Large multiple neighborhood search for the soft-clustered vehicle-routing problem ⋮ The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem

This page was built for publication: A decomposition-based method for solving the clustered vehicle routing problem