A large neighbourhood based heuristic for two-echelon routing problems
DOI10.1016/j.cor.2016.06.014zbMath1349.90073arXiv1505.08003WikidataQ59389533 ScholiaQ59389533MaRDI QIDQ342576
Richard F. Hartl, Verena Schmid, Thibaut Vidal, U. Breunig
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.08003
heuristic; multi-depot vehicle routing problem; large neighbourhood search; split delivery vehicle routing problem; city logistics; variable neighbourhood search; capacitated vehicle routing problem; adaptive large neighbourhood search; two-echelon vehicle routing problem; covariance matrix adaptation evolution strategy; two-echelon location routing problem with single depot; wo-echelon location routing problem
90B06: Transportation, logistics and supply chain management
90C59: Approximation methods and heuristics in mathematical programming
90B10: Deterministic network models in operations research
Uses Software