Solving the multi-objective quadratic assignment problem using a fast messy genetic algorithm

The multiobjective quadratic assignment problem is an NP-complete problem with a multitude of real-world applications. The specific application addressed is the minimization of communication flows in a heterogenous mix of unmanned aerial vehicles. Developed is a multiobjective approach to solving the general mQAP for this UAV application. The combinatoric nature of this problem calls for a stochastic search algorithm; moreover, the multiobjective fast messy genetic algorithm (MOMGA-II) [Jesse Zydallis (2003)] is used for experimentation. Results indicate that much of the Pareto optimal points are found.

[1]  Vincent Bachelet.  Métaheuristiques parallèles hybrides : application au problème d'affection quadratique , 1999 .

[2]  Jorng-Tzong Horng,et al.  Resolution of quadratic assignment problems using an evolutionary algorithm , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[3]  M Dorigo,et al.  Ant colonies for the quadratic assignment problem , 1999, J. Oper. Res. Soc..

[4]  Michael J. Shaw,et al.  A genetic algorithm-based approach to flexible flow-line scheduling with variable lot sizes , 1997, IEEE Trans. Syst. Man Cybern. Part B.

[5]  Panos M. Pardalos,et al.  Quadratic Assignment and Related Problems , 1994 .

[6]  Maurício Resende.  A Branch and Bound Algorithm for the Quadratic Assignment Problem using a Lower Bound Based on Linear Programming , 1996 .

[7]  V. Deineko,et al.  The Quadratic Assignment Problem: Theory and Algorithms , 1998 .

[8]  David W. Corne,et al.  Instance Generators and Test Suites for the Multiobjective Quadratic Assignment Problem , 2003, EMO.

[9]  David W. Corne,et al.  Towards Landscape Analyses to Inform the Design of Hybrid Local Search for the Multiobjective Quadratic Assignment Problem , 2002, HIS.

[10]  Vittorio Maniezzo,et al.  The Ant System Applied to the Quadratic Assignment Problem , 1999, IEEE Trans. Knowl. Data Eng..

[11]  B. Freisleben,et al.  A comparison of memetic algorithms, tabu search, and ant colonies for the quadratic assignment problem , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[12]  É. Taillard.  COMPARISON OF ITERATIVE SEARCHES FOR THE QUADRATIC ASSIGNMENT PROBLEM. , 1995 .

[13]  Peter Hahn,et al.  A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method , 1998, Eur. J. Oper. Res..

[14]  J. B. Zydallis,et al.  Explicit building-block multiobjective genetic algorithms: theory, analysis, and development , 2003 .

[15]  Dock Bumpers,et al.  Volume 2 , 2005, Proceedings of the Ninth International Conference on Computer Supported Cooperative Work in Design, 2005..

[16]  Bernd Freisleben,et al.  Fitness landscape analysis and memetic algorithms for the quadratic assignment problem , 2000, IEEE Trans. Evol. Comput..

[17]  D. Fogel.  Evolutionary algorithms in theory and practice , 1997, Complex..

[18]  K. M. Sim,et al.  Multiple ant-colony optimization for network routing , 2002, First International Symposium on Cyber Worlds, 2002. Proceedings..

[19]  John H. Holland,et al.  Induction: Processes of Inference, Learning, and Discovery , 1987, IEEE Expert.

[20]  Volker Nissen,et al.  Solving the quadratic assignment problem with clues from nature , 1994, IEEE Trans. Neural Networks.