A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem

Authors:
C. Archetti;M. G. Speranza;A. Hertz
Affiliations:
Dipartimento Metodi Quantitativi, Universit degli Studi di Brescia, Contrada Santa Chiara 50, 25122 Brescia, Italia;Dipartimento Metodi Quantitativi, Universit degli Studi di Brescia, Contrada Santa Chiara 50, 25122 Brescia, Italia;Dpartement de Mathmatiques et de Gnie Industriel, cole Polytechnique, CP 6079, succ. Centre-ville, Montral, Canada H3C 3A7
Venue:
Transportation Science
Year:
2006

Citing 6
Cited 20

A vehicle routing improvement algorithm comparison of a “greedy” and a matching implementation for inventory routing

Computers and Operations Research
New insertion and postoptimization procedures for the traveling salesman problem

Operations Research
Vehicle routing with split deliveries

Discrete Applied Mathematics
The split delivery vehicle scheduling problem with time windows and grid network distances

Computers and Operations Research
A Lower Bound for the Split Delivery Vehicle Routing Problem

Operations Research
Complexity and Reducibility of the Skip Delivery Problem

Transportation Science

A hybrid method based on linear programming and tabu search for routing of logging trucks

Computers and Operations Research
Worst Case Analysis for Pickup and Delivery Problems with Transfer

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows

Operations Research
A tabu search heuristic for ship routing and scheduling with flexible cargo quantities

Journal of Heuristics
The multi-shift vehicle routing problem with overtime

Computers and Operations Research
An effective memetic algorithm with population management for the split delivery vehicle routing problem

HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
A tabu search with vocabulary building approach for the vehicle routing problem with split demands

International Journal of Metaheuristics
Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic

Transportation Science
An adaptive memory algorithm for the split delivery vehicle routing problem

Journal of Heuristics
Survey: matheuristics for rich vehicle routing problems

HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
Simulation evaluation for on-demand bus system with electrical vehicles

Intelligent Decision Technologies - Special issue on design of intelligent environment
Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows

Transportation Science
The multi-depot split delivery vehicle routing problem: An integer programming-based heuristic, new test problems, and computational results

Computers and Industrial Engineering
Vehicle routing with compartments: applications, modelling and heuristics

OR Spectrum
A hierarchical solution approach for a multicommodity distribution problem under a special cost structure

Computers and Operations Research
A column generation approach for the split delivery vehicle routing problem

Operations Research Letters
Heuristic methods for the fleet size and mix vehicle routing problem with time windows and split deliveries

Computers and Industrial Engineering
A memetic algorithm for the travelling salesperson problem with hotel selection

Computers and Operations Research
A tree-based tabu search algorithm for the manpower allocation problem with time windows and job-teaming constraints

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Local search techniques for a routing-packing problem

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We 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.