Sara Ceschia, Luca Di Gaspero, Roberto Maria Rosati, Andrea Schaerf
{"title":"最小干扰频率分配问题的多邻域模拟退火","authors":"Sara Ceschia, Luca Di Gaspero, Roberto Maria Rosati, Andrea Schaerf","doi":"10.1016/j.ejco.2021.100024","DOIUrl":null,"url":null,"abstract":"<div><p>We consider the Minimum Interference Frequency Assignment Problem and we propose a novel Simulated Annealing approach that makes use of a portfolio of different neighborhoods, specifically designed for this problem.</p><p>We undertake at once the two versions of the problem proposed by Correia (2001) and by Montemanni et al. (2001), respectively, and the corresponding benchmark instances. With the aim of determining the best configuration of the solver for the specific version of the problem we perform a comprehensive and statistically-principled tuning procedure.</p><p>Even tough a totally precise comparison is not possible, the experimental analysis show that we outperform all previous results on most instances for the first version of the problem, and we are at the same level of the best ones for the second version.</p><p>As a byproduct of this research, we designed a new robust file format for instances and solutions, and a data repository for validating and maintaining the available solutions.</p></div>","PeriodicalId":51880,"journal":{"name":"EURO Journal on Computational Optimization","volume":"10 ","pages":"Article 100024"},"PeriodicalIF":2.6000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192440621001519/pdfft?md5=bd15ad8aa76d9ff1c05a75649a88a79a&pid=1-s2.0-S2192440621001519-main.pdf","citationCount":"3","resultStr":"{\"title\":\"Multi-Neighborhood simulated annealing for the minimum interference frequency assignment problem\",\"authors\":\"Sara Ceschia, Luca Di Gaspero, Roberto Maria Rosati, Andrea Schaerf\",\"doi\":\"10.1016/j.ejco.2021.100024\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We consider the Minimum Interference Frequency Assignment Problem and we propose a novel Simulated Annealing approach that makes use of a portfolio of different neighborhoods, specifically designed for this problem.</p><p>We undertake at once the two versions of the problem proposed by Correia (2001) and by Montemanni et al. (2001), respectively, and the corresponding benchmark instances. With the aim of determining the best configuration of the solver for the specific version of the problem we perform a comprehensive and statistically-principled tuning procedure.</p><p>Even tough a totally precise comparison is not possible, the experimental analysis show that we outperform all previous results on most instances for the first version of the problem, and we are at the same level of the best ones for the second version.</p><p>As a byproduct of this research, we designed a new robust file format for instances and solutions, and a data repository for validating and maintaining the available solutions.</p></div>\",\"PeriodicalId\":51880,\"journal\":{\"name\":\"EURO Journal on Computational Optimization\",\"volume\":\"10 \",\"pages\":\"Article 100024\"},\"PeriodicalIF\":2.6000,\"publicationDate\":\"2022-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S2192440621001519/pdfft?md5=bd15ad8aa76d9ff1c05a75649a88a79a&pid=1-s2.0-S2192440621001519-main.pdf\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"EURO Journal on Computational Optimization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2192440621001519\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"EURO Journal on Computational Optimization","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2192440621001519","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 3
摘要
我们考虑了最小干扰频率分配问题，并提出了一种新的模拟退火方法，该方法利用了专门为该问题设计的不同邻域组合。我们立即分别对Correia(2001)和Montemanni et al.(2001)提出的两个版本的问题，以及相应的基准实例进行研究。为了确定问题的特定版本的求解器的最佳配置，我们执行了一个全面的、符合统计原则的调优过程。即使完全精确的比较是不可能的，实验分析表明，在大多数情况下，我们在第一个版本的问题上优于所有以前的结果，并且我们在第二个版本的最佳水平上。作为这项研究的副产品，我们为实例和解决方案设计了一种新的健壮的文件格式，并为验证和维护可用的解决方案设计了一个数据存储库。
Multi-Neighborhood simulated annealing for the minimum interference frequency assignment problem
We consider the Minimum Interference Frequency Assignment Problem and we propose a novel Simulated Annealing approach that makes use of a portfolio of different neighborhoods, specifically designed for this problem.
We undertake at once the two versions of the problem proposed by Correia (2001) and by Montemanni et al. (2001), respectively, and the corresponding benchmark instances. With the aim of determining the best configuration of the solver for the specific version of the problem we perform a comprehensive and statistically-principled tuning procedure.
Even tough a totally precise comparison is not possible, the experimental analysis show that we outperform all previous results on most instances for the first version of the problem, and we are at the same level of the best ones for the second version.
As a byproduct of this research, we designed a new robust file format for instances and solutions, and a data repository for validating and maintaining the available solutions.
期刊介绍：
The aim of this journal is to contribute to the many areas in which Operations Research and Computer Science are tightly connected with each other. More precisely, the common element in all contributions to this journal is the use of computers for the solution of optimization problems. Both methodological contributions and innovative applications are considered, but validation through convincing computational experiments is desirable. The journal publishes three types of articles (i) research articles, (ii) tutorials, and (iii) surveys. A research article presents original methodological contributions. A tutorial provides an introduction to an advanced topic designed to ease the use of the relevant methodology. A survey provides a wide overview of a given subject by summarizing and organizing research results.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
