NDLI: Finding the shortest path in huge data traffic networks: A hybrid speed model

Content Provider	IEEE Xplore Digital Library
Author	Yulong Duan Changle Li Chao Guo Zhe Liu Lina Zhu Xiang Fei Ullah, S.
Copyright Year	2015
Description	Author affiliation: State Key Lab. of Integrated Services Networks, Xidian Univ., Xi'an, China (Yulong Duan; Changle Li; Chao Guo; Zhe Liu; Lina Zhu) \|\| KooRun Smart City Res. Lab., Xi'an, China (Xiang Fei) \|\| CISTER Res. Center, Polytech. Inst. of Porto (IPP), Porto, Portugal (Ullah, S.)
Abstract	The shortest path problem has become an important issue in the increasingly complex road networks nowadays, especially for these applications which are strict with high timeliness. However, searching the shortest path is difficult as road traffic flows are time-varying. An important issue in searching the shortest path is how to obtain the time expired on each segment at the given time. To this purpose, we propose a hybrid speed model to calculate the travel time in this paper, which considers the difference between the speed in congested and uncongested road networks. And analysis of speed in both conditions are given, respectively. Subsequently, a metric is also proposed to distinguish between congested and uncongested networks. Our work also utilizes the huge traffic data to reflect and analyze the real scenario. Compared to the previous work, this paper considers a more complex urban traffic scenario and some verifications are made with our data. Finally, a numerical study is carried out in the urban road network in Kaohsiung, Taiwan. The results show the hybrid speed model can give travel time prediction in an accurate way and can provide useful information for road designers.
Starting Page	6906
Ending Page	6911
File Size	3939260
Page Count	6
File Format	PDF
e-ISBN	9781467364324
DOI	10.1109/ICC.2015.7249426
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-06-08
Publisher Place	UK
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Numerical models
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Genetic Algorithm Finding the Shortest Path in Networks

RapidPath: Accelerating Constrained Shortest Path Finding in Graphs on FPGA (Abstract Only)

A hybrid evolutionary-graph approach for finding functional network paths

An analytical method considering bursty traffic for data transfer in high-speed networks

Minimum-Time Path in Network with Time-Dependent Flow Speed

Dynamic shortest path in stochastic traffic networks based on fluid neural network and Particle Swarm Optimization

A dual neural network for shortest-path routing

Genetic Algorithm Finding the Shortest Path in Networks

Evaluation on Quantum Computation and Classic Parallel Approaches for Finding Estimation of the Length of Shortest Path in a Weighted Graph

Finding the shortest path in huge data traffic networks: A hybrid speed model

Similar Documents

Genetic Algorithm Finding the Shortest Path in Networks

RapidPath: Accelerating Constrained Shortest Path Finding in Graphs on FPGA (Abstract Only)

A hybrid evolutionary-graph approach for finding functional network paths

An analytical method considering bursty traffic for data transfer in high-speed networks

Minimum-Time Path in Network with Time-Dependent Flow Speed

Dynamic shortest path in stochastic traffic networks based on fluid neural network and Particle Swarm Optimization

A dual neural network for shortest-path routing

Genetic Algorithm Finding the Shortest Path in Networks

Evaluation on Quantum Computation and Classic Parallel Approaches for Finding Estimation of the Length of Shortest Path in a Weighted Graph

Finding the shortest path in huge data traffic networks: A hybrid speed model