In this talk, we first overview a few challenges that arise in the
management of an Urban Transportation Network, and then we present two
problems that are successfully solved everyday by Integer Programming.
Every urban transport agency, once that has planned the timetable and has
scheduled the routes of its fleet of vehicles, has to plan the daily
activities of the drivers. A single working day of a driver is called
ÔdutyÕ and is composed of several 'piece of works' alternated with breaks.
Given a set of piece of works, the problem of creating the minimum number
of duties that partition the piece of works is known in the literature as
Driver Scheduling. This is a specific set partitioning problem that has as
fundamental subproblem a Superadditive Resource Constrained Shortest Path
problem. During the talk we present an integer programming approach to the
solution of the driver scheduling problem, and we discuss computational
results obtained with real life data.