An Elitist GRASP Metaheuristic for the Multi-objective Quadratic Assignment Problem

Authors:
Hui Li;Dario Landa-Silva
Affiliations:
Automated Scheduling Optimisation and Planning Research Group School of Computer Science, The University of Nottingham, United Kingdom;Automated Scheduling Optimisation and Planning Research Group School of Computer Science, The University of Nottingham, United Kingdom
Venue:
EMO '09 Proceedings of the 5th International Conference on Evolutionary Multi-Criterion Optimization
Year:
2009

Citing 9
Cited 1

A study of permutation crossover operators on the traveling salesman problem

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Tabu Search

Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A GRASP Algorithm for the Multi-Objective Knapsack Problem

QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Asynchronous Cooperative Local Search for the Office-Space-Allocation Problem

INFORMS Journal on Computing
Paper: Robust taboo search for the quadratic assignment problem

Parallel Computing
Instance generators and test suites for the multiobjective quadratic assignment problem

EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition

IEEE Transactions on Evolutionary Computation

Some algebraic methods for solving multiobjective polynomial integer programs

Journal of Symbolic Computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

We propose an elitist Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic algorithm, called mGRASP/MH, for approximating the Pareto-optimal front in the multi-objective quadratic assignment problem (mQAP). The proposed algorithm is characterized by three features: elite greedy randomized construction, adaptation of search directions and cooperation between solutions. The approach builds starting solutions in a greedy fashion by using problem-specific information and elite solutions found previously. Also, mGRASP/MH maintains a population of solutions, each associated with a search direction (i.e. weight vector). These search directions are adaptively changed during the search. Moreover, a cooperation mechanism is also implemented between the solutions found by different local search procedures in mGRASP/MH. Our experiments show that mGRASP/MH performs better or similarly to several other state-of-the-art multi-objective metaheuristic algorithms when solving benchmark mQAP instances.