Article

Free access

Hierarchical optimization of optimal path finding for transportation applications

Authors:

Ning Jing,

Yun-Wu Huang,

Elke A. RundensteinerAuthors Info & Claims

CIKM '96: Proceedings of the fifth international conference on Information and knowledge management

Pages 261 - 268

https://doi.org/10.1145/238355.238550

Published: 12 November 1996 Publication History

PDF eReader

References

[1]

R. Agrawal, S. Dar and H. V. Jagadish, "Direct Transitive Closure Algorithms: Design and Performance Evaluation," A CM TODS, Vol. 15, No. 3, Sep. 1990, pp. 427 - 458.

Digital Library

Google Scholar

[2]

R. Agrawal and H. V. Jagadish, "Materialization and Incremental Update of Path Information", Proc. of the 5th Int. Conf. on Data Engineering, 1989, pp. 374- 383.

Digital Library

Google Scholar

[3]

R. Agrawal and H. V. Jagadish, "Hybrid Transitive Closure Algorithms," Proc. of the 16th VLDB Conf., 1990, pp. 326- 334.

Digital Library

Google Scholar

[4]

T. Cormen, C. Leiserson, and R. L. Rivest, "Introduction to Algorithms," The MIT Press, 1993.

Digital Library

Google Scholar

[5]

E.W. Dijkstra, "A Note on Two Problems in Connection with Graph Theory," Numerische Mathematik, Vol. 1, 1959, pp. 269 - 271.

Digital Library

Google Scholar

[6]

M. J. Egenhofer, "What's Special about Spatial? Database Requirements for Vehicle Navigation in Geographic Space," Proc. of the 1993 ACM SIGMOD Conf., 1993, pp. 398 - 402.

Digital Library

Google Scholar

[7]

M.A.W. Hustma, Peter M. G. Apers, and S. Ceil, "Distributed Transitive Closure Computations: The Disconnection Set Approach," Proc. of the 16th VLDB Conf., 1990, pp. 335 - 346.

Digital Library

Google Scholar

[8]

M.A.W. Hustma, E Cacace, and S. Ceil, "Parallel Hierarchical Evaluation of Transitive Closure Queries," Proc. of the 1st Int. Conf. on Parallel and Distributed Information Systems, 1990, pp. 130- 137.

Digital Library

Google Scholar

[9]

Y. W. Huang, N. Jing, and E. A. Rundensteincr, "A Semi-Materialized View Approach for Route Maintenance in IVHS," Proc. of the 2nd A CM Workshop on Geographic Information Systems, 1994, pp. 144 - 15 i.

Google Scholar

[10]

Y. W. Huang, N. Jing, and E. A. Rundenstciner, "Hierarchical Path Views: A Model Based on Fragmentation and Tramportation Road Types," Proc. of the 3rd ACM Workshop on Geographic Information Systems, 1995, pp. 93 - 100.

Google Scholar

[11]

Y. W. Huang, N. Jing, and E. A. Rundensteiner, "Effective Graph Clustering for Path Queries in Digital Map Databases," Proc. of the 5th Int. Conf. on Information and Knowledge Managemen# 1996.

Digital Library

Google Scholar

[12]

Y. Ioannidis, R. Ramakrishnan, and L. Winger, "Transitive Closure Algorithms Based on Graph Traversal," ACM TODS, Vol. 18, No. 3, Sep. 1993, pp. 512- 576.

Digital Library

Google Scholar

[13]

N. Jing, Y. W. Huang, and E. A. Rundensteiner, "Hierarchical Encoded Path View Approach and Its Evaluation," ITS Research Center of Excellence, University of Michigan, UMTRI- 88499, 1995.

Google Scholar

[14]

S. Jung, S. Pramanik, "HiTi Graph Model of Topological Road Maps in Navigation Systems," Proc. of the 12th Int. Conf. on Data Engineering, 1996, pp. 76- 84.

Digital Library

Google Scholar

[15]

Loral Federal Systems, "IVHS Architecture Phase One Final Report", Sponsored by Federal Highway Administration, DTFH61-93-C-O0211, 1994.

Google Scholar

[16]

S. Shekar, A. Kohli, and M. Coyle, "Path Computation Algorithms for Advanced Traveler Information Systems," Proc. of the 9th Int. Conf. on Data Engineering, 1993, pp. 31 - 39.

Digital Library

Google Scholar

Cited By

View all

Rafi ANihal MAziz A(2025)ShopiRound: An Android application-based e-commerce system to find products nearby using travelling salesman problemSoftwareX10.1016/j.softx.2024.10197329(101973)Online publication date: Feb-2025
https://doi.org/10.1016/j.softx.2024.101973
García RAngles R(2024)Path Querying in Graph Databases: A Systematic Mapping StudyIEEE Access10.1109/ACCESS.2024.337197612(33154-33172)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2024.3371976
Balzotti LFranciosa P(2022)Non-crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear TimeComputer Science – Theory and Applications10.1007/978-3-031-09574-0_6(77-95)Online publication date: 24-Jun-2022
https://doi.org/10.1007/978-3-031-09574-0_6
Show More Cited By

Index Terms

Hierarchical optimization of optimal path finding for transportation applications

Recommendations

A Hierarchical Path View Model for Path Finding in Intelligent Transportation Systems

Effective path finding has been identified as an important requirement for dynamic route guidance in Intelligent Transportation Systems (ITS). Path finding is most efficient if the all-pair (shortest) paths are precomputed because path search requires ...
A label-setting algorithm for finding a quickest path

The quickest path problem is to find a path to send a given amount of data from the source to the destination with minimum transmission time. To find the quickest path, existing algorithms enumerate nondominated paths with distinct capacity, and then ...
Hierarchical heterogeneous particle swarm optimization: algorithms and evaluations

Particle swarm optimization PSO has recently been extended in several directions. Heterogeneous PSO HPSO is one of such recent extensions, which implements behavioural heterogeneity of particles. In this paper, we propose a further extended version, ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

CIKM '96: Proceedings of the fifth international conference on Information and knowledge management

November 1996

344 pages

ISBN:0897918738

DOI:10.1145/238355

Chairmen:
Charles Nicholas
Univ. of Maryland, Baltimore County
,
Niki Pissinou
The Center for Advanced Computer Studies, USL
,
Editors:
M. Tamer Özsu
Univ. of Alberta, Edmonton, Alta., Canada
,
Ken Barker
Univ. of Manitoba, Winnipeg, Man., Canada

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 November 1996

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

CIKM96

Sponsor:

CIKM96: Conference on Information and Knowledge Management

November 12 - 16, 1996

Maryland, Rockville, USA

Acceptance Rates

Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

Upcoming Conference

CIKM '25

Sponsor:
sigir
sigir

The 34th ACM International Conference on Information and Knowledge Management

November 10 - 14, 2025

Seoul , Republic of Korea

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

57
Total Citations
View Citations
1,192
Total Downloads

Downloads (Last 12 months)200
Downloads (Last 6 weeks)15

Reflects downloads up to 11 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Rafi ANihal MAziz A(2025)ShopiRound: An Android application-based e-commerce system to find products nearby using travelling salesman problemSoftwareX10.1016/j.softx.2024.10197329(101973)Online publication date: Feb-2025
https://doi.org/10.1016/j.softx.2024.101973
García RAngles R(2024)Path Querying in Graph Databases: A Systematic Mapping StudyIEEE Access10.1109/ACCESS.2024.337197612(33154-33172)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2024.3371976
Balzotti LFranciosa P(2022)Non-crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear TimeComputer Science – Theory and Applications10.1007/978-3-031-09574-0_6(77-95)Online publication date: 24-Jun-2022
https://doi.org/10.1007/978-3-031-09574-0_6
Chen SXu J(2021)Dynamic Shortest Path Queries over Moving Objects on Road NetworksSpatial Data and Intelligence10.1007/978-3-030-69873-7_4(44-59)Online publication date: 28-Feb-2021
https://doi.org/10.1007/978-3-030-69873-7_4
de Sousa RBoukerche ALoureiro A(2020)A Map Matching Based Framework to Reconstruct Vehicular Trajectories from GPS DatasetsICC 2020 - 2020 IEEE International Conference on Communications (ICC)10.1109/ICC40277.2020.9148732(1-6)Online publication date: Jun-2020
https://doi.org/10.1109/ICC40277.2020.9148732
Gupta AShanker U(2020)Study of fuzzy logic and particle swarm methods in map matching algorithmSN Applied Sciences10.1007/s42452-020-2431-y2:4Online publication date: 11-Mar-2020
https://doi.org/10.1007/s42452-020-2431-y
Shen BZhao YLi GZheng WQin YYuan BRao Y(2017)V-Tree: Efficient kNN Search on Moving Objects with Road-Network Constraints2017 IEEE 33rd International Conference on Data Engineering (ICDE)10.1109/ICDE.2017.115(609-620)Online publication date: Apr-2017
https://doi.org/10.1109/ICDE.2017.115
Sun YYu XBie RSong H(2017)Discovering time-dependent shortest path on traffic graph for drivers towards green drivingJournal of Network and Computer Applications10.1016/j.jnca.2015.10.01883:C(204-212)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1016/j.jnca.2015.10.018
Wen FWang XZhang G(2017)Evolutionary-based automatic clustering method for optimizing multilevel networkCluster Computing10.1007/s10586-017-1030-120:4(3161-3172)Online publication date: 1-Dec-2017
https://dl.acm.org/doi/10.1007/s10586-017-1030-1
Gunturi VShekhar SGunturi VShekhar S(2017)Fastest Path for a Single Departure-TimeSpatio-Temporal Graph Data Analytics10.1007/978-3-319-67771-2_4(25-41)Online publication date: 1-Nov-2017
https://doi.org/10.1007/978-3-319-67771-2_4
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

A Hierarchical Path View Model for Path Finding in Intelligent Transportation Systems

A label-setting algorithm for finding a quickest path

Hierarchical heterogeneous particle swarm optimization: algorithms and evaluations