Hybridizing tabu search with mathematical programming for solving a single row layout problem.
Meng YuXingquan ZuoXinchao ZhaoChunlu WangPublished in: CASE (2018)
Keyphrases
- mathematical programming
- tabu search
- combinatorial optimization
- metaheuristic
- search algorithm for solving
- vehicle routing problem
- simulated annealing
- variable neighbourhood search
- path relinking
- memetic algorithm
- quadratic assignment problem
- linear programming
- search heuristics
- scheduling problem
- feasible solution
- scatter search
- search algorithm
- genetic algorithm
- mip solver
- hybrid algorithm
- ant colony optimization
- benchmark instances
- job shop scheduling problem
- optimization problems
- search space
- initial solution
- combinatorial problems
- branch and bound
- evolutionary algorithm
- search procedure
- traveling salesman problem
- benchmark problems
- iterated local search
- tabu search algorithm
- heuristic methods
- np hard
- tabu list
- multi start
- max sat
- mixed integer linear
- lower bound
- flowshop
- candidate list
- hybrid metaheuristic
- routing problem
- search methods
- optimization method
- branch and bound algorithm
- special case
- particle swarm optimization
- timetabling problem
- robust optimization
- exact algorithms
- tree search