The Neighbours' Similar Fitness Property for Local Search

01/09/2020
by   Mark Wallace, et al.
0

For most practical optimisation problems local search outperforms random sampling - despite the "No Free Lunch Theorem". This paper introduces a property of search landscapes termed Neighbours' Similar Fitness (NSF) that underlies the good performance of neighbourhood search in terms of local improvement. Though necessary, NSF is not sufficient to ensure that searching for improvement among the neighbours of a good solution is better than random search. The paper introduces an additional (natural) property which supports a general proof that, for NSF landscapes, neighbourhood search beats random search.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/18/2012

NILS: a Neutrality-based Iterated Local Search and its application to Flowshop Scheduling

This paper presents a new methodology that exploits specific characteris...
research
12/05/2019

Is perturbation an effective restart strategy?

Premature convergence can be detrimental to the performance of search me...
research
10/17/2021

Minimal Conditions for Beneficial Local Search

This paper investigates why it is beneficial, when solving a problem, to...
research
07/10/2023

Can You Improve My Code? Optimizing Programs with Local Search

This paper introduces a local search method for improving an existing pr...
research
07/19/2012

On the Effect of Connectedness for Biobjective Multiple and Long Path Problems

Recently, the property of connectedness has been claimed to give a stron...
research
01/12/2013

BliStr: The Blind Strategymaker

BliStr is a system that automatically develops strategies for E prover o...
research
11/24/2022

Theoretical Study of Optimizing Rugged Landscapes with the cGA

Estimation of distribution algorithms (EDAs) provide a distribution - ba...

Please sign up or login with your details

Forgot password? Click here to reset