A comparison of memetic algorithms, tabu search, and ant colonies for the quadratic assignment problem.
Peter MerzBernd FreislebenPublished in: CEC (1999)
Keyphrases
- tabu search
- quadratic assignment problem
- memetic algorithm
- ant colonies
- metaheuristic
- ant colony optimization
- nature inspired
- simulated annealing
- path relinking
- feasible solution
- swarm intelligence
- benchmark instances
- scheduling problem
- job shop scheduling problem
- timetabling problem
- search algorithm
- vehicle routing problem
- test problems
- hybrid algorithm
- search procedure
- max sat
- genetic algorithm
- heuristic methods
- ant colony
- combinatorial optimization
- aco algorithm
- ant colony algorithm
- ant colony optimisation
- combinatorial optimization problems
- search methods
- optimization problems
- scatter search
- traveling salesman problem
- fuzzy logic
- search space
- optimal solution
- solution space
- linear programming
- lower bound