A comparison of methods for the vehicle routing problem


This work introduces an implementation of an evolving technique, more precisely genetic algorithms, to deal with a known problem: the Capacitated Vehicle Routing Problem (CVRP), in which vehicles have limited carrying capacity of the goods that must be delivered. It is presented a comparison with a known heuristic: Greedy Randomized Adaptive Search… (More)
DOI: 10.1109/CLEI.2014.6965167


  • Presentations referencing similar topics