Finding the Right Hybrid Algorithm – A Combinatorial Meta-Problem

Benchmark comparisons tend to overlook the most important challenge in solving combinatorial problems: how to design an appropriate algorithm. For example, an early version of Localizer incurred a factor 3 performance penalty when benchmarked against a ‘C’ implementation of GSAT, but we would recommend implementing a new local search algorithm in Localizer rather than ‘C’ every time. The ECLiPSe CLP language supports the experimental process of seeking the right hybrid algorithm for the problem at hand. It offers high-level modelling and control features, extensibility and a wide range of constraint solvers which can cooperate in the solving of a problem. We recently sought a new hybrid algorithm for a very unpromising class (SAT problems), and using ECLiPSe we were able to develop an algorithm which showed good performance on some very hard instances. We describe the process of exploring the space of hybrid algorithms for the problem class, and indicate the features of ECLiPSe that enabled us to find previously undiscovered algorithms. How to benchmark the solving of this “meta-problem” remains a topic of future research. We conclude by pointing out the advantages of an extensible platform, such as ECLiPSe, for developing sophisticated hybrid algorithms for large scale industrial combinatorial optimisation problems.

[1]  François Laburthe,et al.  SALSA: A Language for Search Algorithms , 1998, Constraints.

[2]  Steven Minton,et al.  Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..

[3]  Mark Wallace,et al.  A Generic Model and Hybrid Algorithm for Hoist Scheduling Problems , 1998, CP.

[4]  François Laburthe,et al.  A Meta-Heuristic Factory for Vehicle Routing Problems , 1999, CP.

[5]  Gilbert Laporte,et al.  Optimal sizes of facilities on a linear market , 1989 .

[6]  Steven Minton,et al.  Automatically configuring constraint satisfaction programs: A case study , 1996, Constraints.

[7]  Mark Wallace,et al.  Probe Backtrack Search for Minimal Perturbation in Dynamic Scheduling , 2000, Constraints.

[8]  Barry Richards,et al.  Non-systematic Search and Learning: An Empirical Study , 1998, CP.

[9]  Pascal Van Hentenryck,et al.  Localizer: A Modeling Language for Local Search , 1997, CP.

[10]  Pascal Van Hentenryck.  The OPL optimization programming language , 1999 .

[11]  Mark Wallace,et al.  An Instance of Adaptive Constraint Propagation , 1996, CP.

[12]  Nicolas Beldiceanu,et al.  Introducing global constraints in CHIP , 1994 .

[13]  Bart Selman,et al.  An Empirical Study of Greedy Local Search for Satisfiability Testing , 1993, AAAI.

[14]  Chu Min Li,et al.  Look-Ahead Versus Look-Back for Satisfiability Problems , 1997, CP.

[15]  François Laburthe,et al.  SALSA: A Language for Search Algorithms , 1998, CP.