A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem

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

Full description

Saved in:
Bibliographic Details
Published inTransportation science Vol. 40; no. 1; pp. 64 - 73
Main Authors Archetti, C, Speranza, M. G, Hertz, A
Format Journal Article
LanguageEnglish
Published Linthicum, MD INFORMS 01.02.2006
Transportation Science & Logistic Society of the Institute for Operations Research and Management Sciences
Institute for Operations Research and the Management Sciences
Subjects
Algorithms
Applied sciences
Cost-effectiveness
Customers
Delivery vehicles
Exact sciences and technology
Ground, air and sea transportation, marine construction
Heuristic
Heuristics
Integer programming
Integers
Mathematical methods
Mathematical models
metaheuristics
Motor vehicle fleets
Optimal solutions
Planning methods
Routing
Scheduling algorithms
split delivery vehicle routing problem
Studies
Taboos
Tabu search
Transport
Transportation
Transportation industry
Transportation planning, management and economics
Travel
Traveling salesman problem
Triangle inequalities
triangle inequality
Vehicle capacity
Vehicle routing
Vehicles
Vertices
United States
Delivery (good)
Tabu search
Formulation
Vehicle routing problem
Transportation
triangle inequality
split delivery vehicle routing problem
metaheuristics
Mathematical model
Algorithm
Result
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0041-1655
1526-5447
DOI:10.1287/trsc.1040.0103