Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads

DOI10.1016/j.ejor.2018.04.017zbMath1403.90117arXiv1802.06318WikidataQ59389526 ScholiaQ59389526MaRDI QIDQ724007

D. Kharzeev

Publication date: 25 July 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

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

zbMATH Keywords

transportation; metaheuristics; vehicle routing; branch-and-price; pickup and delivery; split loads

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B06: Transportation, logistics and supply chain management

90C59: Approximation methods and heuristics in mathematical programming

Uses Software

• VRP