Bivariate Best First Searches to Process Category Based Queries in a Graph for Trip Planning Applications in Transportation

Bivariate Best First Searches to Process Category Based Queries in a Graph for Trip Planning Applications in Transportation

With the technological advancement in computer science, Geographic Information Science (GIScience), and transportation, more and more complex path finding queries including category based queries are proposed and studied across diverse disciplines. A category based query, such as Optimal Sequenced R...

Full description

Bibliographic Details
Main Author: Lu, Qifeng
Other Authors: Civil Engineering
Format: Others
Published: Virginia Tech 2014
Subjects:
state graph space
O*-MST
Geographic Information Science
C*- Dijkstra
O*-Greedy
O*-Dijkstra
O*-SCDMST
trip planning
category based queries
O*
Geographic Information System
admissible
L#
transportation network
logistics
multivariate
Bivariate
best first search
CSTQ
C*
consistent
path
heuristic
optimization
state graph
graph
OSTQ
C*-P
Online Access:http://hdl.handle.net/10919/26444
http://scholar.lib.vt.edu/theses/available/etd-03162009-210052/

Internet

http://hdl.handle.net/10919/26444
http://scholar.lib.vt.edu/theses/available/etd-03162009-210052/

Similar Items