J. M. Belenguer, M. C. Martinez and E. A. Mota, “Lower Bound for the Split Delivery VRP,” Operations Research, Vol. 48, No. 5, 2000, pp. 801-810. doi:10.1287/opre.48.5.801.12407
has been cited by the following article:
TITLE: A Genetic Algorithm for the Split Delivery Vehicle Routing Problem
AUTHORS: Joseph Hubert Wilck IV, Tom M. Cavalier
KEYWORDS: Vehicle Routing Problem; Transportation; Genetic Algorithm
JOURNAL NAME: American Journal of Operations Research, Vol.2 No.2, June 20, 2012
ABSTRACT: The Split Delivery Vehicle Routing Problem (SDVRP) allows customers to be assigned to multiple routes. Two hybrid genetic algorithms are developed for the SDVRP and computational results are given for thirty-two data sets from previous literature. With respect to the total travel distance and computer time, the genetic algorithm compares favorably versus a column generation method and a two-phase method.