A matheuristic routing algorithm in support of a dynamic, integrated mobility system

In a traditional mobility policy, public transport is supplemented with (private) dial-a-ride services,
providing demand-dependent door-to-door transport tailored to the needs of people with mobility
restrictions. Since it is not efficient to subsidize two systems operating independently in the same
service area, many governments are currently implementing an innovative demand-driven
mobility policy. Private dial-a-ride services are increasingly invoked to replace unprofitable public
transport in rural areas. This is an opportunity for dial-a-ride providers to extend their services to
people without mobility restrictions, whose trip may then consist of a combination of dial-a-ride
services (in rural areas) and regular public transport (on (sub)urban and interurban axes).
To ensure the efficiency of their operations, dial-a-ride providers need an efficient dynamic routing
algorithm which integrates public transport into their routing process. For example, the itineraries
and transfer locations of users need to be determined in real time, adapting the routes and
schedules of the dial-a-ride vehicles based on the dynamic characteristics of the system. This gives
rise to a challenging routing problem in which synchronization between routes and modes is
essential. This proposal focuses on fundamental methodological research efforts to develop a
matheuristic routing algorithm which enables the shaping and operational implementation of such
dynamic integrated mobility systems