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

09/22/2017
by   Jialong Shi, et al.
0

Local search is a basic building block in memetic algorithms. Guided Local Search (GLS) can improve the efficiency of local search. By changing the guide function, GLS guides a local search to escape from locally optimal solutions and find better solutions. The key component of GLS is its penalizing mechanism which determines which feature is selected to penalize when the search is trapped in a locally optimal solution. The original GLS penalizing mechanism only makes use of the cost and the current penalty value of each feature. It is well known that many combinatorial optimization problems have a big valley structure, i.e., the better a solution is, the more the chance it is closer to a globally optimal solution. This paper proposes to use big valley structure assumption to improve the GLS penalizing mechanism. An improved GLS algorithm called Elite Biased GLS (EB-GLS) is proposed. EB-GLS records and maintains an elite solution as an estimate of the globally optimal solutions, and reduces the chance of penalizing the features in this solution. We have systematically tested the proposed algorithm on the symmetric traveling salesman problem. Experimental results show that EB-GLS is significantly better than GLS.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/02/2020

Approximation Guarantees of Local Search Algorithms via Localizability of Set Functions

This paper proposes a new framework for providing approximation guarante...
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
10/19/2017

Protein Folding Optimization using Differential Evolution Extended with Local Search and Component Reinitialization

This paper presents a novel differential evolution algorithm for protein...
research
06/27/2022

Learning to Control Local Search for Combinatorial Optimization

Combinatorial optimization problems are encountered in many practical co...
research
02/08/2018

Peekaboo - Where are the Objects? Structure Adjusting Superpixels

This paper addresses the search for a fast and meaningful image segmenta...
research
06/03/2021

Linear regression with partially mismatched data: local search with theoretical guarantees

Linear regression is a fundamental modeling tool in statistics and relat...
research
06/07/2012

An Efficient Hybrid Ant Colony System for the Generalized Traveling Salesman Problem

The Generalized Traveling Salesman Problem (GTSP) is an extension of the...

Please sign up or login with your details

Forgot password? Click here to reset