A computational study comparing different multiple neighbourhood strategies for solving rich vehicle routing problems

DOI10.1093/imaman/dpt022zbMath1433.90027OpenAlexW2014012353MaRDI QIDQ5382672

Markus Pullmann, Ulrich Derigs

Publication date: 18 June 2019

Published in: IMA Journal of Management Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imaman/dpt022

zbMATH Keywords

computational resultsmeta-heuristicsmultiple neighbourhood searchrich vehicle routing problems

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

This page was built for publication: A computational study comparing different multiple neighbourhood strategies for solving rich vehicle routing problems