Iterated local search for the capacitated vehicle routing problem with sequence‐based pallet loading and axle weight constraints

Abstract

In this article an Iterated Local Search algorithm for the capacitated vehicle routing problem with sequencebased 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.

A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem

“…The local search embeds a heuristic procedure; the perturbation and the acceptance criterion allow to explore the search space as well as to escape from local optima. The ILS metaheuristic has been applied in many optimization problems, such as vehicle routing problems (Juan et al., ; Pollaris et al., ; Brandão, ; Estrada‐Moreno et al., ), scheduling problems (Zohali et al., ; Cunha et al., ), facility location problems (De Armas et al., ), or inventory routing problems (Alvarez et al., ), among others. In particular, Stützle () and Juan et al.…”

A concise guide to existing and emerging vehicle routing problem variants

“…Trucks, ships, and airplanes have many specific load restrictions which must be taken into account during optimization (Pollaris et al 2015). The papers considering these aspects are primarily classified by geometry, e.g., pallet loading (Pollaris et al 2017), 2D packing (Iori et al 2007), and 3D packing constraints (Gendreau et al 2006), but other constraints related to fragility, orientation, or equilibrium often come into play. Specialized applications such as car hauling require dedicated feasibility-checking mechanisms to ensure that a load can be feasibly placed on the truck (Dell'Amico et al 2015) and that axle-weight limits are respected (Pollaris et al 2017).…”

The Vehicle Routing Problem With Stochastic Demands in an Urban Area – A Case Study

“…It can generally be said that meta-heuristics is a higher level of heuristics. Out of the group of meta-heuristic methods used for the solution of municipal waste collection vehicle routing problems, this paper employs the 2-OPT local search [26] and Simulated Annealing -SA [27].…”