Complementos y aplicaciones de la Programación Lineal Entera : Problema de Ruteo de Vehículos con capacidad de carga limitada para la recolección dividida de múltiples productos.

Abstract

In this document, a Vehicle Routing Problem with limited capacity for divided collections of multiple products is studied. First, a general study of the Vehicle Routing Problem (VRP) is made, and later we focus on Split Pickup Problems. In this type of problem, it is assumed that clients can be visited more than once, which is the opposite of what is generally assumed in VRPs, where a client is visited only once. For the approach of the problem, a point of origin is considered where the available vehicles will be found and a destination point where the selected vehicles will arrive. It is required to find the optimal routes that the vehicles must follow in order to minimize the costs of operation and transportation, and satisfy the demand for each product. For this, an Integer Programming model is presented that is implemented in the Python Programming language and the Gurobi solver, in which solutions are obtained with a high computational cost for some instances, for which a heuristic method is also proposed that finds solutions almost best in short time. Finally, the solutions and execution times of the integer programming model and the heuristics are compared, and a programming technique is used that consists of initializing the solver with the feasible solutions given by the heuristics.