Dynamic Adaptive Large Neighborhood Search for Inventory Routing Problem

DOI10.1007/978-3-319-18161-5_20zbMath1370.90030MaRDI QIDQ5356988

V. V. Zakharov, Viacheslav A. Shirokikh

Publication date: 12 September 2017

Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18161-5_20

zbMATH Keywords

heuristic algorithms; time consistency; adaptive large neighborhood search (ALNS); inventory routing problem (IRP); dynamic adaptive large neighborhood search (DALNS)

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

90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)

90B05: Inventory, storage, reservoirs