MaxSAT-based large neighborhood search for high school timetabling.
Emir DemirovicNysret MusliuPublished in: Comput. Oper. Res. (2017)
Keyphrases
- metaheuristic
- combinatorial optimization
- vehicle routing problem
- upper bound
- sat solvers
- constrained problems
- branch and bound algorithm
- vehicle routing
- optimal solution
- combinatorial problems
- simulated annealing
- tabu search
- optimization problems
- traveling salesman problem
- ant colony optimization
- vehicle routing problems with time windows
- maximum satisfiability
- routing problem
- search space
- travel time
- branch and bound
- sat problem
- particle swarm optimization
- lower bound
- randomly generated
- temporal constraints
- cost function
- maximum clique