针对 p 中值问题的具有替代嵌入式局部搜索方案的混合算法

IF 1 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS
Natalya Rezova, Lev Kazakovtsev, I. Rozhnov, P. Stanimirović, Guzel Shkaberina
{"title":"针对 p 中值问题的具有替代嵌入式局部搜索方案的混合算法","authors":"Natalya Rezova, Lev Kazakovtsev, I. Rozhnov, P. Stanimirović, Guzel Shkaberina","doi":"10.59035/ntbo2860","DOIUrl":null,"url":null,"abstract":"Progress in the development of location theory and clustering methods is mainly aimed at improving the performance of algorithms. We study the continuous p-median problem with the Euclidean metric. Various algorithmic combinations of the ALA procedure embedded into more sophisticated algorithmic combinations are used. Two repeated steps of the ALA algorithm solve the simplest discrete optimization problem, and then a series of central point search problems (Weber problem) for each cluster. A parallel implementation of the ALA algorithm is used. The paper studies the issue of choosing from two strategies: solve the Weber problem until accuracy ε is achieved at each iteration, or perform only one iteration of the Weiszfeld algorithm at each ALA iteration.","PeriodicalId":42317,"journal":{"name":"International Journal on Information Technologies and Security","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Hybrid algorithms with alternative embedded local search schemes for the p-median problem\",\"authors\":\"Natalya Rezova, Lev Kazakovtsev, I. Rozhnov, P. Stanimirović, Guzel Shkaberina\",\"doi\":\"10.59035/ntbo2860\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Progress in the development of location theory and clustering methods is mainly aimed at improving the performance of algorithms. We study the continuous p-median problem with the Euclidean metric. Various algorithmic combinations of the ALA procedure embedded into more sophisticated algorithmic combinations are used. Two repeated steps of the ALA algorithm solve the simplest discrete optimization problem, and then a series of central point search problems (Weber problem) for each cluster. A parallel implementation of the ALA algorithm is used. The paper studies the issue of choosing from two strategies: solve the Weber problem until accuracy ε is achieved at each iteration, or perform only one iteration of the Weiszfeld algorithm at each ALA iteration.\",\"PeriodicalId\":42317,\"journal\":{\"name\":\"International Journal on Information Technologies and Security\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2023-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal on Information Technologies and Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.59035/ntbo2860\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal on Information Technologies and Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.59035/ntbo2860","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

定位理论和聚类方法的发展主要是为了提高算法的性能。我们用欧几里德度规研究了连续p中值问题。ALA程序的各种算法组合嵌入到更复杂的算法组合中。ALA算法的两个重复步骤解决最简单的离散优化问题,然后为每个聚类解决一系列中心点搜索问题(韦伯问题)。采用了ALA算法的并行实现。本文研究了两种策略的选择问题:在每次迭代中求解Weber问题直到精度达到ε,或者在每次ALA迭代中只执行一次Weiszfeld算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Hybrid algorithms with alternative embedded local search schemes for the p-median problem
Progress in the development of location theory and clustering methods is mainly aimed at improving the performance of algorithms. We study the continuous p-median problem with the Euclidean metric. Various algorithmic combinations of the ALA procedure embedded into more sophisticated algorithmic combinations are used. Two repeated steps of the ALA algorithm solve the simplest discrete optimization problem, and then a series of central point search problems (Weber problem) for each cluster. A parallel implementation of the ALA algorithm is used. The paper studies the issue of choosing from two strategies: solve the Weber problem until accuracy ε is achieved at each iteration, or perform only one iteration of the Weiszfeld algorithm at each ALA iteration.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
66.70%
发文量
0
×
引用
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学术官方微信