给定费用下单设施点灾民优化安置模型  

Single facility model of victims optimal placement under given budget

作　　者：杨建芳[1,2] 高岩[1] 党亚峥[1] 

机构地区：[1]上海理工大学管理学院,上海200093 [2]杭州电子科技大学运筹与控制研究所,杭州310018

出　　处：《计算机应用研究》2012年第9期3229-3231,3247,共4页Application Research of Computers

基　　金：国家自然科学基金资助项目(11171221;11071219);国家自然科学天元基金资助项目(11026107);上海市重点学科建设项目(S30501);浙江省自然科学基金资助项目(Y6090080;Y1090465);浙江省教育厅基金资助项目(Y201016901)

摘　　要：在地震、洪灾等自然灾害过后,需要及时合理地转移灾民,如何在给定费用下合理安置灾民是救灾工作的重要组成部分。考虑了给定费用下单设施点的灾民安置问题,假设城市道路交通稳定的情况下转换成最短路树来处理,结合反向定位的思想给出数学模型,以最低费用安置所有的灾民。在此基础上以最小费用改善最大距离贪婪的原则来调整解,使得被安置的灾民离原有设施点的距离加权和尽可能小。通过算例验证了该算法的有效性和可行性。After earthquakes、floods and other natural disasters,it must transfer victims in time.How to place victims reasonably is an important part of disaster relief work.This paper considered a single facility model of victims optimal placement under the given budget.It supposed the traffic network of the city was stable,so it transformed the city net into a shortest path tree.This paper presented a mathematical model based on reverse location problem,and gave the worst placement.It adjusted the solution of the worst placement by greedy algorithm step by step,until the reasonable placement was obtained.Finally,it set an example to verify the feasibility of this algorithm

关 键 词：灾民安置 单设施点 最短路树 贪婪算法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]