By Topic

C*: A Bivariate Best First Search to Process Category Sequence Traversal Queries in a Transportation Network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Qifeng Lu ; Center for Geospatial Inf. Technol., Virginia Polytech. Inst. & State Univ. Alexandria, Alexandria, VA, USA ; Hancock, K.

A Category Sequence Traversal Query (CSTQ) is a new type of category based query that determines the minimum-cost path with a predefined origin-destination pair, traversing at least a single selection from each of a set of categories in a specified order. CSTQ has distinct applications in transportation trip planning and other potential applications whenever a workflow exists to traverse a set of categories of interest. This paper proposes bivariate best first searches to process CSTQ in a transportation network. Specifically, this paper 1) proposes a general multivariate best first search framework, L#, to process multiple points/categories of interest in a graph; 2) presents a developed bivariate best first search algorithm, C*, to process CSTQ in a general graph; and 3) provides C*-P and C*-Dijkstra, two bivariate best-first-search instances of C*, to retrieve optimal solutions for CSTQ processing in a transportation network. The performance of C*-P and C*-Dijkstra are analyzed with a set of experiments in a large urban dense transportation network, and the results show that on average, C*-Dijkstra is 5.9~8.8 times slower and expands 4.3~5.0 times more states than C*-P, with number of categories up to 7 and number of objects in each category up to 3800.

Published in:

Advanced Geographic Information Systems, Applications, and Services (GEOPROCESSING), 2010 Second International Conference on

Date of Conference:

10-16 Feb. 2010