Reinforcement learning-enhanced variable neighborhood search strategies for the k-clustering minimum biclique completion problem

IF 4.1 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Computers & Operations Research Pub Date : 2025-02-11 DOI:10.1016/j.cor.2025.107008
Juntao Zhao , Mhand Hifi
{"title":"Reinforcement learning-enhanced variable neighborhood search strategies for the k-clustering minimum biclique completion problem","authors":"Juntao Zhao ,&nbsp;Mhand Hifi","doi":"10.1016/j.cor.2025.107008","DOIUrl":null,"url":null,"abstract":"<div><div>In scenarios where different groups of users need to receive the same broadcast or in social media platforms where user interactions form distinct clusters, addressing the problems of minimizing communication channels or understanding user communities can be critical. These problems are modeled as the <span><math><mi>k</mi></math></span>-clustering minimum biclique completion problem, which is recognized as an NP-hard combinatorial optimization problem. This paper presents a novel approach to solving such a problem through reinforcement learning-enhanced variable neighborhood search. The proposed method features an innovative strategy based on probability learning. It integrates a range of neighborhood techniques with a tabu strategy to enable an exploration of the search space. A key aspect of the method is its implementation of a perturbation procedure through probability learning, which significantly enhances the iterative process by guiding the search towards previously unexplored and promising regions. Experimental evaluations on benchmark instances from existing literature highlight the method’s robustness and high competitiveness. The results reveal its superior performance compared to leading solvers such as Cplex and other recently published methods. Additionally, statistical analyses, including the sign test and the Wilcoxon signed-rank test, are conducted to determine the most effective approach among those tested. These analyses confirm that the method not only achieves new performance bounds but also shows its ability to deliver promising solutions.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"178 ","pages":"Article 107008"},"PeriodicalIF":4.1000,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S030505482500036X","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

In scenarios where different groups of users need to receive the same broadcast or in social media platforms where user interactions form distinct clusters, addressing the problems of minimizing communication channels or understanding user communities can be critical. These problems are modeled as the k-clustering minimum biclique completion problem, which is recognized as an NP-hard combinatorial optimization problem. This paper presents a novel approach to solving such a problem through reinforcement learning-enhanced variable neighborhood search. The proposed method features an innovative strategy based on probability learning. It integrates a range of neighborhood techniques with a tabu strategy to enable an exploration of the search space. A key aspect of the method is its implementation of a perturbation procedure through probability learning, which significantly enhances the iterative process by guiding the search towards previously unexplored and promising regions. Experimental evaluations on benchmark instances from existing literature highlight the method’s robustness and high competitiveness. The results reveal its superior performance compared to leading solvers such as Cplex and other recently published methods. Additionally, statistical analyses, including the sign test and the Wilcoxon signed-rank test, are conducted to determine the most effective approach among those tested. These analyses confirm that the method not only achieves new performance bounds but also shows its ability to deliver promising solutions.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约1分钟内获得全文 去求助
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
期刊最新文献
An interval two-stage robust stochastic programming under a bi-level multi-objective framework toward river basin water resources allocation Ship emission monitoring with a joint mode of motherships and unmanned aerial vehicles Logic-based Benders decomposition methods for the distributed permutation flow shop scheduling problem with production and transportation cost Scheduling moldable tasks on homogeneous multi-cluster platforms with GPUs Online order acceptance and scheduling in a single machine environment
×
引用
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