Solución al problema de ruteo de vehículos con entregas y recogidas aplicando el algoritmo de pétalos y la heurística del vecino más cercano

Abstract

Solution to the problem of routing of vehicles with deliveries and pickups taking into account the capacity of a heterogeneous fleet, applying the petal algorithm to generate the initial routes and divide into zones and later it is improved with the heuristic of the nearest neighbor each one of the initially created routes