A tabu search approach to the constraint satisfaction problem as a general problem solver.
Koji NonobeToshihide IbarakiPublished in: Eur. J. Oper. Res. (1998)
Keyphrases
- tabu search
- constraint satisfaction problems
- metaheuristic
- simulated annealing
- constraint satisfaction
- constraint solving
- path relinking
- search space
- search algorithms for solving
- constraint propagation
- scheduling problem
- combinatorial problems
- feasible solution
- test problems
- genetic algorithm
- search algorithm
- tractable subclasses
- pseudo boolean optimization
- vehicle routing problem
- constraint solver
- special case
- memetic algorithm
- job shop scheduling problem
- hybrid algorithm
- search procedure
- hard constraints
- arc consistency
- tractable classes
- heuristic methods
- tabu search algorithm
- np complete
- global constraints
- constraint programming
- combinatorial optimization
- search heuristics
- np hard
- partial constraint satisfaction
- multi objective
- benchmark instances
- constraint networks
- cost function
- optimization problems
- neural network
- orders of magnitude