Simplified Tabu Search with Random-Based Searches for Bound Constrained Global Optimization.
Ana Maria A. C. RochaM. Fernanda P. CostaEdite M. G. P. FernandesPublished in: ICCSA (3) (2020)
Keyphrases
- tabu search
- constrained global optimization
- simulated annealing
- metaheuristic
- global optimization
- global search
- path relinking
- feasible solution
- memetic algorithm
- hybrid algorithm
- search algorithm
- genetic algorithm
- scheduling problem
- upper bound
- heuristic methods
- test problems
- job shop scheduling problem
- benchmark instances
- tabu search algorithm
- search procedure
- vehicle routing problem
- scatter search
- iterated local search
- quadratic assignment problem
- flowshop
- lower bound
- candidate list
- tabu list
- multi start
- job shop
- initial solution
- particle swarm optimization
- max sat
- optimization problems
- worst case
- ant colony optimization
- search strategies
- graph colouring
- variable neighborhood search
- combinatorial optimization
- search methods
- benchmark problems
- solution quality
- search algorithm for solving