13 March 2013 Study on emergency service location problem with continuous edge demands
Author Affiliations +
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.
© (2013) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Qing Ye, Qing Ye, Jianshe Song, Jianshe Song, Jiping Cao, Jiping Cao, } "Study on emergency service location problem with continuous edge demands", 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; https://doi.org/10.1117/12.2013812

Back to Top