The Location Problem in Emergency Based on Uncertain Information

摘要：

This paper addresses the emergency location problem with some constraints. Let G=(V ,E) be an undirected graph with positive edge lengths and positive vertex weights. The traditional emergency location problem is to locate p facilities on vertices of G such that the sum of the weighted distances of the vertices to the closest facility is minimized. This paper considers some more practical constraints. We require that the p vertices in which the facilities are located must be connected, i.e., the subgraph induced by the p facility vertices must be connected. The resulting problem is called the connected emergency location problem.

作者: Yang Baohua Fang Zhigeng Zhao Jinshuai Ye Saiying

作者单位: College of economy & management,Nanjing University of Aeronautics and Astronautics, Nanjing,210016 Department of Computer Science, Zhoukou Normal University,Zhoukou ,466001 Departmen of science, Zhejiang University of Science and Technology，Hangzhou,310023

会议类型: 国际会议

会议名称: 2009 IEEE International Conference on Grey System and Intelligent Services(2009 IEEE灰色系统与服务科学国际会议)

会议地点: 南京

会议语种:英文

页码: 1694-1698

在线出版日期: 2009-10-20（万方平台首次上网日期，不代表论文的发表时间）