Combining Reinforcement Learning and Configuration Checking for Maximum k-plex Problem

06/06/2019
by   Peilin Chen, et al.
0

The Maximum k-plex Problem is an important combinatorial optimization problem with increasingly wide applications. Due to its exponential time complexity, many heuristic methods have been proposed which can return a good-quality solution in a reasonable time. However, most of the heuristic algorithms are memoryless and unable to utilize the experience during the search. Inspired by the multi-armed bandit (MAB) problem in reinforcement learning (RL), we propose a novel perturbation mechanism named BLP, which can learn online to select a good vertex for perturbation when getting stuck in local optima. To our best of knowledge, this is the first attempt to combine local search with RL for the maximum k -plex problem. Besides, we also propose a novel strategy, named Dynamic-threshold Configuration Checking (DTCC), which extends the original Configuration Checking (CC) strategy from two aspects. Based on the BLP and DTCC, we develop a local search algorithm named BDCC and improve it by a hyperheuristic strategy. The experimental result shows that our algorithms dominate on the standard DIMACS and BHOSLIB benchmarks and achieve state-of-the-art performance on massive graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/22/2018

Advancing Tabu and Restart in Local Search for Maximum Weight Cliques

The tabu and restart are two fundamental strategies for local search. In...
research
02/15/2017

Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function

The Minimum Weight Dominating Set (MWDS) problem is an important general...
research
01/14/2022

BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit

We address Partial MaxSAT (PMS) and Weighted PMS (WPMS), two practical g...
research
11/29/2022

Incorporating Multi-armed Bandit with Local Search for MaxSAT

Partial MaxSAT (PMS) and Weighted PMS (WPMS) are two practical generaliz...
research
07/08/2022

Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problems

TSP is a classical NP-hard combinatorial optimization problem with many ...
research
01/16/2014

Efficient Multi-Start Strategies for Local Search Algorithms

Local search algorithms applied to optimization problems often suffer fr...
research
05/12/2017

A Formal Characterization of the Local Search Topology of the Gap Heuristic

The pancake puzzle is a classic optimization problem that has become a s...

Please sign up or login with your details

Forgot password? Click here to reset