Name
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1287/trsc.1040.0103 | Transportation Science |
Keywords | Field | DocType |
cheapest insertion method,vehicle routing problem,split delivery,new route,benchmark problem,neighbor solution,computational experiment,tabu search algorithm,residual capacity,existing route,algorithms,tabu search,computer experiment,metaheuristics,triangle inequality | Mathematical optimization,Vehicle routing problem,Algorithm,Triangle inequality,Fleet management,Tabu search,Operations management,Mathematics,Metaheuristic | Journal |
Volume | Issue | ISSN |
40 | 1 | 0041-1655 |
Citations | PageRank | References |
85 | 3.31 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| C. Archetti | 1 | 199 | 9.69 |
| M. G. Speranza | 2 | 294 | 19.55 |
| A. Hertz | 3 | 85 | 3.31 |