Abstract
Neighborhood specification is a dominant consideration in assuring the success of a direct search approach to a difficult combinatorial optimization problem. Previous research has shown the efficacy of imposing an elementary landscape upon the search topology. Barnes et al. [J.W. Barnes, S. Dokov, B. Dimova, A. Solomon, A theory of elementary landscapes, Applied Mathematics Letters 16 (2003)] generalize the notion of elementary landscapes to embrace arbitrary neighborhood digraphs. Stadler [P.F. Stadler, Landscapes and their correlation functions, Journal of Mathematical Chemistry 20 (1996)] shows, for the special case of symmetric-regular neighborhood digraphs, that the autocorrelation function associated with a smooth elementary landscape is consistent with an AR(1) time series. In this paper, we extend this idea to arbitrary neighborhood digraphs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
