A Neighborhood Combining Approach in GRASP's Local Search for Quadratic Assignment Problem Solutions.
E. G. Hernandez-MartinezRogelio González VelázquezMaría Beatríz Bernábe LorancaJosé Luis Martínez FloresPublished in: Computación y Sistemas (2018)
Keyphrases
- quadratic assignment problem
- tabu search
- aco algorithms
- feasible solution
- benchmark instances
- combinatorial optimization
- simulated annealing
- heuristic methods
- metaheuristic
- memetic algorithm
- test instances
- ant colony optimization
- stochastic local search
- lower bound
- search algorithm
- test problems
- aco algorithm
- vehicle routing problem
- genetic algorithm
- optimal solution
- integer linear programming formulation
- solution quality
- scheduling problem
- job shop scheduling problem
- combinatorial problems
- traveling salesman
- benchmark problems
- satisfiability problem
- optimization problems
- search space
- feature selection