A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem

Abstract

W e describe a tabu search algorithm for the vehicle routing problem with split deliveries. At each iteration, a neighbor solution is obtained by removing a customer from a set of routes where it is currently visited and inserting it either into a new route or into an existing route that has enough residual capacity. The algorithm also considers the possibility of inserting a customer into a route without removing it from another route. The insertion of a customer into a route is done by means of the cheapest insertion method. Computational experiments are reported for a set of benchmark problems, and the results are compared with those obtained by the algorithm proposed by Dror and Trudeau.

A Scalable Heuristic for Pickup-and-Delivery of Splittable Loads and Its Application to Military Cargo-Plane Routing

“…Using corresponding valid inequalities, they developed a cuttingplane algorithm to generate the lower bound of the optimal value. Archetti et al (2006) developed a tabu search method for SDVRP which extends the method of (Dror and Trudeau, 1989) with a k-split interchange. studied the effects of the size and location of the transportation demand on the benefit of load splits using the tabu search methods from (Archetti et al, 2006) and (Toth and Vigo, 2003), respectively, for SDVRP and VRP.…”

“…Archetti et al (2006) developed a tabu search method for SDVRP which extends the method of (Dror and Trudeau, 1989) with a k-split interchange. studied the effects of the size and location of the transportation demand on the benefit of load splits using the tabu search methods from (Archetti et al, 2006) and (Toth and Vigo, 2003), respectively, for SDVRP and VRP. Archetti, Savlesbergh, and Speranza (2008) developed a heuristic combining a tabu search of (Archetti et al, 2006) and IP optimization.…”

“…studied the effects of the size and location of the transportation demand on the benefit of load splits using the tabu search methods from (Archetti et al, 2006) and (Toth and Vigo, 2003), respectively, for SDVRP and VRP. Archetti, Savlesbergh, and Speranza (2008) developed a heuristic combining a tabu search of (Archetti et al, 2006) and IP optimization. Using a set of promising routes derived from a tabu search of (Archetti et al, 2006), they formulated the SDVRP as a route-based IP and solved it with a commercial code.…”

“…Archetti, Savlesbergh, and Speranza (2008) developed a heuristic combining a tabu search of (Archetti et al, 2006) and IP optimization. Using a set of promising routes derived from a tabu search of (Archetti et al, 2006), they formulated the SDVRP as a route-based IP and solved it with a commercial code. Chen et al (2007) considered an improvement step by reassigning the transportation demands serviced by vehicles in an initial unsplit solution, which is formulated as an MIP-formulation.…”

A Scatter Search Algorithm for the Split Delivery Vehicle Routing Problem

“…A Tabu Search procedure was developed by Archetti, Hertz and Speranza [1]. It produces an initial feasible solution using the GENIUS algorithm for the TSP ( [12]).…”