Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem

DOI10.1016/j.cor.2015.11.012zbMath1349.90136arXiv1508.02759MaRDI QIDQ342313

Thibaut Vidal

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.02759

zbMATH Keywords

vehicle routing problem; large neighborhood search; cluster-first route-second heuristic; split algorithm

Mathematics Subject Classification ID

05C90: Applications of graph theory

90C60: Abstract computational complexity for mathematical programming problems

90B06: Transportation, logistics and supply chain management

90B10: Deterministic network models in operations research

05C85: Graph algorithms (graph-theoretic aspects)

Uses Software

• LKH
• VRP