Abstract
The object of the present research is design of paths of distribution of a product within the delivery network, selecting the sequence of visits and applying to restrictions of capacity of load volume and maximum distance by path, diminishing the distribution costs.
Within the existing models to solve this problem are the algorithms of Clarke and Wrigth, the method of the saving and the models of transport based on the theories of linear integer programming, which evolve of optimal and efficient way in a reduced amount of consumption centers. The efficiency of these algorithms decreases as is increased the number of consumption centers, because the space of solutions increases exponentially, turning the path problem on a problem of NP-Complete type. In the article a solution using a heuristic method is proposed, by means of the application of genetic algorithms in a problem made up of a center of distribution and eight different centers from consumption, where the established measures of performance are cost, distance and volume (load). Applying the model, the results show the achievement of a good solution in a polynomial time search, which were evaluated with different measures from performance mainly for the associate cost to product distribution in the distribution network