Bandit-Inspired Memetic Algorithms for solving Quadratic Assignment Problems.
Francesco PuglierinMadalina M. DruganMarco A. WieringPublished in: IEEE Congress on Evolutionary Computation (2013)
Keyphrases
- memetic algorithm
- quadratic assignment problem
- combinatorial optimization
- tabu search
- metaheuristic
- assembly line balancing
- hybrid genetic algorithm
- benchmark instances
- simulated annealing
- feasible solution
- genetic algorithm
- job shop scheduling problem
- evolutionary computation
- branch and bound
- vehicle routing problem
- scheduling problem
- branch and bound algorithm
- stochastic local search
- lower bound
- artificial intelligence
- traveling salesman problem
- dynamic programming
- test instances
- np hard
- neural network