Approach to solving the multi-objective vehicles routing problem with capacity restrictions

Abstract

The CVRP is a problem that aims to determine the routes that each of the vehicles in a fleet should follow in order to reach their destination points in a distribution network, so that the total distance travelled or the time spent by the set of vehicles is the least. The CVRP is considered a combinatorial problem, given that as the number of clients to be served increases, the number of possible routing solutions also grows exponentially. This exponential growth immediately exceeds the processing capacity of current computers, so it is advisable to use approximate methods, which do not ensure finding the optimal solution, but if they generate very good solutions (such as heuristics and metaheuristics), and on the contrary the use of exact methods is unsuccessful, since the computational time consumption is very high. In essence, this article presents a proposal to address the problem of vehicle 4220 Cabarcas Reyes Juan Carlos et al. routing, based on heuristic and metaheuristic methods, competitive in terms of response quality and computational time.