• Corpus ID: 3830178

Solving the Course-timetabling Problem of Cairo University Using Max-SAT

@article{Halaby2018SolvingTC,
  title={Solving the Course-timetabling Problem of Cairo University Using Max-SAT},
  author={Mohamed El Halaby},
  journal={ArXiv},
  year={2018},
  volume={abs/1803.05027}
}
Due to the good performance of current SAT (satisfiability) and Max-SAT (maximum ssatisfiability) solvers, many real-life optimization problems such as scheduling can be solved by encoding them into Max-SAT. In this paper we tackle the course timetabling problem of the department of mathematics, Cairo University by encoding it into Max-SAT. Generating timetables for the department by hand has proven to be cumbersome and the generated timetable almost always contains conflicts. We show how the… 

ITC-2019: A MaxSAT approach to solve University Timetabling problems

An algorithm is described that uses a MaxSAT encoding to solve course timetabling and student sectioning problems as specified for the International Timetabling Competition 2019 and a hybridized algorithm is developed that combines local search techniques and aMaxSAT solver.

Automated university lecture timetable using Heuristic Approach

A combination of genetic algorithm (GA) and simulated annealing (SA) is presented to have a heuristic approach (HA) for solving course timetabling problem in Federal University Wukari (FUW).

References

SHOWING 1-10 OF 16 REFERENCES

Curriculum-based course timetabling with SAT and MaxSAT

This paper describes the work on applying novel techniques based on propositional satisfiability (SAT) solvers and optimizers to the Curriculum-based Course Timetabling problem, which yields the best known solutions for 21 of them.

Timetabling Based on SAT Encoding: a Case Study

An appropriate SAT encoding is described that makes possible to formulate a very wide set of timetable requirements and some techniques used to reduce the problem size are given.

sub-SAT: a formulation for relaxed Boolean satisfiability with applications in routing

This paper presents a formulation for "subset satisfiable" Boolean SAT: a transformation based on explicit thresholding and counting for the necessary SAT relaxation which is satisfiable just if not more than k < < N of these constraints cannot be satisfied in the original problem.

Application of Satisfiability algorithms to timetable problems

This paper presents an approach for translating timetable problems (which are a particular case of DSS), into a Boolean formula, which is then provided to an environment that allows experimenting different heuristics in order to extract solutions that satisfy a maximum number of clauses (Max-Sat problem).

Towards Robust CNF Encodings of Cardinality Constraints

Experimental results indicate that the modified SAT solver becomes significantly more robust on SAT encodings involving ≤ 1 (x1, . . . , xn) constraints, and shows how a state-of-the-art SAT solvers can be adapted to overcome the problem of adding additional auxiliary variables.

A PSO algorithm to solve a Real Course+Exam Timetabling Problem (1)

This paper proposes a particle swarm approach to simultaneously solve both problems as well as a local search procedure to handle the dynamism, and shows that this approach can find high quality solutions within minutes, where a traditional forward checking requires hours to obtain comparable ones.

Efficient CNF Encoding of Boolean Cardinality Constraints

The proposed encoding into CNF clauses of Boolean cardinality constraints that arise in many practical applications is efficient with respect to unit propagation, which is implemented in almost all complete CNF satisfiability solvers.

A Parametric Approach for Smaller and Better Encodings of Cardinality Constraints

An arc-consistent encoding is developed that, by recursively decomposing the constraint into smaller ones, allows one to decide which encoding to apply to each sub-constraint, and that strongly improves SAT solvers' performance.

The complexity of theorem-proving procedures

  • S. Cook
  • Mathematics, Computer Science
    STOC
  • 1971
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a

PackUp: Tools for Package Upgradability Solving

PackUp (PACKage UPgradability with Boolean formulations) a framework for solving the the software package upgradability problem and supports two types of solvers: weighted partial MaxSAT solvers and optimization pseudo-Boolean (OPB) solvers.