Improving Search Efficiency Adopting Hill-Climbing to Ant Colony Optimization for Constraint Satisfaction Problems.
Daiki HayakawaKazunori MizunoHitoshi SasakiSeiichi NishiharaPublished in: KSE (2011)
Keyphrases
- constraint satisfaction problems
- hill climbing
- search efficiency
- ant colony optimization
- search space
- metaheuristic
- constraint satisfaction
- tabu search
- simulated annealing
- combinatorial problems
- search algorithm
- combinatorial optimization problems
- swarm intelligence
- constraint propagation
- ant colony
- constraint programming
- traveling salesman problem
- search strategy
- max min
- search procedure
- ant colony algorithm
- arc consistency
- combinatorial optimization
- heuristic search
- aco algorithm
- optimal solution
- hybrid algorithm
- artificial ants
- search tree
- ant colonies
- branch and bound
- state space
- genetic algorithm ga
- solution space
- population diversity
- np complete
- np hard
- aco algorithms
- beam search
- particle swarm optimization
- sat problem
- search methods
- rule learning
- path finding
- optimization method
- particle swarm optimization pso
- partial solutions
- tree search
- fitness function
- optimization problems
- hyper heuristics
- branch and bound algorithm
- phase transition