Share Email Print
cover

Proceedings Paper

Study on emergency service location problem with continuous edge demands
Author(s): Qing Ye; Jianshe Song; Jiping Cao
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

At the traditional location problems on networks consider discrete nodal demand. However, accidents may happen at any point in the road. Demand set is the continuum set of all points on a network graph. The issue of general absolute center was studied in this paper. With the assumption that the distance-matrix of the network is available, let | E | be the number of edges of a network. According to the character of the graph of distance function and its graphical nature which reflects the relationship between points and edges, an O(| E |2 ⋅lg | E |) algorithm about the location problem of single emergency service was given, so that emergency service emergency response time of the maximum shortest.

Paper Details

Date Published: 13 March 2013
PDF: 6 pages
Proc. SPIE 8784, Fifth International Conference on Machine Vision (ICMV 2012): Algorithms, Pattern Recognition, and Basic Technologies, 87840M (13 March 2013); doi: 10.1117/12.2013812
Show Author Affiliations
Qing Ye, Xi'an Research Institute of High Technology (China)
Jianshe Song, Xi'an Research Institute of High Technology (China)
Jiping Cao, Xi'an Research Institute of High Technology (China)


Published in SPIE Proceedings Vol. 8784:
Fifth International Conference on Machine Vision (ICMV 2012): Algorithms, Pattern Recognition, and Basic Technologies
Yulin Wang; Liansheng Tan; Jianhong Zhou, Editor(s)

© SPIE. Terms of Use
Back to Top