A hybrid tabu search/branch & bound approach to solving the generalized assignment problem.
Andrew J. WoodcockJohn M. WilsonPublished in: Eur. J. Oper. Res. (2010)
Keyphrases
- tabu search
- branch bound
- simulated annealing
- metaheuristic
- simulated annealing and tabu search
- search heuristics
- feasible solution
- path relinking
- lp relaxation
- scheduling problem
- memetic algorithm
- vehicle routing problem
- search procedure
- search algorithm
- hybrid algorithm
- scatter search
- initial solution
- genetic algorithm
- search algorithm for solving
- job shop scheduling problem
- max sat
- combinatorial optimization
- tabu search algorithm
- timetabling problem
- iterated local search
- evolutionary algorithm
- candidate list
- solution space
- solution quality
- tabu list
- upper bound