Optimización en sistemas de transporte público: modelo de asignación de flota basado en redes espacio temporales.

Abstract

In this work we are focused on the multi-depot vehicle scheduling problem. The problem consists in assigning a set of trips to routes of minimum cost bus routes, such that each trip is covered by exactly one bus, each bus returns to the initial station at the end of the working day, and the number of available buses is not exceeded. As a result of this work, a linear programming model is implemented using time-space networks with application to the transportation system of Quito Trolebús. Extensive computational results are reported using real and simulated instances that vary its size both in terms of the number of depots or number of trips. Finally, conclusions and recommendations of the present work are presented.