Vehicle routing problem with uniform private fleet and common carrier: a node subset heuristic

DOI10.1007/s10100-021-00759-0OpenAlexW3175977420MaRDI QIDQ2673293

Petr Štourač, Ondřej Sokol, Jan Pelikán

Publication date: 9 June 2022

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-021-00759-0

zbMATH Keywords

integer programmingvehicle routing probleminsert heuristicnon-split delivery model

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• A tabu search heuristic for the vehicle routing problem with private fleet and common carrier
• A heuristic algorithm for the truckload and less-than-truckload problem
• A new heuristic and an exact approach for a production planning problem
• Heuristic approaches for solid transportation-\(p\)-facility location problem
• A heuristic for the routing and carrier selection problem
• Lower and upper bounds for the mixed capacitated arc routing problem

This page was built for publication: Vehicle routing problem with uniform private fleet and common carrier: a node subset heuristic