Complementos y aplicaciones de la Programación Lineal y Entera: un problema de ruteo de vehículos con un solo producto, múltiples fuentes y destinos, y capacidad de carga limitada.

Abstract

In this study we propose to formulate and solve a variant of the Vehicle Routing Problem (VRP) using Integer Lineal Programming. First, we begin with a literature review of VRP and some heuristics. After that, we present the main problem in order to model, implement and solve it. Afterwards, two Integer Lineal Programming models are presented, the second one being more compact and concise than the first one. Subsequently, in order to check the validity of the models, they are tested over a toy-like instance. Then, we carry out numerical experiments with 52 instances of the problem, where we retain the function objective value and duality GAP with a limit time of 3600 seconds. Next, a two-phase heuristic is developed, and with it, the 52 instances are performed. We retain the objective value and duality GAP. Finally, we report the results of initializing the second model with the solutions obtained by the heuristic in order to get better results.