{"title":"具有二次疏散预期成本的双目标疏散路径工程模型","authors":"Liu Na , Shao Xueyan , Qi Mingliang","doi":"10.1016/j.sepro.2012.04.001","DOIUrl":null,"url":null,"abstract":"<div><p>The recent nuclear leakage accidents have made evacuation a leading issue in engineering emergency management. Evacuation routing is one of key problems for helping people move to safety. In this paper, a bi-objective model is proposed to optimize the engineering route assignment, with the possibilities of secondary evacuation in consideration. This model is aimed to minimize the maximum travel time and minimize the secondary evacuation expected costs simultaneously. An approximation algorithm with polynomial complexity is designed to solve this model. Finally, a numerical example is given to demonstrate the actual significance of our model the validity of this algorithm.</p></div>","PeriodicalId":101207,"journal":{"name":"Systems Engineering Procedia","volume":"5 ","pages":"Pages 1-7"},"PeriodicalIF":0.0000,"publicationDate":"2012-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.sepro.2012.04.001","citationCount":"23","resultStr":"{\"title\":\"A Bi-objective Evacuation Routing Engineering Model with Secondary Evacuation Expected Costs\",\"authors\":\"Liu Na , Shao Xueyan , Qi Mingliang\",\"doi\":\"10.1016/j.sepro.2012.04.001\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The recent nuclear leakage accidents have made evacuation a leading issue in engineering emergency management. Evacuation routing is one of key problems for helping people move to safety. In this paper, a bi-objective model is proposed to optimize the engineering route assignment, with the possibilities of secondary evacuation in consideration. This model is aimed to minimize the maximum travel time and minimize the secondary evacuation expected costs simultaneously. An approximation algorithm with polynomial complexity is designed to solve this model. Finally, a numerical example is given to demonstrate the actual significance of our model the validity of this algorithm.</p></div>\",\"PeriodicalId\":101207,\"journal\":{\"name\":\"Systems Engineering Procedia\",\"volume\":\"5 \",\"pages\":\"Pages 1-7\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.sepro.2012.04.001\",\"citationCount\":\"23\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Systems Engineering Procedia\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2211381912000446\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Systems Engineering Procedia","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2211381912000446","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Bi-objective Evacuation Routing Engineering Model with Secondary Evacuation Expected Costs
The recent nuclear leakage accidents have made evacuation a leading issue in engineering emergency management. Evacuation routing is one of key problems for helping people move to safety. In this paper, a bi-objective model is proposed to optimize the engineering route assignment, with the possibilities of secondary evacuation in consideration. This model is aimed to minimize the maximum travel time and minimize the secondary evacuation expected costs simultaneously. An approximation algorithm with polynomial complexity is designed to solve this model. Finally, a numerical example is given to demonstrate the actual significance of our model the validity of this algorithm.