A novel approach to solve the split delivery vehicle routing problem

Abstract

The split delivery vehicle routing problem (SDVRP) is a relaxed version of the classic capacitated vehicle routing problem (CVRP). Customer demands are allowed to split among vehicles. This problem is computationally challenging and the state‐of‐the‐art heuristics are often complicated to describe and difficult to implement, and usually have long computing times. All these hinder their application by practitioners to solve real‐world problems. We propose a novel, efficient, and easily implemented approach to solve the SDVRP using an a priori split strategy, that is, each customer demand is split into small pieces in advance. Our computational experiments on 82 benchmark instances show that our algorithm is overall much more efficient and produces results that are comparable to those from the state‐of‐the‐art approaches.

Multiobjective mathematical models and solution approaches for heterogeneous fixed fleet vehicle routing problems

“…Since the demand of depot is assumed to be zero, when some vehicle will travel from some customer i to depot (where j = 1), then this situation will not violate the constraint. Constraint set (5) states that, there is a limited number of vehicles for each vehicle type t, which can leave the depot. For example, if there are 5 vehicles of vehicle type 1, the model does not allow using 6 vehicles of vehicle type 1.…”

“…For the heterogeneous fleet split delivery vehicle routing problems, Belfiore and Yoshizaki [4] proposed a scatter-search algorithm. Chen et al [5] implemented a novel approach for this problem using a priori split strategy which splits customer demands in advance.…”

A Tabu Search Algorithm for the Discrete Split Delivery Vechicle Routing Problem

“…To calibrate the parameter , sensitivity analysis is performed on all the test instances, and the test results indicate the sensitivity interval of is [8,10]. is a random integer in the interval [5,20]. In the perturbation phase, q is chosen randomly among 5, 6 or 7.…”

“…M. Qiu [4] aggregated randomly some orders of each customer into a new order in advance, and then transferred the DSDVRP into the classic capacitated vehicle routing problem (CVRP). Chen et al [5] also proposed two prior split rules called 25/10/5/1 or 20/10/5/1 for the SDVRP. The approach of considering orders as independent customers can multiply the scale of the DSDVRP and make it difficult to solve.…”

Dynamic Route Network Planning Problem for Emergency Evacuation in Restricted-Space Scenarios

“…As a crucial kind of combinational optimization problem, the path planning problem has been widely studied such like recent research works on traveling salesman problem (TSP) [6], traffic assignment/vehicle routing problem [7][8][9], and evolutionary optimization problems, e.g., general transportation planning problems, facility location problem, and roadway repair problem [10]. Based on the existing theoretical achievements, the research on evacuation path planning can be classified as static planning and dynamic planning.…”