Memetic search for the quadratic assignment problem

We present a memetic algorithm (called BMA) for the well-known QAP.BMA integrates BLS within the population-based evolutionary computing framework.BMA is able to attain the best-known results for 133 out of 135 QAP benchmark instances.We provide insights on search landscapes and crossover operators for QAP. The quadratic assignment problem (QAP) is one of the most studied NP-hard problems with various practical applications. In this work, we propose a powerful population-based memetic algorithm (called BMA) for QAP. BMA integrates an effective local optimization algorithm called Breakout Local Search (BLS) within the evolutionary computing framework which itself is based on a uniform crossover, a fitness-based pool updating strategy and an adaptive mutation procedure. Extensive computational studies on the set of 135 well-known benchmark instances from the QAPLIB revealed that the proposed algorithm is able to attain the best-known results for 133 instances and thus competes very favorably with the current most effective QAP approaches. A study of the search landscape and crossover operators is also proposed to shed light on the behavior of the algorithm.

[1]  C. R. Reeves,et al.  Landscapes, operators and heuristic search , 1999, Ann. Oper. Res..

[2]  James Smith,et al.  A tutorial for competent memetic algorithms: model, taxonomy, and design issues , 2005, IEEE Transactions on Evolutionary Computation.

[3]  Jin-Kao Hao,et al.  A Multilevel Memetic Approach for Improving Graph k-Partitions , 2011, IEEE Transactions on Evolutionary Computation.

[4]  Jin-Kao Hao,et al.  Breakout Local Search for the Max-Cutproblem , 2013, Eng. Appl. Artif. Intell..

[5]  Jin-Kao Hao,et al.  A memetic algorithm for graph coloring , 2010, Eur. J. Oper. Res..

[6]  Zvi Drezner,et al.  Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem , 2008, Comput. Oper. Res..

[7]  Shun Cai,et al.  Applying an adaptive tabu search algorithm to optimize truck-dock assignment in the crossdock management system , 2014, Expert Syst. Appl..

[8]  Éric D. Taillard,et al.  Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..

[9]  Zvi Drezner,et al.  A New Genetic Algorithm for the Quadratic Assignment Problem , 2003, INFORMS J. Comput..

[10]  Fred W. Glover,et al.  Multistart Tabu Search and Diversification Strategies for the Quadratic Assignment Problem , 2009, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[11]  Jin-Kao Hao,et al.  Breakout local search for the quadratic assignment problem , 2013, Appl. Math. Comput..

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

[13]  T. L. Ward,et al.  Solving Quadratic Assignment Problems by ‘Simulated Annealing’ , 1987 .

[14]  Kenneth D. Boese,et al.  Cost Versus Distance In the Traveling Salesman Problem , 1995 .

[15]  Christian Artigues,et al.  A Memetic Algorithm with a large neighborhood crossover operator for the Generalized Traveling Salesman Problem , 2008, Comput. Oper. Res..

[16]  Larry J. Eshelman,et al.  The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination , 1990, FOGA.

[17]  Terry Jones,et al.  Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms , 1995, ICGA.

[18]  Kurt M. Anstreicher,et al.  Recent advances in the solution of quadratic assignment problems , 2003, Math. Program..

[19]  Milos Nikolic,et al.  A simultaneous transit network design and frequency setting: Computing with bees , 2014, Expert Syst. Appl..

[20]  Pablo Moscato,et al.  A Gentle Introduction to Memetic Algorithms , 2003, Handbook of Metaheuristics.

[21]  Fred W. Glover,et al.  A cooperative parallel tabu search algorithm for the quadratic assignment problem , 2009, Eur. J. Oper. Res..

[22]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[23]  Alfonsas Misevicius,et al.  An improved hybrid genetic algorithm: new results for the quadratic assignment problem , 2004, Knowl. Based Syst..

[24]  Roberto Battiti,et al.  The Reactive Tabu Search , 1994, INFORMS J. Comput..

[25]  Panos M. Pardalos,et al.  The Quadratic Assignment Problem: A Survey and Recent Developments , 1993, Quadratic Assignment and Related Problems.

[26]  Boulevard Lavoisier,et al.  Breakout Local Search for the Max-Cut Problem , 2014 .

[27]  Jin-Kao Hao,et al.  Breakout Local Search for maximum clique problems , 2013, Comput. Oper. Res..

[28]  Jin-Kao Hao,et al.  A New Genetic Local Search Algorithm for Graph Coloring , 1998, PPSN.

[29]  Alfonsas Misevicius,et al.  ITERATED TABU SEARCH: AN IMPROVEMENT TO STANDARD TABU SEARCH , 2015 .

[30]  Christian Blum,et al.  Hybrid metaheuristics in combinatorial optimization: A survey , 2011, Appl. Soft Comput..

[31]  Charles Fleurent,et al.  Genetic Hybrids for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.

[32]  William E. Hart,et al.  Recent Advances in Memetic Algorithms , 2008 .

[33]  Fred W. Glover,et al.  A study of diversification strategies for the quadratic assignment problem , 1994, Comput. Oper. Res..

[34]  Jadranka Skorin-Kapov,et al.  Tabu Search Applied to the Quadratic Assignment Problem , 1990, INFORMS J. Comput..

[35]  Jin-Kao Hao,et al.  Memetic Algorithms in Discrete Optimization , 2012, Handbook of Memetic Algorithms.

[36]  Ekrem Duman,et al.  The quadratic assignment problem in the context of the printed circuit board assembly process , 2007, Comput. Oper. Res..

[37]  Jin-Kao Hao,et al.  An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring , 2010, Comput. Oper. Res..

[38]  Ashish Tiwari,et al.  A greedy genetic algorithm for the quadratic assignment problem , 2000, Comput. Oper. Res..

[39]  Thomas Stützle,et al.  Iterated local search for the quadratic assignment problem , 2006, Eur. J. Oper. Res..

[40]  Refael Hassin,et al.  Approximating the minimum quadratic assignment problems , 2009, TALG.

[41]  Hong Wang,et al.  Random assignment method based on genetic algorithms and its application in resource allocation , 2012, Expert Syst. Appl..

[42]  Jin-Kao Hao,et al.  Breakout Local Search for the Vertex Separator Problem , 2013, IJCAI.

[43]  Pablo Moscato,et al.  Handbook of Memetic Algorithms , 2011, Studies in Computational Intelligence.

[44]  Chun Hung Cheng,et al.  The use of meta-heuristics for airport gate assignment , 2012, Expert Syst. Appl..