一种求解模糊最大覆盖定位问题的种群算法

Méziane Aïder, Imene Dey, M. Hifi
{"title":"一种求解模糊最大覆盖定位问题的种群算法","authors":"Méziane Aïder, Imene Dey, M. Hifi","doi":"10.1109/ISCMI56532.2022.10068459","DOIUrl":null,"url":null,"abstract":"In this paper, we investigate the use of a population-based algorithm for tackling the fuzzy capacitated maximal covering location problem. Such a problem is characterized by a set of customers with their distances and its goal is to determine a subset of locations positioned on customers such that a maximum coverage of customers, including the both fuzzy coverage degree of facilities and the distance between customers, should be optimized. The proposed method is based upon the grey wolf optimizer, which starts by generating an initial population using a greedy rule strategy that is able to achieve feasible solutions according to the current positions of wolves. In order to enhance the quality of solutions induced, a series of local searches are added for exploring the search space by exploiting some nice strategies. The behavior of the method is computationally analyzed on a set of instances of the literature. Encouraging results have been provided.","PeriodicalId":340397,"journal":{"name":"2022 9th International Conference on Soft Computing & Machine Intelligence (ISCMI)","volume":"171 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Population-Based Algorithm for Solving the Fuzzy Capacitated Maximal Covering Location Problem\",\"authors\":\"Méziane Aïder, Imene Dey, M. Hifi\",\"doi\":\"10.1109/ISCMI56532.2022.10068459\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we investigate the use of a population-based algorithm for tackling the fuzzy capacitated maximal covering location problem. Such a problem is characterized by a set of customers with their distances and its goal is to determine a subset of locations positioned on customers such that a maximum coverage of customers, including the both fuzzy coverage degree of facilities and the distance between customers, should be optimized. The proposed method is based upon the grey wolf optimizer, which starts by generating an initial population using a greedy rule strategy that is able to achieve feasible solutions according to the current positions of wolves. In order to enhance the quality of solutions induced, a series of local searches are added for exploring the search space by exploiting some nice strategies. The behavior of the method is computationally analyzed on a set of instances of the literature. Encouraging results have been provided.\",\"PeriodicalId\":340397,\"journal\":{\"name\":\"2022 9th International Conference on Soft Computing & Machine Intelligence (ISCMI)\",\"volume\":\"171 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-11-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 9th International Conference on Soft Computing & Machine Intelligence (ISCMI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCMI56532.2022.10068459\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 9th International Conference on Soft Computing & Machine Intelligence (ISCMI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCMI56532.2022.10068459","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们研究了一种基于种群的算法来解决模糊最大覆盖定位问题。该问题的特征是一组客户及其距离,其目标是确定客户位置的子集,使客户的最大覆盖范围,包括设施的模糊覆盖程度和客户之间的距离。提出的方法基于灰狼优化器,首先使用贪婪规则策略生成初始种群,该策略能够根据狼的当前位置获得可行解。为了提高归纳出的解的质量,通过利用一些好的策略,增加了一系列局部搜索来探索搜索空间。在一组文献实例上对该方法的行为进行了计算分析。已经取得了令人鼓舞的成果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Population-Based Algorithm for Solving the Fuzzy Capacitated Maximal Covering Location Problem
In this paper, we investigate the use of a population-based algorithm for tackling the fuzzy capacitated maximal covering location problem. Such a problem is characterized by a set of customers with their distances and its goal is to determine a subset of locations positioned on customers such that a maximum coverage of customers, including the both fuzzy coverage degree of facilities and the distance between customers, should be optimized. The proposed method is based upon the grey wolf optimizer, which starts by generating an initial population using a greedy rule strategy that is able to achieve feasible solutions according to the current positions of wolves. In order to enhance the quality of solutions induced, a series of local searches are added for exploring the search space by exploiting some nice strategies. The behavior of the method is computationally analyzed on a set of instances of the literature. Encouraging results have been provided.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Hybrid Gain-Ant Colony Algorithm for Green Vehicle Routing Problem Fake News Detection Using Deep Learning and Natural Language Processing Optimizing Speed and Accuracy Trade-off in Machine Learning Models via Stochastic Gradient Descent Approximation Modeling and Optimization of Two-Chamber Muffler by Genetic Algorithm A Novel Approach for Federated Learning with Non-IID Data
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1