An Algorithm to Effect Prompt Termination of Myopic Local Search on Kauffman-s NK Landscape

04/26/2021
by   Sasanka Sekhar Chanda, et al.
18

In the NK model given by Kauffman, myopic local search involves flipping one randomly-chosen bit of an N-bit decision string in every time step and accepting the new configuration if that has higher fitness. One issue is that, this algorithm consumes the full extent of computational resources allocated - given by the number of alternative configurations inspected - even though search is expected to terminate the moment there are no neighbors having higher fitness. Otherwise, the algorithm must compute the fitness of all N neighbors in every time step, consuming a high amount of resources. In order to get around this problem, I describe an algorithm that allows search to logically terminate relatively early, without having to evaluate fitness of all N neighbors at every time step. I further suggest that when the efficacy of two algorithms need to be compared head to head, imposing a common limit on the number of alternatives evaluated - metering - provides the necessary level field.

READ FULL TEXT

page 6

page 7

page 8

page 9

research
10/15/2012

Local optima networks and the performance of iterated local search

Local Optima Networks (LONs) have been recently proposed as an alternati...
research
06/06/2020

An Algorithm to find Superior Fitness on NK Landscapes under High Complexity: Muddling Through

Under high complexity - given by pervasive interdependence between const...
research
07/02/2019

Representing fitness landscapes by valued constraints to understand the complexity of local search

Local search is widely used to solve combinatorial optimisation problems...
research
12/28/2020

A Comprehensive Empirical Evaluation of Generating Test Suites for Mobile Applications with Diversity

Context: In search-based software engineering we often use popular heuri...
research
05/10/2021

Overcoming Complexity Catastrophe: An Algorithm for Beneficial Far-Reaching Adaptation under High Complexity

In his seminal work with NK algorithms, Kauffman noted that fitness outc...
research
08/04/2022

HPO: We won't get fooled again

Hyperparameter optimization (HPO) is a well-studied research field. Howe...
research
06/19/2019

Does Diversity Improve the Test Suite Generation for Mobile Applications?

In search-based software engineering we often use popular heuristics wit...

Please sign up or login with your details

Forgot password? Click here to reset