{"title":"A heuristic for the non-unicost set covering problem using local branching","authors":"J.E. Beasley","doi":"10.1111/itor.13446","DOIUrl":null,"url":null,"abstract":"<p>In this paper, we present a heuristic for the non-unicost set covering problem using local branching. Local branching eliminates the need to define a problem specific search neighbourhood for any particular (zero-one) optimisation problem. It does this by incorporating a generalised Hamming distance neighbourhood into the problem, and this leads naturally to an appropriate neighbourhood search procedure. We apply our approach to the non-unicost set covering problem. Computational results are presented for 65 test problems that have been widely considered in the literature. Our results indicate that our heuristic is better than six of the eight other heuristics we examined, slightly worse than that of one heuristic, but that there is a single heuristic that outperforms all others. We believe that the work described here illustrates that the potential for using local branching, operating as a stand-alone matheuristic, has not been fully exploited in the literature.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"31 5","pages":"2807-2825"},"PeriodicalIF":3.1000,"publicationDate":"2024-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Transactions in Operational Research","FirstCategoryId":"91","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1111/itor.13446","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MANAGEMENT","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we present a heuristic for the non-unicost set covering problem using local branching. Local branching eliminates the need to define a problem specific search neighbourhood for any particular (zero-one) optimisation problem. It does this by incorporating a generalised Hamming distance neighbourhood into the problem, and this leads naturally to an appropriate neighbourhood search procedure. We apply our approach to the non-unicost set covering problem. Computational results are presented for 65 test problems that have been widely considered in the literature. Our results indicate that our heuristic is better than six of the eight other heuristics we examined, slightly worse than that of one heuristic, but that there is a single heuristic that outperforms all others. We believe that the work described here illustrates that the potential for using local branching, operating as a stand-alone matheuristic, has not been fully exploited in the literature.
期刊介绍：
International Transactions in Operational Research (ITOR) aims to advance the understanding and practice of Operational Research (OR) and Management Science internationally. Its scope includes:
International problems, such as those of fisheries management, environmental issues, and global competitiveness
International work done by major OR figures
Studies of worldwide interest from nations with emerging OR communities
National or regional OR work which has the potential for application in other nations
Technical developments of international interest
Specific organizational examples that can be applied in other countries
National and international presentations of transnational interest
Broadly relevant professional issues, such as those of ethics and practice
Applications relevant to global industries, such as operations management, manufacturing, and logistics.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
