Genetic algorithms for generalised hypertree decompositions Online publication date: Wed, 25-Jul-2007
by Nysret Musliu, Werner Schafhauser
European J. of Industrial Engineering (EJIE), Vol. 1, No. 3, 2007
Abstract: Many practical problems in mathematics and computer science may be formulated as Constraint Satisfaction Problems (CSPs). Although CSPs are NP-hard in general, it has been proven that instances of CSPs may be solved efficiently, if they have generalised hypertree decompositions of small width. Unfortunately, finding a generalised hypertree decomposition of minimum width is an NP-hard problem. Based on a Genetic Algorithm (GA) for tree decompositions we propose two extensions searching for small-width generalised hypertree decompositions. We carry out comprehensive experiments to obtain suitable operators and parameter settings and apply each GA to numerous benchmark examples for tree and generalised hypertree decompositions. Compared to the best solutions known from literature our GAs were able to return results of equal quality for many benchmark instances and even for some benchmarks improved solutions were obtained. [Received 6 February 2007; Revised 21 May 2007; Accepted 22 May 2007]
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the European J. of Industrial Engineering (EJIE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook