A new metaheuristic for the vehicle routing problem with split demands

Authors:
Enrique Mota;Vicente Campos;Ángel Corberán
Affiliations:
Dep. Estasdística i Investigació Operativa, Universitat de València. Spain;Dep. Estasdística i Investigació Operativa, Universitat de València. Spain;Dep. Estasdística i Investigació Operativa, Universitat de València. Spain
Venue:
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
Year:
2007

Citing 7
Cited 4

Vehicle routing with split deliveries

Discrete Applied Mathematics
A tabu search heuristic for the vehicle routing problem

Management Science
The split delivery vehicle scheduling problem with time windows and grid network distances

Computers and Operations Research
A Template for Scatter Search and Path Relinking

AE '97 Selected Papers from the Third European Conference on Artificial Evolution
A Lower Bound for the Split Delivery Vehicle Routing Problem

Operations Research
Scatter Search: Methodology and Implementations in C

Scatter Search: Methodology and Implementations in C
Worst-Case Analysis for Split Delivery Vehicle Routing Problems

Transportation Science

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
The multi-depot split delivery vehicle routing problem: An integer programming-based heuristic, new test problems, and computational results

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a metaheuristic procedure constructed for the special case of the Vehicle Routing Problem in which the demands of the clients can be split, i.e., any client can be serviced by more than one vehicle. The proposed algorithm, based on the scatter search methodology, produces a feasible solution using the minimum number of vehicles. The results obtained compare with the best results known up to date on a set of instances previously published in the literature.