Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies

DOI10.1145/3362693OpenAlexW2994987435WikidataQ126585545 ScholiaQ126585545MaRDI QIDQ4984867

Dorothea Wagner, Valentin Buchhold, Peter Sanders

Publication date: 21 April 2021

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3362693

zbMATH Keywords

traffic assignmentroute planningnetwork equilibrium problembatched shortest pathscustomizable contraction hierarchies

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (2)

A customized two-stage parallel computing algorithm for solving the combined modal split and traffic assignment problem ⋮ Space-efficient, fast and exact routing in time-dependent road networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Search-space size in contraction hierarchies
• A framework for and empirical study of algorithms for traffic assignment
• Experimental algorithms. 10th international symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5--7, 2011. Proceedings
• Aggregation and equilibrium with multinomial logit models
• Priority queues with update and finding minimum spanning trees
• Hierarchical Hub Labelings for Shortest Paths
• GRASP. Extending Graph Separators for the Single-Source Shortest-Path Problem
• Fast Routing in Road Networks with Transit Nodes
• Simple and Space-Efficient Minimal Perfect Hash Functions
• Graph Bisection with Pareto Optimization
• Customizable Contraction Hierarchies
• SHARC
• Algorithms – ESA 2005
• Nested Dissection of a Regular Finite Element Mesh
• Algorithms and Data Structures

This page was built for publication: Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies