Vehicle Routing in Time-Dependent Networks

How to improve traffic assignments with mathematical methods
Vehicle Routing in Time-Dependent Networks
Mathematical models can aid in planning efficient vehicle routing

 

This mobility project investigates traffic assignments on the basis of game theory. The aim of the project is to develop new mathematical methods and methodology in order to improve algorithms and upgrade information technologies for supporting decision makers in multi-agent dynamic transportation systems. The project also plans to develop an original technique for OD-matrices reconstruction and estimation based on a plate scanning system. The project lasts for two years from the beginning of 2018 until the end of 2019.

 

Project team

Principal investigator Tero Tuovinen

Visiting professor Victor Zakharov

Professor Pekka Neittaanmäki

Publications

Mugayskikh, A.; Zakharov, V.; Tuovinen, T. (2018) Time-Dependent Multiple Depot Vehicle Routing Problem on Megapolis Network under Wardrop’s Traffic Flow Assignment