A genetic algorithm for the Resource-Constrained Project Scheduling Problem with Alternative Subgraphs using a boolean satisfiability solver.
Tom ServranckxJosé CoelhoMario VanhouckePublished in: Eur. J. Oper. Res. (2024)
Keyphrases
- resource constrained project scheduling problem
- boolean satisfiability
- genetic algorithm
- sat solving
- harmony search
- boolean formula
- sat solvers
- probabilistic planning
- resource constraints
- randomly generated
- branch and bound algorithm
- ant colony algorithm
- fitness function
- symmetry breaking
- sat problem
- metaheuristic
- clause learning
- np complete
- simulated annealing
- integer linear programming
- crossover operator
- combinatorial problems
- evolutionary algorithm
- ant colony optimization
- phase transition
- optimal solution
- multi objective
- optimization method
- sat instances
- simulated annealing algorithm
- max sat
- differential evolution
- genetic algorithm ga
- optimization problems
- branch and bound
- job shop scheduling problem
- neural network