Please use this identifier to cite or link to this item:

Title: Towards a formal specification of local search neighborhoods from a constraint satisfaction problem structure
Authors: Mateusz, Ślażyński
Salvador, Abreu
Grzegorz, Nalepa
Editors: López-Ibáñez, Manuel
Issue Date: Jul-2019
Publisher: ACM
Citation: Mateusz Ślażyński, Salvador Abreu, and Grzegorz J. Nalepa. 2019. Towards a formal specification of local search neighborhoods from a constraint satisfaction problem structure. In Proceedings of the Genetic and Evolutionary Computation Conference Companion (GECCO '19), Manuel López-Ibáñez (Ed.). ACM, New York, NY, USA, 137-138. DOI:
Abstract: Neighborhood operators play a crucial role in defining effective Local Search solvers, allowing one to limit the explored search space and prune the fitness landscape. Still, there is no accepted formal representation of such operators: they are usually modeled as algorithms in procedural language, lacking in compositionality and readability. In this paper we outline a new formalization capable of representing several neighborhood operators eschewing their coding in a full Turing complete language. The expressiveness of our proposal stems from a rich problem representation, as used in Constraint Programming models. We compare our system to competing approaches and show a clear increment in expressiveness.
Type: article
Appears in Collections:LISP - Artigos em Livros de Actas/Proceedings

Files in This Item:

File Description SizeFormat
p137-slazynski.pdf378.46 kBAdobe PDFView/OpenRestrict Access. You can Request a copy!
FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpaceOrkut
Formato BibTex mendeley Endnote Logotipo do DeGóis 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Dspace Dspace
DSpace Software, version 1.6.2 Copyright © 2002-2008 MIT and Hewlett-Packard - Feedback
UEvora B-On Curriculum DeGois