Abstract: The capacitated vehicle routing problem (CVRP) is a difficult combinatorial optimization problem that has been intensively studied in the last few decades. We present a hybrid methodology approach to solve this problem which incorporates an improvement stage by using a 1-0 implicit enumeration technique or Balas’s method. Other distinguishing features of the methodology proposed include a specially designed route-based crossover operator for solution recombination and an effective local procedure as the mutation step. Finally, the methodology is tested with instances of the specialized literature and compared with its best-known solutions for the CVRP with homogeneous fleet, to be able to identify the efficiency of the use of the Balas’s methodology in routing problems.

David Escobar Vargas, Ramón A. Gallego Rendón and Antonio Escobar Zuluaga, “Hybrid Solution Methodology: Heuristic-Metaheuristic-Implicit Enumeration 1-0 for the Capacitated Vehicle Routing Problem (Cvrp)” International Journal of Advanced Computer Science and Applications(IJACSA), 7(3), 2016. http://dx.doi.org/10.14569/IJACSA.2016.070338

@article{Vargas2016,
title = {Hybrid Solution Methodology: Heuristic-Metaheuristic-Implicit Enumeration 1-0 for the Capacitated Vehicle Routing Problem (Cvrp)},
journal = {International Journal of Advanced Computer Science and Applications},
doi = {10.14569/IJACSA.2016.070338},
url = {http://dx.doi.org/10.14569/IJACSA.2016.070338},
year = {2016},
publisher = {The Science and Information Organization},
volume = {7},
number = {3},
author = {David Escobar Vargas and Ramón A. Gallego Rendón and Antonio Escobar Zuluaga}
}