II International Conference on Applied Mathematics and Informatics. - THE ROUTING PROBLEM SOLVED WITH AN ALTERNATIVE MODEL APPLYING A GENETIC ALGORITHM
Congress
Date:
2013Publishing House and Editing Place:
Universidad del ValleSummary *
This paper presents a new solution method for complex distribution problems under capacity constraints. This kind of problems is known in the literature as Capacitated Vehicle Routing Problem (CVRP). Our procedure starts by posing an alternative, albeit equivalent, representation of CVRP, in tended to allow the generation of feasible clusters that can be easily coded. Then, a genetic algorithm running on those codes yields an approximation to the optimal solution of the problem. We ran this procedure on the Van Breedam list of problems in order to assess its performance. The results are analogous to those reported under other alternative methods but the running times were shorter. Information provided by the agent in SIGEVAKey Words
PROBLEMAS DE RUTEOMODELADOALGORITMOS GENÉTICOS