Abstract
In this article an Iterated Local Search algorithm for the capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints is presented. Axle weight limits impose a great challenge for transportation companies. Yet, the literature on the incorporation of axle weight constraints in vehicle routing models is very scarce. The effect of introducing axle weight constraints in a CVRP on total routing cost is analyzed. Results show that integrating axle weight constraints does not lead to a large cost increase. However, not including axle weight constraints in the planning process may induce major axle weight violations. © 2017 Wiley Periodicals, Inc. NETWORKS, Vol. 69(3), 304–316 2017.
Author supplied keywords
Cite
CITATION STYLE
Pollaris, H., Braekers, K., Caris, A., Janssens, G. K., & Limbourg, S. (2017). Iterated local search for the capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints. Networks, 69(3), 304–316. https://doi.org/10.1002/net.21738
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.