A Hybrid Genetic Algorithm for Constrained Combinatorial Problems: An Application to Promotion Planning Problems.
Paulo A. PereiraFernando A. C. C. FontesDalila B. M. M. FontesPublished in: OR (2010)
Keyphrases
- planning problems
- combinatorial problems
- constraint programming
- constraint satisfaction
- heuristic search
- combinatorial optimization
- traveling salesman problem
- constraint satisfaction problems
- metaheuristic
- domain independent
- graph coloring
- state space
- ai planning
- phase transition
- sat encodings
- global constraints
- solving planning problems
- planning domains
- probabilistic planning
- plan generation
- planning systems
- deterministic domains
- branch and bound algorithm
- partially observable markov decision processes
- classical planning
- optimization problems
- partial observability
- search space
- genetic algorithm
- simulated annealing
- general purpose
- evolutionary algorithm
- learning algorithm