Hybrid Simulated Annealing for the Bi-objective Quadratic Assignment Problem.
Mohamed Saifullah HussinThomas StützlePublished in: MIWAI (2017)
Keyphrases
- quadratic assignment problem
- bi objective
- simulated annealing
- tabu search
- combinatorial optimization
- multi objective
- metaheuristic
- efficient solutions
- ant colony optimization
- evolutionary algorithm
- heuristic methods
- multi objective optimization
- genetic algorithm
- nsga ii
- test problems
- lower bound
- hybrid algorithm
- aco algorithm
- shortest path problem
- combinatorial optimization problems
- network design
- benchmark problems
- multiple objectives
- solution quality
- feasible solution
- memetic algorithm
- job shop scheduling problem
- genetic algorithm ga
- knapsack problem
- vehicle routing problem
- test instances
- branch and bound algorithm
- special case
- benchmark instances
- scheduling problem
- search algorithm
- np hard
- max sat
- traveling salesman problem
- hill climbing
- greedy algorithm