J. M. Belenguer, E. Benavent, N. Labadi, C. Prins and M. Reghioui, “Split Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic,” Transportation Science, Vol. 44, No. 2, 2010, pp. 206-220. doi:10.1287/trsc.1090.0305

has been cited by the following article:

• TITLE: A New Approach to the Optimization of the CVRP through Genetic Algorithms

  AUTHORS: Mariano Frutos, Fernando Tohmé

  KEYWORDS: Vehicle Routing Problem; Genetic Algorithms; Modeling; Optimization

  JOURNAL NAME: American Journal of Operations Research, Vol.2 No.4, November 30, 2012

  ABSTRACT: This paper presents a new approach to the analysis of complex distribution problems under capacity constraints. These problems are known in the literature as CVRPs (Capacitated Vehicle Routing Problems). The procedure introduced in this paper optimizes a transformed variant of a CVRP. It starts generating feasible clusters and codifies their ordering. In the next stage the procedure feeds this information into a genetic algorithm for its optimization. This makes the algorithm independent of the constraints and improves its performance. Van Breedam problems have been used to test this technique. While the results obtained are similar to those in other works, the processing times are longer.