Conference Proceeding Article
In this paper, we consider a new problem in the context of road network databases, named Resource Constrained Best Upgrade Plan computation (BUP, for short). Consider a transportation network (weighted graph) G where a subset of the edges are upgradable, i.e., for each such edge there is a cost, which if spent, the weight of the edge can be reduced to a specific new value. Given a source and a destination in G, and a budget (resource constraint) B, the BUP problem is to identify which upgradable edges should be upgraded so that the shortest path distance between source and destination (in the updated network) is minimized, without exceeding the available budget for the upgrade. In addition to transportation networks, the BUP query arises in other domains too, such as telecommunications. We propose a framework for BUP processing and evaluate it with experiments on large, real road networks.
Real road networks, Resource Constraint, Road network, Shortest path, Transportation network, Weighted graph
Databases and Information Systems | Numerical Analysis and Scientific Computing | Transportation
Data Management and Analytics
Advances in Spatial and Temporal Databases: 13th International Symposium, SSTD 2013, Munich, Germany, August 21-23, 2013: Proceedings
City or Country
LIN, Yimin and MOURATIDIS, Kyriakos.
Best Upgrade Plans for Large Road Networks. (2013). Advances in Spatial and Temporal Databases: 13th International Symposium, SSTD 2013, Munich, Germany, August 21-23, 2013: Proceedings. 8098, 223-240. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/1823
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.