Improving the performance of stochastic local search for maximum vertex weight clique problem using programming by optimization

The maximum vertex weight clique problem (MVWCP) is an important generalization of the maximum clique problem (MCP) that has a wide range of real-world applications. In situations where rigorous guarantees regarding the optimality of solutions are not required, MVWCP is usually solved using stochast...

Full description

Saved in:

Bibliographic Details
Published in:	Expert systems with applications Vol. 213; p. 118913
Main Authors:	Chu, Yi, Luo, Chuan, Hoos, Holger H., You, Haihang
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.03.2023
Subjects:	Maximum clique problem Programming by optimization Stochastic local search Stochastic local search Programming by optimization Maximum clique problem
ISSN:	0957-4174, 1873-6793
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	The maximum vertex weight clique problem (MVWCP) is an important generalization of the maximum clique problem (MCP) that has a wide range of real-world applications. In situations where rigorous guarantees regarding the optimality of solutions are not required, MVWCP is usually solved using stochastic local search (SLS) algorithms, which also define the state of the art for solving this problem. However, there is no single SLS algorithm that gives the best performance across all classes of MVWCP instances, and it is challenging to effectively identify the most suitable algorithm for each class of MVWCP instances. In this work, we follow the paradigm of Programming by Optimization (PbO) to develop a new, flexible and highly parametric SLS framework for solving MVWCP, combining, for the first time, a broad range of effective heuristic mechanisms. By automatically configuring this PbO-MWC framework, we achieve substantial advances in the state of the art in solving MVWCP over a broad range of prominent benchmarks, including two derived from real-world applications in transplantation medicine (kidney exchange) and assessment of research excellence. •A highly parametric local search framework for maximum weight clique problem.•Automatically configuring this framework.•Achieve substantial advances over many prominent benchmarks.•Suggesting effectiveness of heuristic mechanisms on different benchmarks.
ISSN:	0957-4174 1873-6793
DOI:	10.1016/j.eswa.2022.118913