A framework for solving routing problems for small and medium size companies

DOI10.1007/s40819-018-0528-4zbMath1404.90031OpenAlexW2803952455WikidataQ129788038 ScholiaQ129788038MaRDI QIDQ1794663

Leopoldo Eduardo Cárdenas-Barrón, Gerardo Treviño-Garza, César Vladimir Meneses-Preciado, Octavio Sánchez-Arocha

Publication date: 15 October 2018

Published in: International Journal of Applied and Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40819-018-0528-4

zbMATH Keywords

time windowsvehicle routing problemsavings method

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items (1)

Rolling horizon-based heuristics for solving a production-routing problem with price-dependent demand

Cites Work

• Lifted and local reachability cuts for the vehicle routing problem with time windows
• A vehicle routing problem with flexible time windows
• A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows
• The Truck Dispatching Problem

This page was built for publication: A framework for solving routing problems for small and medium size companies