Control abstractions for local search

DOI10.1007/S10601-005-0553-XMaRDI QIDQ816678zbMATH OpenOpenAlexFDO

Authors Laurent Michel, Pascal Van Hentenryck

Publication date 23 February 2006

Published in Constraints (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10601-005-0553-x

zbMATH Keywords

heuristiclocal searchcontrolconstraintsearchabstractionneighborhoodmeta-heuristicincremental

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Searching and sorting (68P10)

Recommendations

• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Parallel and distributed local search in COMET
• Parallel Local Search in Comet
• Contraint-based combinators for local search
• Principles and Practice of Constraint Programming – CP 2004

Cites work

• scientific article; zbMATH DE number 1082108 (Why is no real title available?)
• scientific article; zbMATH DE number 2083802 (Why is no real title available?)
• A Fast Taboo Search Algorithm for the Job Shop Problem
• A decomposition-based implementation of search strategies
• A general approach for constraint solving by local search
• An Efficient Heuristic Procedure for Partitioning Graphs
• Applying tabu search to the job-shop scheduling problem
• Constraint-based agents. An architecture for constraint-based modeling and local-search-based reasoning for planning and scheduling in open and dynamic worlds
• Control abstractions for local search
• Guided local search with shifting bottleneck for job shop scheduling
• Improved local search for CP toolkits
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Localizer
• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Optimization software class libraries
• SALSA: a language for search algorithms
• Solving vehicle routing problems using constraint programming and metaheuristics

Cited in

(6)

• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings
• A branch‐and‐price approach to k‐clustering minimum biclique completion problem
• Contraint-based combinators for local search
• Nondeterministic control for hybrid search
• Control abstractions for local search

Describes a project that uses

Uses Software

• Localizer
• EasyLocal++
• COMET
• SALSA

This page was built for publication: Control abstractions for local search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q816678)