Iterated local search for the capacitated vehicle routing problem with sequence‐based pallet loading and axle weight constraints. Issue 3 (13th March 2017)

• Record Type: Journal Article
• Authors: Pollaris, Hanne; Braekers, Kris; Caris, An; Janssens, Gerrit K.; Limbourg, Sabine
• Is Part Of: Networks. Volume 69:Issue 3(2017)
• Page Start: 304
• Page End: 316
• Publication Date: 2017-03-13
• Subjects: Vehicle Routing Problem -- axle weight constraints -- routing & loading -- iterated local search -- sequence‐based loading -- Capacitated Vehicle Routing Problem; Network analysis (Planning) -- Periodicals; 658.4032
• DOI: 10.1002/net.21738
• Languages: English
• ISSNs: 0028-3045

Abstract

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