Towards more efficient local search for weighted graph coloring problem in massive graphs

IF 4.1 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Shiwei Pan , Yujiao Zhao , Jiangnan Li, Yiyuan Wang, Ye Zhang, Wenbo Zhou, Minghao Yin
{"title":"Towards more efficient local search for weighted graph coloring problem in massive graphs","authors":"Shiwei Pan ,&nbsp;Yujiao Zhao ,&nbsp;Jiangnan Li,&nbsp;Yiyuan Wang,&nbsp;Ye Zhang,&nbsp;Wenbo Zhou,&nbsp;Minghao Yin","doi":"10.1016/j.cor.2025.107031","DOIUrl":null,"url":null,"abstract":"<div><div>The weighted graph coloring problem (WGCP) is a well-known NP-hard combinatorial optimization problem with various practical applications. Due to its theoretical significance and practical relevance, numerous algorithms have been developed to address the WGCP. In the past, both exact and heuristic algorithms have primarily focused on solving classic benchmarks, with relatively few efforts dedicated to tackling the challenges posed by massive WGCP real-world applications. In our work, we propose an effective local search algorithm for the WGCP based on three main ideas. First, we introduce a new variant of configuration checking to escape from local optima. Second, we devise a novel method for selecting vertex movements that guides the search towards more favorable directions. Third, we propose a novel deep optimization strategy to perturb the solution. Extensive experiments demonstrate that our proposed algorithm outperforms several state-of-the-art algorithms on both classic and massive benchmarks. This indicates the effectiveness and superiority of our approach in solving the WGCP.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"179 ","pages":"Article 107031"},"PeriodicalIF":4.1000,"publicationDate":"2025-02-27","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/S0305054825000590","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

The weighted graph coloring problem (WGCP) is a well-known NP-hard combinatorial optimization problem with various practical applications. Due to its theoretical significance and practical relevance, numerous algorithms have been developed to address the WGCP. In the past, both exact and heuristic algorithms have primarily focused on solving classic benchmarks, with relatively few efforts dedicated to tackling the challenges posed by massive WGCP real-world applications. In our work, we propose an effective local search algorithm for the WGCP based on three main ideas. First, we introduce a new variant of configuration checking to escape from local optima. Second, we devise a novel method for selecting vertex movements that guides the search towards more favorable directions. Third, we propose a novel deep optimization strategy to perturb the solution. Extensive experiments demonstrate that our proposed algorithm outperforms several state-of-the-art algorithms on both classic and massive benchmarks. This indicates the effectiveness and superiority of our approach in solving the WGCP.
求助全文
约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.
×
引用
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学术官方微信