Kangaroo: an efficient constraint-based local search system using lazy propagation

Authors:
M. A. Hakim Newton;Duc Nghia Pham;Abdul Sattar;Michael Maher
Affiliations:
National ICT Australia Ltd. and Institute for Integrated and Intelligent Systems, Griffith University;National ICT Australia Ltd. and Institute for Integrated and Intelligent Systems, Griffith University;National ICT Australia Ltd. and Institute for Integrated and Intelligent Systems, Griffith University;National ICT Australia Ltd. and School of Computer Science and Engineering, University of New South Wales and Reasoning Research Institute, Sydney
Venue:
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Year:
2011

Citing 12
Cited 1

Incremental attribute evaluation: a flexible algorithm for lazy update

ACM Transactions on Programming Languages and Systems (TOPLAS)
Incremental evaluation of computational circuits

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Using global constraints for local search

DIMACS workshop on on Constraint programming and large scale discrete optimization
Localizer

Constraints
iOpt: A Software Toolkit for Heuristic Search Methods

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
EasyLocal++: an object-oriented framework for the flexible design of local-search algorithms

Software—Practice & Experience
Control Abstractions for Local Search

Constraints
Constraint-Based Local Search

Constraint-Based Local Search
Building structure into local search for SAT

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Constraint-based local search for the automatic generation of architectural tests

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Differentiable invariants

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Constraint-Based local search for constrained optimum paths problems

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Constraint propagation as the core of local search

SETN'12 Proceedings of the 7th Hellenic conference on Artificial Intelligence: theories and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce Kangaroo, a constraint-based local search system. While existing systems such as Comet maintain invariants after every move, Kangaroo adopts a lazy strategy, updating invariants only when they are needed. Our empirical evaluation shows that Kangaroo consistently has a smaller memory footprint than Comet, and is usually significantly faster.