Abstract
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.
Similar content being viewed by others
References
N. Beldiceanu and E. Contjean, Introducing global constraints in CHIP, Math. Comput. Modelling 12 (1994) 97-123.
Y. Caseau, F. Laburthe and G. Silverstein, A Meta-heuristic factory for vehicle routing problems, in: Proc. CP '99, Washington, DC (1999).
Y. Caseau and F. Laburthe, SALSA: A Language for Search Algorithms, in: Proc. CP '98, Pisa (1998) pp. 310-324.
Chu Min Li and Anbulagan, Look-ahead versus look-back for satisfiability problems, in: Proc. CP '97, Linz (1997).
H. El Sakkout and M. Wallace, Probe backtrack search for minimal perturbation in dynamic scheduling, Constraints 5(4) (2000).
H. El Sakkout, M. Wallace and E. Richards, An instance of adaptive propagation, in: Proc. CP '96, Boston (1996).
L. Michel and P. Van Hentenryck, LOCALIZER: A modelling language for local search, in: Proc. CP '97, Linz (1997).
S. Minton, Automatically configuring constraint satisfaction problems: A case study, Constraints 1 (1996) 7-44.
S. Minton, M. Johnstone, A. Philips and P. Laird, Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems, Artif. Intell. 58 (1992) 161-206.
E.T. Richards and E.B. Richards, Nonsystematic search and learning: An empirical study, in: Proc. CP '98, Pisa (1998).
R. Rodosek and M. Wallace, A generic model and hybrid algorithm for hoist scheduling problems, in: Proc. CP '98, Pisa (1998).
J. Schimpf, K. Shen and M. Wallace, Tutorial on search in ECLiPSe, Manuals and other documentation (1999), www.icparc.ic.ac.uk/eclipse.
B. Selman and H. Kautz, An empirical study of greedy local search for satisfiability testing, in: AAAI-93 (1993) pp. 46-51.
A. van Gelder and Y. Tsuji, Instances from circuit fault analysis, www.satlib.org/Benchmarks/SAT/DIMACS/BF/descr.html.
P. Van Hentenryck, The OPL Optimization Programming Language (MIT Press, 1999).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wallace, M., Schimpf, J. Finding the Right Hybrid Algorithm – A Combinatorial Meta-Problem. Annals of Mathematics and Artificial Intelligence 34, 259–269 (2002). https://doi.org/10.1023/A:1014450507312
Issue Date:
DOI: https://doi.org/10.1023/A:1014450507312