Optimizing routes...
Calculating shortest paths and loading resources
Interactive Vehicle Routing Problem solver with multiple algorithms. Add customer nodes by clicking on the canvas and watch different algorithms find optimal routes.
Two mathematical collaboration paths connect me to Paul Erdős, the legendary mathematician who collaborated on over 1,500 papers.
via Dynamic Programming
Researcher at TU Dresden
The Erdős number measures collaborative distance in mathematics, connecting researchers through the vast network of mathematical collaboration.
A scholarly lineage spanning from the 1950s to 2019, tracing the evolution of transportation research through mentorship and knowledge transfer.
“Vehicle Routing Problems in Sustainable Urban Freight Transport: Model Formulations and Solution Algorithms”
Advised by: Gitakrishnan Ramadurai
“Novel dynamic user equilibrium models: Analytical formulations, multi-dimensional choice, and an efficient algorithm”
Advised by: Satish Venkata Siva Ukkusuri
“Accounting for Uncertainty, Robustness and Online Information in Transportation Networks”
Advised by: Steven Travis Waller
“Optimization and Control of Stochastic Dynamic Transportation Systems: Formulations, Solution Methodologies, and Computational Experience”
Advised by: Athanasios Ziliaskopoulos
“Optimum Path Algorithms on Multidimensional Networks: Analysis, Design, Implementation and Computational Experience”
Advised by: Hani Mahmassani
“Methodological Aspects of a Decision Aid for Transportation Choices Under Uncertainty”
Advised by: Yosef Sheffi
“Transportation Networks Equilibration with Discrete Choice Models”
Advised by: Carlos Daganzo
“Two-Lane Road Traffic: A Stochastic Model”
Advised by: D. E. Cleveland
“A Study of Highway Traffic Assignment”
Advised by: Charles Jack Keese