operations research methods, graph algorithms, decision making, transport forecasting, scheduling
Abstract:
Exact, heuristic, metaheuristic methods. Static and dynamic shortest path problem. Location analysis, P&R/K&R facilities location. Travelling salesman problem with constraints. Assignment problem and matching algorithms. Decision making in urban transport. Design of urban transport lines. Scheduling in public transport.
Objectives:
Follow up basic problems and methods of graph theory and extend the knowledge of dynamic and constrained problems applicable in logistics and smart cities. Introduce advanced algorithms and operations research tools.