Intensification and diversification with elite tabu search solutions for the linear ordering problem.
Manuel LagunaRafael MartíVicente CamposPublished in: Comput. Oper. Res. (1999)
Keyphrases
- tabu search
- feasible solution
- iterated local search
- path relinking
- tabu search algorithm
- initial solution
- metaheuristic
- simulated annealing
- benchmark instances
- heuristic methods
- multidimensional knapsack problem
- simulated annealing and tabu search
- scheduling problem
- memetic algorithm
- search heuristics
- quadratic assignment problem
- hybrid algorithm
- test problems
- solution quality
- vehicle routing problem
- search algorithm
- genetic algorithm
- variable neighborhood search
- search procedure
- solution space
- optimal solution
- multi start
- graph colouring
- benchmark problems
- scatter search
- job shop scheduling problem
- combinatorial problems
- flowshop
- test instances
- candidate list
- ant colony optimization
- max sat
- job shop
- particle swarm optimization
- neighborhood search
- combinatorial optimization problems
- exact solution
- cost function
- tabu list
- lower bound
- computational complexity