An iterated local search algorithm for the vehicle routing problem with backhauls

Abstract

The Vehicle Routing Problem with Backhauls (VRPB) is an extension of the VRP that deals with two types of customers: the consumers (linehaul) that request goods from the depot and the suppliers (backhaul) that send goods to the depot. In this paper, we propose a simple yet effective iterated local search algorithm for the VRPB. Its main component is an oscillating local search heuristic that has two main features. First, it explores a wide neighborhood structure at each iteration. This is efficiently done using an additional data structure that stores information about the set of neighboring solutions. Second, the heuristic performs constant transitions between feasible and infeasible regions of the solution space. These transitions are regulated by a dynamic adjustment of the penalty applied to infeasible solutions. An extensive statistical analysis was carried out in order to identify the most important components of the algorithm and to properly tune the values of their parameters. The results of the computational experiments carried out show that this algorithm is very competitive in comparison to the best metaheuristic algorithms for the VRPB. Additionally, new best solutions have been found for two instances in one of the benchmark sets. Through these results, the paper shows that by expanding the exploration area and improving the efficiency of the local search heuristic, it is possible to develop simpler and faster metaheuristic algorithms without compromising the quality of the solutions obtained.

A spatial parallel heuristic approach for solving very large‐scale vehicle routing problems

“…The essential idea of the ILS is to alternately improve the current solution and perturb to escape from local minima (Lourenço et al, ). Because of its effectiveness in combinational optimization, it has been widely applied in many VRP variants (Penna et al, ; Palhazi Cuervo et al, ). However, integration of ILS and spatial parallel computing has not been well investigated.…”

A variable neighborhood search algorithm to generate piano fingerings for polyphonic sheet music

“…Independence of these two parameter groups is assumed, an approach similar to the one used by Palhazi Cuervo et al. () in their experiments, focusing on a subset of parameters. The resulting best parameters of the first experiment are implemented in the second.…”

Heuristics for Vehicle Routing Problem: A Survey and Recent Advances

“…The applications of ILS can be found on the prize-collecting VRP [276], time-dependent VRP [121], VRP with time penalty functions [127], VRP with heterogeneous [212], VRP with backhauls [64], VRP with multiple, incompatible commodities and multiple trips [42], split delivery VRP [261], location-routing [203], and weighted VRP [303]. Several recent improvements are carried out with additional procedures to extend the basic ILS.…”