Towards a formal specification of local search neighborhoods from a constraint satisfaction problem structure

Ślażyński, Mateusz; Abreu, Salvador; Nalepa, Grzegorz J.

doi:10.1145/3319619.3321968

Cited by 2 publications

(3 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…At the moment of writing, two research papers have been accepted for presentation on the international conferences. First one [30] is a short paper laying theoretical foundations for the future works. It formally presents the semantics and expressiveness of the NDL language, proving its capabilities with usage examples.…”

Section: Preliminary Results Accomplishedmentioning

confidence: 99%

Research Report on Automatic Synthesis of Local Search Neighborhood Operators

Ślażyński

2019

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

Constraint Programming (CP) and Local Search (LS) are different paradigms for dealing with combinatorial search and optimization problems. Their complementary features motivated researchers to create hybrid CP/LS solutions, maintaining both the modeling capabilities of CP and the computational advantages of the heuristic-based LS approach. Research presented in this report is focused on developing a novel method to infer an efficient LS neighborhood operator based on the problem structure, as modeled in the CP paradigm. We consider a limited formal language that we call a Neighborhood Definition Language, used to specify the neighborhood operators in a fine-grained and declarative manner. Together with Logic Programming runtime called Noodle, it allows to automatically synthesize complex operators using a Grammar Evolution algorithm.

show abstract

Section: Preliminary Results Accomplishedmentioning

confidence: 99%

Research Report on Automatic Synthesis of Local Search Neighborhood Operators

Ślażyński

2019

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

show abstract

“…This paper aims at filling this gap by presenting a system capable of inferring Local Search neighborhoods from a fine-grained problem representation consisting in an augmented Constraint Programming model. Section 3 shortly presents a Neighborhood Description Language [16] -a formalism designed to express neighborhood operators in a declarative manner along with a runtime environment. The rest of the paper is dedicated to synthesizing the aforementioned operators by means of a Grammar Evolution [14] algorithm applied on a Logic Programming DSL tailored to the given optimization problem.…”

Section: Introductionmentioning

confidence: 99%

“…Section 3 shortly presents a Neighborhood Description Language [16] -a formalism designed to express neighborhood operators in a declarative manner along with a runtime environment. The rest of the paper is dedicated to synthesizing the aforementioned operators by means of a Grammar Evolution [14] algorithm applied on a Logic Programming DSL tailored to the given optimization problem.…”

Section: Introductionmentioning

confidence: 99%

Generating Local Search Neighborhood with Synthesized Logic Programs

Ślażyński¹,

Abreu

Nalepa³

2019

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

Local Search meta-heuristics have been proven a viable approach to solve difficult optimization problems. Their performance depends strongly on the search space landscape, as defined by a cost function and the selected neighborhood operators. In this paper we present a logic programming based framework, named Noodle, designed to generate bespoke Local Search neighborhoods tailored to specific discrete optimization problems. The proposed system consists of a domain specific language, which is inspired by logic programming, as well as a genetic programming solver, based on the grammar evolution algorithm. We complement the description with a preliminary experimental evaluation, where we synthesize efficient neighborhood operators for the traveling salesman problem, some of which reproduce well-known results.

show abstract

Towards a formal specification of local search neighborhoods from a constraint satisfaction problem structure

Cited by 2 publications

References 2 publications

Research Report on Automatic Synthesis of Local Search Neighborhood Operators

Research Report on Automatic Synthesis of Local Search Neighborhood Operators

Generating Local Search Neighborhood with Synthesized Logic Programs

Contact Info

Product

Resources

About