A novel approach to delineating the service area of facilities in a network

Yujie Hu; Xiang Li; Menglei Li

doi:10.1109/ICFCC.2010.5497293

A novel approach to delineating the service area of facilities in a network

Yujie Hu
, Xiang Li^*
, Menglei Li

^*Corresponding author for this work

School of Geographic Sciences

East China Normal University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

Many research questions exist in a variety of network environments in the real world, such as delineating the service area of facilities distributed in a network. In this paper, with respect to the traditional method - the breadth-first search algorithm, a new method based on the shortest path algorithm is proposed to delineate service area. A series of experiments are conducted to compare the computational time between the proposed algorithm and the breadth-first search algorithm and the results demonstrate that, in most cases, the proposed one can save much more computational time, especially when the scale of road network or the impedance of the network center increases.

Original language	English
Title of host publication	Proceedings of the 2010 2nd International Conference on Future Computer and Communication, ICFCC 2010
Pages	V235-V239
DOIs	https://doi.org/10.1109/ICFCC.2010.5497293
State	Published - 2010
Event	2010 2nd International Conference on Future Computer and Communication, ICFCC 2010 - Wuhan, China Duration: 21 May 2010 → 24 May 2010

Publication series

Name	Proceedings of the 2010 2nd International Conference on Future Computer and Communication, ICFCC 2010
Volume	2

Conference

Conference	2010 2nd International Conference on Future Computer and Communication, ICFCC 2010
Country/Territory	China
City	Wuhan
Period	21/05/10 → 24/05/10

Keywords

Geographic information system
Network
Service area of a network center
Shortest path

Access to Document

10.1109/ICFCC.2010.5497293

Cite this

Hu, Y., Li, X., & Li, M. (2010). A novel approach to delineating the service area of facilities in a network. In Proceedings of the 2010 2nd International Conference on Future Computer and Communication, ICFCC 2010 (pp. V235-V239). Article 5497293 (Proceedings of the 2010 2nd International Conference on Future Computer and Communication, ICFCC 2010; Vol. 2). https://doi.org/10.1109/ICFCC.2010.5497293

@inproceedings{abeb081d5b504bdcae1de2288767a415,

title = "A novel approach to delineating the service area of facilities in a network",

abstract = "Many research questions exist in a variety of network environments in the real world, such as delineating the service area of facilities distributed in a network. In this paper, with respect to the traditional method - the breadth-first search algorithm, a new method based on the shortest path algorithm is proposed to delineate service area. A series of experiments are conducted to compare the computational time between the proposed algorithm and the breadth-first search algorithm and the results demonstrate that, in most cases, the proposed one can save much more computational time, especially when the scale of road network or the impedance of the network center increases.",

keywords = "Geographic information system, Network, Service area of a network center, Shortest path",

author = "Yujie Hu and Xiang Li and Menglei Li",

year = "2010",

doi = "10.1109/ICFCC.2010.5497293",

language = "英语",

isbn = "9781424458226",

series = "Proceedings of the 2010 2nd International Conference on Future Computer and Communication, ICFCC 2010",

pages = "V235--V239",

booktitle = "Proceedings of the 2010 2nd International Conference on Future Computer and Communication, ICFCC 2010",

note = "2010 2nd International Conference on Future Computer and Communication, ICFCC 2010 ; Conference date: 21-05-2010 Through 24-05-2010",

}

Hu, Y, Li, X & Li, M 2010, A novel approach to delineating the service area of facilities in a network. in Proceedings of the 2010 2nd International Conference on Future Computer and Communication, ICFCC 2010., 5497293, Proceedings of the 2010 2nd International Conference on Future Computer and Communication, ICFCC 2010, vol. 2, pp. V235-V239, 2010 2nd International Conference on Future Computer and Communication, ICFCC 2010, Wuhan, China, 21/05/10. https://doi.org/10.1109/ICFCC.2010.5497293

A novel approach to delineating the service area of facilities in a network. / Hu, Yujie; Li, Xiang; Li, Menglei.
Proceedings of the 2010 2nd International Conference on Future Computer and Communication, ICFCC 2010. 2010. p. V235-V239 5497293 (Proceedings of the 2010 2nd International Conference on Future Computer and Communication, ICFCC 2010; Vol. 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A novel approach to delineating the service area of facilities in a network

AU - Hu, Yujie

AU - Li, Xiang

AU - Li, Menglei

PY - 2010

Y1 - 2010

N2 - Many research questions exist in a variety of network environments in the real world, such as delineating the service area of facilities distributed in a network. In this paper, with respect to the traditional method - the breadth-first search algorithm, a new method based on the shortest path algorithm is proposed to delineate service area. A series of experiments are conducted to compare the computational time between the proposed algorithm and the breadth-first search algorithm and the results demonstrate that, in most cases, the proposed one can save much more computational time, especially when the scale of road network or the impedance of the network center increases.

AB - Many research questions exist in a variety of network environments in the real world, such as delineating the service area of facilities distributed in a network. In this paper, with respect to the traditional method - the breadth-first search algorithm, a new method based on the shortest path algorithm is proposed to delineate service area. A series of experiments are conducted to compare the computational time between the proposed algorithm and the breadth-first search algorithm and the results demonstrate that, in most cases, the proposed one can save much more computational time, especially when the scale of road network or the impedance of the network center increases.

KW - Geographic information system

KW - Network

KW - Service area of a network center

KW - Shortest path

UR - https://www.scopus.com/pages/publications/78049322208

U2 - 10.1109/ICFCC.2010.5497293

DO - 10.1109/ICFCC.2010.5497293

M3 - 会议稿件

AN - SCOPUS:78049322208

SN - 9781424458226

T3 - Proceedings of the 2010 2nd International Conference on Future Computer and Communication, ICFCC 2010

SP - V235-V239

BT - Proceedings of the 2010 2nd International Conference on Future Computer and Communication, ICFCC 2010

T2 - 2010 2nd International Conference on Future Computer and Communication, ICFCC 2010

Y2 - 21 May 2010 through 24 May 2010

ER -

A novel approach to delineating the service area of facilities in a network

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this