A tabu-search based heuristic for the hub covering problem over incomplete hub networks.
Hatice CalikSibel A. AlumurBahar Yetis KaraOya Ekin KarasanPublished in: Comput. Oper. Res. (2009)
Keyphrases
- tabu search
- simulated annealing
- metaheuristic
- feasible solution
- search procedure
- heuristic methods
- memetic algorithm
- path relinking
- search algorithm
- iterated local search
- scheduling problem
- job shop scheduling problem
- test problems
- initial solution
- quadratic assignment problem
- benchmark instances
- variable neighbourhood search
- genetic algorithm
- hybrid algorithm
- multi start
- multidimensional knapsack problem
- tabu search algorithm
- vehicle routing problem
- tabu list
- max sat
- hill climbing
- simulated annealing and tabu search
- variable neighborhood search
- benchmark problems
- optimization problems
- single machine
- knn
- ant colony optimization
- parallel algorithm
- special case
- graph colouring
- neural network