扩展grip - capacitated K-Means聚类算法在墨西哥大风险地区建立人道主义支持中心

IF 1 Q3 ENGINEERING, MULTIDISCIPLINARY
S. Caballero-Morales, Erika Barojas-Payán, Diana Sánchez-Partida, J. Martínez-Flores
{"title":"扩展grip - capacitated K-Means聚类算法在墨西哥大风险地区建立人道主义支持中心","authors":"S. Caballero-Morales, Erika Barojas-Payán, Diana Sánchez-Partida, J. Martínez-Flores","doi":"10.1155/2018/3605298","DOIUrl":null,"url":null,"abstract":"Mexico is located within the so-called Fire Belt which makes it susceptible to earthquakes. In fact, two-thirds of the Mexican territory have a significant seismic risk. On the other hand, the country’s location in the tropical zone makes it susceptible to hurricanes which are generated in both the Pacific and Atlantic Oceans. Due to these situations, each year many communities are affected by diverse natural disasters in Mexico and efficient logistic systems are required to provide prompt support. This work is aimed at providing an efficient metaheuristic to determine the most appropriate location for support centers in the State of Veracruz, which is one of the most affected regions in Mexico. The metaheuristic is based on the K-Means Clustering (KMC) algorithm which is extended to integrate (a) the associated capacity restrictions of the support centers, (b) a micro Genetic Algorithm μGA to estimate a search interval for the most suitable number of support centers, (c) variable number of assigned elements to centers in order to add flexibility to the assignation task, and (d) random-based decision model to further improve the final assignments. These extensions on the KMC algorithm led to the GRASP-Capacitated K-Means Clustering (GRASP-CKMC) algorithm which was able to provide very suitable solutions for the establishment of 260 support centers for 3837 communities at risk in Veracruz, Mexico. Validation of the GRASP-CKMC algorithm was performed with well-known test instances and metaheuristics. The validation supported its suitability as alternative to standard metaheuristics such as Capacitated K-Means (CKM), Genetic Algorithms (GA), and Variable Neighborhood Search (VNS).","PeriodicalId":42964,"journal":{"name":"Journal of Optimization","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2018-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Extended GRASP-Capacitated K-Means Clustering Algorithm to Establish Humanitarian Support Centers in Large Regions at Risk in Mexico\",\"authors\":\"S. Caballero-Morales, Erika Barojas-Payán, Diana Sánchez-Partida, J. Martínez-Flores\",\"doi\":\"10.1155/2018/3605298\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mexico is located within the so-called Fire Belt which makes it susceptible to earthquakes. In fact, two-thirds of the Mexican territory have a significant seismic risk. On the other hand, the country’s location in the tropical zone makes it susceptible to hurricanes which are generated in both the Pacific and Atlantic Oceans. Due to these situations, each year many communities are affected by diverse natural disasters in Mexico and efficient logistic systems are required to provide prompt support. This work is aimed at providing an efficient metaheuristic to determine the most appropriate location for support centers in the State of Veracruz, which is one of the most affected regions in Mexico. The metaheuristic is based on the K-Means Clustering (KMC) algorithm which is extended to integrate (a) the associated capacity restrictions of the support centers, (b) a micro Genetic Algorithm μGA to estimate a search interval for the most suitable number of support centers, (c) variable number of assigned elements to centers in order to add flexibility to the assignation task, and (d) random-based decision model to further improve the final assignments. These extensions on the KMC algorithm led to the GRASP-Capacitated K-Means Clustering (GRASP-CKMC) algorithm which was able to provide very suitable solutions for the establishment of 260 support centers for 3837 communities at risk in Veracruz, Mexico. Validation of the GRASP-CKMC algorithm was performed with well-known test instances and metaheuristics. The validation supported its suitability as alternative to standard metaheuristics such as Capacitated K-Means (CKM), Genetic Algorithms (GA), and Variable Neighborhood Search (VNS).\",\"PeriodicalId\":42964,\"journal\":{\"name\":\"Journal of Optimization\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2018-12-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Optimization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1155/2018/3605298\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"ENGINEERING, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1155/2018/3605298","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 13

摘要

墨西哥位于所谓的“火带”内,这使它容易受到地震的影响。事实上,墨西哥三分之二的领土都有严重的地震风险。另一方面,该国位于热带地区,容易受到太平洋和大西洋产生的飓风的影响。由于这些情况,墨西哥每年都有许多社区受到各种自然灾害的影响,需要高效的物流系统提供及时的支持。这项工作旨在提供一种有效的元启发式方法,以确定韦拉克鲁斯州支持中心的最合适位置,韦拉克鲁斯州是墨西哥受灾最严重的地区之一。元启发式算法是基于k -均值聚类(K-Means Clustering, KMC)算法,该算法扩展到综合(a)支持中心的相关容量限制,(b)微遗传算法μGA来估计最合适的支持中心数量的搜索区间,(c)分配给中心的元素数量可变,以增加分配任务的灵活性,(d)基于随机的决策模型来进一步改进最终的分配。这些对KMC算法的扩展导致了GRASP-Capacitated K-Means Clustering (GRASP-CKMC)算法,该算法能够为墨西哥韦拉克鲁斯州3837个面临风险的社区建立260个支持中心提供非常合适的解决方案。利用众所周知的测试实例和元启发式方法对GRASP-CKMC算法进行了验证。验证支持其作为标准元启发式方法(如Capacitated K-Means (CKM),遗传算法(GA)和可变邻域搜索(VNS))的替代方案的适用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Extended GRASP-Capacitated K-Means Clustering Algorithm to Establish Humanitarian Support Centers in Large Regions at Risk in Mexico
Mexico is located within the so-called Fire Belt which makes it susceptible to earthquakes. In fact, two-thirds of the Mexican territory have a significant seismic risk. On the other hand, the country’s location in the tropical zone makes it susceptible to hurricanes which are generated in both the Pacific and Atlantic Oceans. Due to these situations, each year many communities are affected by diverse natural disasters in Mexico and efficient logistic systems are required to provide prompt support. This work is aimed at providing an efficient metaheuristic to determine the most appropriate location for support centers in the State of Veracruz, which is one of the most affected regions in Mexico. The metaheuristic is based on the K-Means Clustering (KMC) algorithm which is extended to integrate (a) the associated capacity restrictions of the support centers, (b) a micro Genetic Algorithm μGA to estimate a search interval for the most suitable number of support centers, (c) variable number of assigned elements to centers in order to add flexibility to the assignation task, and (d) random-based decision model to further improve the final assignments. These extensions on the KMC algorithm led to the GRASP-Capacitated K-Means Clustering (GRASP-CKMC) algorithm which was able to provide very suitable solutions for the establishment of 260 support centers for 3837 communities at risk in Veracruz, Mexico. Validation of the GRASP-CKMC algorithm was performed with well-known test instances and metaheuristics. The validation supported its suitability as alternative to standard metaheuristics such as Capacitated K-Means (CKM), Genetic Algorithms (GA), and Variable Neighborhood Search (VNS).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Optimization
Journal of Optimization ENGINEERING, MULTIDISCIPLINARY-
自引率
0.00%
发文量
4
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信