Alternativa Heurística MCM para Problemas de Ruteo de Vehículos.

The Vehicle Routing Problem (VRP) involves a major mathematical complexity to solve it. This impedes its use in small and medium size organizations, because an investment in specialized software and trained personnel is required. The methods used to find an optimal solution to the VRP start with an improving workable solution. This initial solution can be generated randomly, calculated by some other method, or even a solution provided by the user can also be used. In this paper, we present an algorithm to obtain a feasible solution to the problem of VRP called Mass Center Method (MCM). The method is easy to perform and its performance differs little from the final solutions generated by commercial algorithms, therefore, it could be used as an approximation to the solution of the problem. This can help to extend the application of the VRP. [ABSTRACT FROM AUTHOR]