Modelo para la solución de un problema de ruteo de vehículos con capacidad y ventanas de tiempo, en el servicio de transporte de canje y correo bancario

Abstract

Through the present work of degree is intended to model a problem of routing of vehicles with capacity restrictions and time windows, hereinafter CVRPTW, for its acronym in English (Capacitated Vehicle Routing Problem with Time Windows) of the messaging service called mail transport and banking exchange. The service consists in the scheduled transport of documents which are packed in sealed cargo units, the collection and subsequent delivery is carried out in time windows agreed with the clients.To model the service, the following restrictions will be integrated into traditional VRPs, time windows, loading capacity of vehicles and simultaneous pick-ups.For the investigation, a real case was first diagnosed in a courier company in Colombia, with which the variables and service restrictions were determined.Where we have as a central question of this research: How can the problem of routing of vehicles with capacity restrictions and time windows that represents the service of transport of exchange and bank mail be solved, in such a way that the required resources are optimized? To solve the CVRPTW, the problem was divided into two stages, a first phase of clustering or creation of clusters and then a problem of route design was solved for each cluster by means of the problem of traveling agent with time windows (TSPTW).