Efficient identification of improving moves in a ball for pseudo-boolean problems

@inproceedings{Chicano2014EfficientIO,
title={Efficient identification of improving moves in a ball for pseudo-boolean problems},
author={Francisco Chicano and L. Darrell Whitley and Andrew M. Sutton},
booktitle={GECCO},
year={2014}
}

Hill climbing algorithms are at the core of many approaches to solve optimization problems. Such algorithms usually require the complete enumeration of a neighborhood of the current solution. In the case of problems defined over binary strings of length n, we define the r-ball neighborhood as the set of solutions at Hamming distance r or less from the current solution. For r ll n this neighborhood contains Θ(nr) solutions. In this paper efficient methods areintroduced to locate improving moves… CONTINUE READING