Constraint Programming Algorithms for Route Planning Exploiting Geometrical Information

Engineering Route Planning Algorithms

Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to three million times faster than Dijkstra’s algorithm. We give an overview of the techniques enabling this development and point out frontiers of ongoing research on more challenging variants of the problem that include dynamically changing networks, time-depend...

Exploiting Domain Geometry in Analogical Route Planning

Exploiting domain geometry in analogical route planning

Automated route planning consists of using real maps to automatically nd good map routes. Two shortcomings to standard methods are (i) that domain information may be lacking, and (ii) that a \good" route can be hard to de ne. Most on-line map representations do not include information that may be relevant for the purpose of generating good realistic routes, such as tra c patterns, construction,...

Algorithms and Constraint Programming

Constraint Programming is a powerful programming paradigm with a great impact on a number of important areas such as logic programming [45], concurrent programming [42], artificial intelligence [12], and combinatorial optimization [46]. We believe that constraint programming is also a rich source of many challenging algorithmic problems, and cooperations between the constraint programming and t...

Route Planning Algorithms for Urban Environment

vi