Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 53, Issue -, Pages 234-249Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2014.08.005
Keywords
Metaheuristics; Vehicle routing; Split deliveries; Iterated local search
Categories
Funding
- Brazilian research agency CNPq [471158/2012-7]
- Brazilian research agency CAPES [922/2008]
- Brazilian research agency FAPERJ [E-26/103.057/2011]
Ask authors/readers for more resources
This paper concerns the Split Delivery Vehicle Routing Problem (SDVRP). This problem is a relaxation of the Capacitated Vehicle Routing Problem (CVRP) since the customers' demands are allowed to be split. We deal with the cases where the fleet is unlimited (SDVRP-UF) and limited (SDVRP-LF). In order to solve them, we implemented a multi-start Iterated Local Search (ILS) based heuristic that includes a novel perturbation mechanism. Extensive computational experiments were carried out on benchmark instances available in the literature. The results obtained are highly competitive, more precisely, 55 best known solutions were equaled and new improved solutions were found for 243 out of 324 instances, with an average and maximum improvement of 1.15% and 2.81%, respectively. (C) 2014 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available