Adaptive large neighborhood search for the commodity constrained split delivery VRP

Abstract

This paper addresses the commodity constrained split delivery vehicle routing problem (C-SDVRP) where customers require multiple commodities. This problem arises when customers accept to be delivered separately. All commodities can be mixed in a vehicle as long as the vehicle capacity is satisfied. Multiple visits to a customer are allowed, but a given commodity must be delivered in one delivery.In this paper, we propose a heuristic based on the adaptive large neighborhood search (ALNS) to solve the C-SDVRP, with the objective of efficiently tackling medium and large sized instances. We take into account the distinctive features of the C-SDVRP and adapt several local search moves to improve a solution. Moreover, a mathematical programming based operator (MPO) that reassigns commodities to routes is used to improve a new global best solution.Computational experiments have been performed on benchmark instances from the literature. The results assess the efficiency of the algorithm, which can provide a large number of new best-known solutions in short computational times.

Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search

“…The following 25 articles were excluded because the weight adjustment mechanism was not described in detail: [9,10,17,20,29,36,40,41,44,45,47,57,61,65,77,86,90,106,112,116,117,119,122,130,132]. An additional 5 articles [1,22,92,98,133] were excluded because the adaptive layer cannot be removed by setting a parameter to a certain value, and [58] was excluded as a roulette wheel principle is not employed (rather, a heuristic with the highest weight is chosen).…”

An Adaptive Large Neighborhood Search for the Larger-Scale Instances of Green Vehicle Routing Problem with Time Windows

“…Bach et al [35] developed an ALNS for distance-constrained capacitated vehicle routing problem (DCVRP). Gu et al [36] developed an ALNS for the VRP with commodity-constrained split delivery. Hof and Schneider [37] developed an ALNS for simultaneous pickup and delivery VRP with up to 1000 customers.…”

Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge

“…Heuristic examples include [16] who proposed an iterated local search algorithm for solving the multicommodity multitrip VRP with the objective of minimizing the number of used vehicles. In [32] the authors addressed the commodity constrained split delivery VRP, where multiple commodities can be mixed in a single vehicle while satisfying the capacity constraint, and similar to our problem, each customer can be visited more than once, and each visit should deliver only one commodity type. They proposed a heuristic based on adaptive large neighborhood search (ALNS) and tested their approach on benchmark instances.…”