{"title":"基于MAX - MIN蚁群算法的应急物流路径优化研究","authors":"T. Fei, H. Ren, Liyi Zhang, Jin Zhang, Qian Li","doi":"10.1109/ICNC.2011.6022514","DOIUrl":null,"url":null,"abstract":"After disasters the emergency logistics distribution path selection problem is the key to the ways to ensure relief work go on wheels. In this article, MAX-MIN ant colony algorithm is used to solve the problem about post-disaster emergency logistics distribution path selection so that the emergency relief supplies will be sending to the disaster area more efficiently. The MAX - MIN ant colony algorithm, which has been proved by simulation, possesses advantage on solving the problem about post-disaster emergency logistics distribution path selection.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"102 1","pages":"1211-1215"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The research about emergency logistics path optimization based on MAX - MIN ant colony algorithm\",\"authors\":\"T. Fei, H. Ren, Liyi Zhang, Jin Zhang, Qian Li\",\"doi\":\"10.1109/ICNC.2011.6022514\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"After disasters the emergency logistics distribution path selection problem is the key to the ways to ensure relief work go on wheels. In this article, MAX-MIN ant colony algorithm is used to solve the problem about post-disaster emergency logistics distribution path selection so that the emergency relief supplies will be sending to the disaster area more efficiently. The MAX - MIN ant colony algorithm, which has been proved by simulation, possesses advantage on solving the problem about post-disaster emergency logistics distribution path selection.\",\"PeriodicalId\":87274,\"journal\":{\"name\":\"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications\",\"volume\":\"102 1\",\"pages\":\"1211-1215\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-07-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNC.2011.6022514\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNC.2011.6022514","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The research about emergency logistics path optimization based on MAX - MIN ant colony algorithm
After disasters the emergency logistics distribution path selection problem is the key to the ways to ensure relief work go on wheels. In this article, MAX-MIN ant colony algorithm is used to solve the problem about post-disaster emergency logistics distribution path selection so that the emergency relief supplies will be sending to the disaster area more efficiently. The MAX - MIN ant colony algorithm, which has been proved by simulation, possesses advantage on solving the problem about post-disaster emergency logistics distribution path selection.