A heuristic search based on diversity for solving combinatorial problems.
Francisco CasasClaudio E. TorresIgnacio ArayaPublished in: J. Heuristics (2022)
Keyphrases
- heuristic search
- combinatorial problems
- constraint satisfaction
- solving hard
- search problems
- combinatorial optimization
- graph coloring
- constraint programming
- search space
- combinatorial search
- search algorithm
- metaheuristic
- bidirectional search
- constraint satisfaction problems
- state space
- phase transition
- traveling salesman problem
- branch and bound algorithm
- sat encodings
- planning problems
- constraint propagation
- optimal planning
- admissible heuristics
- beam search
- heuristic search algorithms
- search strategies
- ant colony optimization
- global constraints
- ai planning
- optimization problems
- branch and bound
- satisfiability problem
- greedy search
- hyper heuristics
- finite domain
- genetic algorithm