What is it about?
Multi Threaded Dijkstra's (MTD) algorithm is a novel efficient graph search algorithm that can solve the median problem optimally on real road networks. The algorithm can solve median problems on networks with over 500,000 nodes in seconds.
Featured Image
Why is it important?
Multi Threaded Dijkstra's (MTD) algorithm is a novel and efficient algorithm for solving median problems on real road networks. The scalability of the MTD algorithm is unparalleled while the runtime is significantly (thousands of times) lower than the fastest methods in the literature.
Perspectives
The MTD algorithm is paired with a clustering heuristic to develop an efficient solution method for p-median problems on real road networks. The computational study is applied on a real road network with over 500,000 nodes.
Saeed Ghanbartehrani
Ohio University
Read the Original
This page is a summary of: An efficient algorithm for solving the median problem on real road networks, Engineering Optimization, July 2019, Taylor & Francis,
DOI: 10.1080/0305215x.2019.1631305.
You can read the full text:
Contributors
The following have contributed to this page
