6533b833fe1ef96bd129c9d1

RESEARCH PRODUCT

A Scatter Search Algorithm for the Split Delivery Vehicle Routing Problem

Enrique MotaÁNgel CorberánVicente Campos

subject

Set (abstract data type)Mathematical optimizationSearch algorithmComputer sciencemedia_common.quotation_subjectVehicle routing problemQuality (business)Destination-Sequenced Distance Vector routingSpecial caseRouting (electronic design automation)Metaheuristicmedia_common

description

In this chapter we present a metaheuristic procedure constructed for the special case of the Vehicle Routing Problem in which the demands of 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 quality of the obtained results is comparable to the best results known up to date on a set of instances previously published in the literature.

yearjournalcountryeditionlanguage
2008-09-05
https://doi.org/10.1007/978-3-540-69390-1_7