Tackling the bi-objective quadratic assignment problem by characterizing different memory strategies in a memetic algorithm.
Roberto Sandoval-SotoManuel Villalobos-CidMario Inostroza-PontaPublished in: SCCC (2017)
Keyphrases
- memetic algorithm
- quadratic assignment problem
- tabu search
- bi objective
- combinatorial optimization
- metaheuristic
- ant colony optimization
- efficient solutions
- benchmark instances
- heuristic methods
- multi objective
- simulated annealing
- vehicle routing problem
- job shop scheduling problem
- network design
- feasible solution
- multi objective optimization
- test problems
- genetic algorithm
- multiple objectives
- scheduling problem
- search algorithm
- routing problem
- nsga ii
- test instances
- combinatorial optimization problems
- traveling salesman problem
- shortest path problem
- evolutionary algorithm
- aco algorithm
- optimization problems
- crossover operator
- lower bound
- search strategies
- search space
- stochastic local search