Learning to Control Local Search for Combinatorial Optimization

06/27/2022
by   Jonas K. Falkner, et al.
0

Combinatorial optimization problems are encountered in many practical contexts such as logistics and production, but exact solutions are particularly difficult to find and usually NP-hard for considerable problem sizes. To compute approximate solutions, a zoo of generic as well as problem-specific variants of local search is commonly used. However, which variant to apply to which particular problem is difficult to decide even for experts. In this paper we identify three independent algorithmic aspects of such local search algorithms and formalize their sequential selection over an optimization process as Markov Decision Process (MDP). We design a deep graph neural network as policy model for this MDP, yielding a learned controller for local search called NeuroLS. Ample experimental evidence shows that NeuroLS is able to outperform both, well-known general purpose local search controllers from Operations Research as well as latest machine learning-based approaches.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/07/2012

Design, Evaluation and Analysis of Combinatorial Optimization Heuristic Algorithms

Combinatorial optimization is widely applied in a number of areas nowada...
research
10/19/2019

A Memetic Algorithm Based on Breakout Local Search for the Generalized Travelling Salesman Problem

The Travelling Salesman Problem (TSP) is one of the most popular Combina...
research
04/11/2023

RELS-DQN: A Robust and Efficient Local Search Framework for Combinatorial Optimization

Combinatorial optimization (CO) aims to efficiently find the best soluti...
research
09/09/2022

Neural Networks for Local Search and Crossover in Vehicle Routing: A Possible Overkill?

Extensive research has been conducted, over recent years, on various way...
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
04/01/2016

Reinforcement learning based local search for grouping problems: A case study on graph coloring

Grouping problems aim to partition a set of items into multiple mutually...
research
09/22/2017

EB-GLS: An Improved Guided Local Search Based on the Big Valley Structure

Local search is a basic building block in memetic algorithms. Guided Loc...

Please sign up or login with your details

Forgot password? Click here to reset