Time dependent multiobjective best path for multimodal urban routing

While the fastest path problem has been widely studied with excellent results, little research has been done on the time dependent multiobjective best paths. Applied to multimodal urban routing, this approach offers multiple suggestions adapted to variety of user preferences. We propose a simple model with intersting properties that allows to use traditional algorithms with little modifications. The experimental computation time are acceptable for a real world application.