An Approach to a Real World Dynamic Route Guidance Problem

Internationally organised large-scaled events often cause an overload of the host city´s public transportation network as the number of people who use the network increases immensely within a relative small timespan and their flow is concentrated to one direction in the network. To efficiently and individually route participants to the events´ location using public transport we would like to provide each individual with the quickest path on a network whose attributes constantly change over time. In this paper we give a formal description of this problem, review related work, discuss to what extent they can be used to solve the problem efficiently and finally introduce our approach.