The challenge in route planning and scheduling is that there is a vast number of possible routes from which an optimal one has to be chosen. Finding such an optimal route is very complex because of the many side constraints that have to be taken into account such as time windows, resting, driving and transition time regulations and travel time uncertainties. In addition, personal preferences can also be relevant for the personalized ‘optimal’ routes.
By combining mathematical techniques from operations research, combinatorial optimization and discrete choice modelling, optimal routes can be computed in an automated and efficient way. These techniques can be used for the planning and scheduling of routes in road, rail, air and ship traffic, as well as personalized travel advice.
While practitioners usually spend weeks on constructing feasible routes, new algorithms that we develop can compute routes with a provable optimality guarantee within seconds. This is valuable for both freight transport and personal mobility.
Contact person: Guido Schäfer
Research groups: Networks and Optimization (N&O), Stochastics (ST)
Research partners: Rovecom, NLR, RouteXL, NS (2007), Municipality of Amsterdam, Verhaert, GVB, Connexxion, TrafficLink, ARS, Verkeersonderneming