8 research outputs found
Towards hybrid methods for solving hard combinatorial optimization problems
Tesis doctoral leída en la Escuela Politécnica Superior de la Universidad Autónoma de Madrid el 4 de septiembre de 200
Set Constraint Model and Automated Encoding into SAT: Application to the Social Golfer Problem
On the one hand, Constraint Satisfaction Problems allow one to declaratively
model problems. On the other hand, propositional satisfiability problem (SAT)
solvers can handle huge SAT instances. We thus present a technique to
declaratively model set constraint problems and to encode them automatically
into SAT instances. We apply our technique to the Social Golfer Problem and we
also use it to break symmetries of the problem. Our technique is simpler, more
declarative, and less error-prone than direct and improved hand modeling. The
SAT instances that we automatically generate contain less clauses than improved
hand-written instances such as in [20], and with unit propagation they also
contain less variables. Moreover, they are well-suited for SAT solvers and they
are solved faster as shown when solving difficult instances of the Social
Golfer Problem.Comment: Submitted to Annals of Operations researc
Scheduling reach mahjong tournaments using pseudoboolean constraints
Reach mahjong is a gambling game for 4 players, most popular in Japan, but played internationally, including in amateur tournaments across Europe.
We report on our experience of generating tournament schedules for tournaments hosted in the United Kingdom using pseudoboolean solvers.
The problem is essentially an extension of the well-studied Social Golfer Problem (SGP) in operations research.
However, in our setting, there are further constraints, such as the positions of players within a group, and the structure of the tournament graph,
which are ignored in the usual formulation of the SGP.
We tackle the problem primarily using the SAT/pseudoboolean solver clasp,
but sometimes augmented with an existing local search-based solver for the SGP
Computational intelligence approaches to robotics, automation, and control [Volume guest editors]
No abstract available
Identifying sources of global contention in constraint satisfaction search
Much work has been done on learning from failure in search to boost solving of
combinatorial problems, such as clause-learning and clause-weighting in boolean
satisfiability (SAT), nogood and explanation-based learning, and constraint weighting
in constraint satisfaction problems (CSPs). Many of the top solvers in SAT use
clause learning to good effect. A similar approach (nogood learning) has not had
as large an impact in CSPs. Constraint weighting is a less fine-grained approach
where the information learnt gives an approximation as to which variables may be
the sources of greatest contention.
In this work we present two methods for learning from search using restarts,
in order to identify these critical variables prior to solving. Both methods are
based on the conflict-directed heuristic (weighted-degree heuristic) introduced by
Boussemart et al. and are aimed at producing a better-informed version of the
heuristic by gathering information through restarting and probing of the search
space prior to solving, while minimizing the overhead of these restarts.
We further examine the impact of different sampling strategies and different
measurements of contention, and assess different restarting strategies for the
heuristic. Finally, two applications for constraint weighting are considered in
detail: dynamic constraint satisfaction problems and unary resource scheduling
problems
Computational intelligence approaches to robotics, automation, and control [Volume guest editors]
No abstract available
Efficient local search for Pseudo Boolean Optimization
Algorithms and the Foundations of Software technolog
Scheduling Social Golfers with Memetic Evolutionary Programming
Abstract. The social golfer problem (SGP) has attracted significant attention in recent years because of its highly symmetrical, constrained, and combinatorial nature. Nowadays, it constitutes one of the standard benchmarks in the area of constraint programming. This paper presents the first evolutionary approach to the SGP. We propose a memetic algorithm (MA) that combines ideas from evolutionary programming and tabu search. In order to lessen the influence of the high number of symmetries present in the problem, the MA does not make use of recombination operators. The search is thus propelled by selection, mutation, and local search. In connection with the latter, we analyze the effect of baldwinian and lamarckian learning in the performance of the MA. An experimental study shows that the MA is capable of improving results reported in the literature, and supports the superiority of lamarckian strategies in this problem.