Vehicle Routing Problem

Vehicle Routing Problem, VRP (Vehicle Routing Problem) proposes alternative solutions for Eco Urban S.A, a Mexican company in charge of collecting post-consumer PET (Polyethylene Terephthalate) material in different collection points scattered in the city of Toluca, State of Mexico; taking into account that the company does not have a VRP study that allows it to efficiently choose the path to follow for the collection of the material. 

10x30 storage unit https://www.hometeamstorage.com/

For this reason, the design of a vehicular route for the collection of PET was proposed that minimizes the transportation costs associated with the operation carried out by the company, for this the current collection system was characterized by identifying relevant aspects such as capacity, travel distances. from the storage warehouse to the collection points. Then, the mathematical model is formulated defining indices, variables, parameters and constraints that limit the objective function to obtain the optimal path. The sweep heuristic method is defined and developed. Finally, the results obtained by the study models and the current collection system are analyzed and compared, exposing the best vehicular route for PET collection that operates at the lowest cost.

 

The Vehicle Routing Problem, VRP (Vehicle Routing Problem) proposes solution alternatives for Eco Urban SA, a Mexican company in charge of collecting post-consumer PET (Polyethylene Terephthalate) material at different dispersed collection points in the city of Toluca, State of Mexico. , taking into account that the company does not have a VRP study that allows it to efficiently choose the path to follow to collect the material. For this reason, the design of a vehicle route for the collection of PET was proposed, which minimizes the transportation costs associated with the operation carried out by the company. To do this, identifying relevant aspects such as capacity, travel distances from the storage warehouse to the collection points characterized by the current collection system. Then, the mathematical model is formulated defining indices, variables, parameters and constraints that limit the objective function to obtain the optimal route. The heuristic sweep method is defined and developed. Finally, the results of the study models and the current collection system are analyzed and compared, exposing the best vehicular route for the collection of PET that operates at minimum cost.