Optimal combination of operators in Genetic Algorithmsfor VRP problems

The well-known Vehicle Routing Problem (VRP) consist of assigning routeswith a set ofcustomersto different vehicles, in order tominimize the cost of transport, usually starting from a central warehouse and using a fleet of fixed vehicles. There are numerousapproaches for the resolution of this kind of problems, being the metaheuristic techniques the most used, including the Genetic Algorithms (AG). The number of approachesto the different parameters of an AG (selection, crossing, mutation...) in the literature is such that it is not easy to take a resolution of a VRP problem directly. This paper aims to simplify this task by analyzing the best known approaches with standard VRP data sets, and showing the parameter configurations that offer the best results.