Extensions for applying advanced method of shortest path queries
Project/Area Number |
23510183
|
Research Category |
Grant-in-Aid for Scientific Research (C)
|
Allocation Type | Multi-year Fund |
Section | 一般 |
Research Field |
Social systems engineering/Safety system
|
Research Institution | Sophia University |
Principal Investigator |
|
Project Period (FY) |
2011 – 2013
|
Project Status |
Completed (Fiscal Year 2013)
|
Budget Amount *help |
¥4,030,000 (Direct Cost: ¥3,100,000、Indirect Cost: ¥930,000)
Fiscal Year 2013: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2012: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2011: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
Keywords | 最短路検索 / 組合せ最適化 / 離散アルゴリズム / オペレーションズ・リサーチ / 最短路問題 / アルゴリズム / データ構造 / 数理最適化 |
Research Abstract |
Methods for shortest path queries are investigating to answer the shortest path for the given origin and destination. Since the middle of 2000, several techniques are proposed. Though these techniques cannot improve the computational complexity for the shortest path problem, these are efficient for real-world instances. In this research, we extend the methodology of the shortest path queries for applying practical problems.
|
Report
(4 results)
Research Products
(28 results)