Programación de turnos de conductores del sistema de troncales del transporte masivo del área metropolitana del centro occidente mediante algoritmos genéticos

Abstract

Crew scheduling problem is the task of assigning drivers to a sequence of bus trips while ensuring a constraint set. In real systems the more number of trips the more complex the problem gets, which means invest a lot of resources to solve it. This paper presents a genetic algorithm for crew scheduling problem in the trunk system of the center western metropolitan mass transport. A piece based chromosome structure is applied. After randomly create the initial population and mutation operator, chromosomes pass through a repairing method. The simulations result show the importance of the mutation method in this case. Compared with manual method of the operator company the algorithm provides an effective solution within a fast timeframe, to 3 routes for a total of 178 trips. Keywords: Genetic algorithms, crew scheduling problem, massive public transport, metaheuristics