{"title":"Connected placement of disaster shelters in modern cities","authors":"Huanyang Zheng, Jie Wu","doi":"10.1145/2979683.2979690","DOIUrl":null,"url":null,"abstract":"This paper is motivated by the fact that modern cities are surprisingly vulnerable to large-scale emergencies, such as the recent terrorist attacks on Paris that resulted in the death of 130 people. Disaster shelters are one of the most effective methods to handle large-scale emergencies. Hence, this paper establishes disaster shelters with bounded costs. The objective is to minimize the total establishment costs of disaster shelters under three constraints. The first constraint is a distance constraint, which requires that people must be assigned to disaster shelters within a certain range. The second constraint is a capacity constraint, which requires that disaster shelters must have the capacity to hold incoming people. The third constraint is a connection constraint, which requires that disaster shelters should be connected to avoid being isolated. Two bounded algorithms are proposed to efficiently establish disaster shelters. Real data-driven experiments are conducted to demonstrate the efficiency and effectiveness of the proposed algorithms.","PeriodicalId":350119,"journal":{"name":"Proceedings of the Eleventh ACM Workshop on Challenged Networks","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Eleventh ACM Workshop on Challenged Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2979683.2979690","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This paper is motivated by the fact that modern cities are surprisingly vulnerable to large-scale emergencies, such as the recent terrorist attacks on Paris that resulted in the death of 130 people. Disaster shelters are one of the most effective methods to handle large-scale emergencies. Hence, this paper establishes disaster shelters with bounded costs. The objective is to minimize the total establishment costs of disaster shelters under three constraints. The first constraint is a distance constraint, which requires that people must be assigned to disaster shelters within a certain range. The second constraint is a capacity constraint, which requires that disaster shelters must have the capacity to hold incoming people. The third constraint is a connection constraint, which requires that disaster shelters should be connected to avoid being isolated. Two bounded algorithms are proposed to efficiently establish disaster shelters. Real data-driven experiments are conducted to demonstrate the efficiency and effectiveness of the proposed algorithms.