C. Archetti and M. G. Speranza, “The Split Delivery Vehicle Routing Problem: A Survey,” The Vehicle Routing Problem: Latest Advances and New Challenges,” Operations Research/Computer Science Interfaces Series, Vol. 43, Part I, 2008, pp. 103-122. doi:10.1016/0166-218X(92)00172-I

has been cited by the following article:

• TITLE: A Construction Heuristic for the Split Delivery Vehicle Routing Problem

  AUTHORS: Joseph Hubert Wilck IV, Tom M. Cavalier

  KEYWORDS: Vehicle Routing Problem; Transportation; Construction Heuristics

  JOURNAL NAME: American Journal of Operations Research, Vol.2 No.2, June 20, 2012

  ABSTRACT: The Split Delivery Vehicle Routing Problem (SDVRP) is a relaxation of the Capacitated Vehicle Routing Problem (CVRP) where customers may be assigned to multiple routes. A new construction heuristic is developed for the SDVRP and computational results are given for thirty-two data sets from previous literature. With respect to the total travel distance, the construction heuristic compares favorably versus a column generation method and a two-phase method. In addition, the construction heuristic is computationally faster than both previous methods. This construction heuristic could be useful in developing initial solutions, very quickly, for a heuristic, algorithm, or exact procedure.