New Bounds for Office Space Allocation using Tabu Search.
Francisco CastilloMaría Cristina RiffElizabeth MonteroPublished in: GECCO (2016)
Keyphrases
- tabu search
- simulated annealing
- metaheuristic
- scheduling problem
- memetic algorithm
- upper bound
- feasible solution
- search algorithm
- genetic algorithm
- lower bound
- path relinking
- heuristic methods
- job shop scheduling problem
- hybrid algorithm
- search procedure
- test problems
- vehicle routing problem
- scatter search
- iterated local search
- multi start
- lower and upper bounds
- benchmark instances
- flowshop
- tabu list
- quadratic assignment problem
- variable neighborhood search
- tabu search algorithm
- worst case
- initial solution
- search heuristics
- graph colouring
- search space
- evolutionary algorithm
- benchmark problems
- neural network