Although, speed up techniques are efficient and fast enough to compute shortest paths, they become less
performant or even inapplicable when additional constraints are added to the SPP such as stochasticity and multicriteria
paths optimization. Therefore, there has been an application need to develop new routing approaches that
provide optimal or near optimal routes in reasonable computational time in large-scale multimodal networks, as well
as, that cope with additional problem constraints such as stochastic arcs’ weights, multi-criteria optimization etc.
We believe that meta-heuristics such as Genetic Algorithms, Local Search Procedures are efficient candidates to
handle such requirements.