Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

CP
2005
Springer

favoriteEmaildiscussreport

164views Artificial Intelligence» more CP 2005»

Bounds-Consistent Local Search

13 years 10 months ago

Bounds-Consistent Local Search

Download lia.deis.unibo.it

This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming which combines local search and bounds propagation, inspired by the success of a randomized algorithm for Boolean Satisﬁability (SAT) called Unit-Walk. A dynamic prioritization heuristic has been developed to improve the algorithm, inspired by another algorithm called Squeaky Wheel Optimization.

Stefania Verachi, Steven David Prestwich

Real-time Traffic

CP 2005 | Hybrid Algorithm | Large-scale Constraint Satisfaction | Programming Languages | Randomized Algorithm |

claim paper

Related Content

» A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint

» Finite Domain Bounds Consistency Revisited

» Disjoint Partition and Intersection Constraints for Set and Multiset Variables

» Dynamics of local search heuristics for the traveling salesman problem

» Evaluating a local genetic algorithm as contextindependent local search operator for metah...

» A Theoretical and Empirical Study of SearchBased Testing Local Global and Hybrid Search

» Complete Local Search with Memory

» On the Relative Merits of Simple Local Search Methods for the MAXSAT Problem

» An Empirical Study of Optimal Noise and Runtime Distributions in Local Search

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	CP
Authors	Stefania Verachi, Steven David Prestwich

Comments (0)