Author(s)

G. Fleury, M. Gourgand & E. Molimard

Abstract

Driver scheduling problem in urban transit networks is highly combinato- rial and characterized by many constraints sometimes difficult to formalize (feasibility constraints, social rules...). The main purpose is to minimize the number of driver shifts. We present an algorithm inspired by simulated annealing and we explain how it has been adapted to the studied problem The mam interest of our method is that it permits to take into account some constraints that can not be handled by other software products. 1 Introduction Urban transit companies proceed in three operations in order to satisfy the user transport demand. After the network has been designed, the first operation, called Vehicle Scheduling, consists in assigning at best vehicles to the network lines to satisfy the user d

Keywords