A Survey on Querying Shortest Travel Cost on Road Networks

PhD Qualifying Examination


Title: "A Survey on Querying Shortest Travel Cost on Road Networks"

by

Mr. Zengyang GONG


Abstract:

Querying the shortest travel cost between any two locations within road 
networks is a critical function in map-based services. This query not only 
facilitates everyday navigation for millions of users but also underpins a 
multitude of real-world applications, from logistics and urban planning to 
emergency response and ridesharing services. The travel costs of road 
segments are typically modeled using various weighted functions, which has 
led to the development of distinct types of road networks: static, dynamic 
(with real-time updates), and time-dependent. To efficiently address the 
shortest travel cost query for each type of road network, a range of 
approaches has been developed in existing works. These approaches can be 
broadly categorized into tree index-based methods, labeled index-based 
methods, and learning-based methods. This survey provides a comprehensive 
exploration of the topic, elaborating on the different types of travel cost 
modeling for road networks and the various methods to answer the shortest 
travel cost query. By examining the strengths and limitations of each 
approach, this survey aims to guide future research and development in this 
critical area.


Date:                   Wednesday, 18 December 2024

Time:                   12:00noon - 2:00pm

Venue:                  Room 3494
                        Lifts 25/26

Committee Members:      Prof. Lei Chen (Supervisor)
                        Prof. Qiong Luo (Chairperson)
                        Dr. Shimin Di
                        Dr. Ziyi Liu