Real-time traffic assignment using engineered customizable contraction hierarchies
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5610761 (Why is no real title available?)
- scientific article; zbMATH DE number 5734722 (Why is no real title available?)
- scientific article; zbMATH DE number 1099195 (Why is no real title available?)
- scientific article; zbMATH DE number 956791 (Why is no real title available?)
- A framework for and empirical study of algorithms for traffic assignment
- A note on two problems in connexion with graphs
- Aggregation and equilibrium with multinomial logit models
- Algorithms and Data Structures
- Algorithms – ESA 2005
- Customizable contraction hierarchies
- Experimental algorithms. 10th international symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5--7, 2011. Proceedings
- Fast Routing in Road Networks with Transit Nodes
- GRASP. Extending graph separators for the single-source shortest-path problem
- Graph bisection with Pareto optimization
- Hierarchical hub labelings for shortest paths
- Nested Dissection of a Regular Finite Element Mesh
- Priority queues with update and finding minimum spanning trees
- SHARC, fast and robust unidirectional routing
- Search-space size in contraction hierarchies
- Simple and Space-Efficient Minimal Perfect Hash Functions
Cited in
(5)- Space-efficient, fast and exact routing in time-dependent road networks
- Customizable contraction hierarchies
- Combining predicted and live traffic with time-dependent A^* potentials
- Paradigms to deploy a behavior-consistent approach for information-based real-time traffic routing
- A customized two-stage parallel computing algorithm for solving the combined modal split and traffic assignment problem
This page was built for publication: Real-time traffic assignment using engineered customizable contraction hierarchies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4984867)
