Meta-Heuristic Combining Prior Online and Offline Information for the Quadratic Assignment Problem

The construction of promising solutions for NP-hard combinatorial optimization problems (COPs) in meta-heuristics is usually based on three types of information, namely a priori information, a posteriori information learned from visited solutions during the search procedure, and online information collected in the solution construction process. Prior information reflects our domain knowledge about the COPs. Extensive domain knowledge can surely make the search effective, yet it is not always available. Posterior information could guide the meta-heuristics to globally explore promising search areas, but it lacks local guidance capability. On the contrary, online information can capture local structures, and its application can help exploit the search space. In this paper, we studied the effects of using this information on metaheuristic's algorithmic performances for the COPs. The study was illustrated by a set of heuristic algorithms developed for the quadratic assignment problem. We first proposed an improved scheme to extract online local information, then developed a unified framework under which all types of information can be combined readily. Finally, we studied the benefits of the three types of information to meta-heuristics. Conclusions were drawn from the comprehensive study, which can be used as principles to guide the design of effective meta-heuristic in the future.

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

[2]  Kalyanmoy Deb,et al.  RapidAccurate Optimization of Difficult Problems Using Fast Messy Genetic Algorithms , 1993, ICGA.

[3]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[4]  Jonathan F. Bard,et al.  A GRASPTM for a difficult single machine scheduling problem, , 1991, Comput. Oper. Res..

[5]  Pedro Larrañaga,et al.  Estimation of Distribution Algorithms , 2002, Genetic Algorithms and Evolutionary Computation.

[6]  Peter Merz,et al.  Advanced Fitness Landscape Analysis and the Performance of Memetic Algorithms , 2004, Evolutionary Computation.

[7]  Serban Iordache,et al.  Consultant-guided search algorithms for the quadratic assignment problem , 2010, GECCO '10.

[8]  Xin Yao,et al.  Fitness-Probability Cloud and a Measure of Problem Hardness for Evolutionary Algorithms , 2011, EvoCOP.

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

[10]  Heinz Mühlenbein,et al.  Convergence Theory and Applications of the Factorized Distribution Algorithm , 2015, CIT 2015.

[11]  Stefan Preitl,et al.  Evolutionary optimization-based tuning of low-cost fuzzy controllers for servo systems , 2013, Knowl. Based Syst..

[12]  Qingfu Zhang,et al.  Evolutionary Algorithms Refining a Heuristic: A Hybrid Method for Shared-Path Protections in WDM Networks Under SRLG Constraints , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[13]  Celso C. Ribeiro,et al.  A Parallel Grasp for the Steiner Tree Problem in Graphs Using a Hybrid Local Search Strategy , 2000, J. Glob. Optim..

[14]  Thomas Stützle,et al.  The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances , 2003 .

[15]  Xin Yao,et al.  Dynamic Neighbourhood Size in Simulated Annealing , 1992 .

[16]  Bertrand M. T. Lin,et al.  An Ant Colony Optimization Algorithm for the Minimum Weight Vertex Cover Problem , 2004, Ann. Oper. Res..

[17]  Xin Yao,et al.  Fitness Landscape-Based Parameter Tuning Method for Evolutionary Algorithms for Computing Unique Input Output Sequences , 2011, ICONIP.

[18]  Bernd Freisleben,et al.  Fitness Landscapes, Memetic Algorithms, and Greedy Operators for Graph Bipartitioning , 2000, Evolutionary Computation.

[19]  Mieczyslaw M. Kokar,et al.  Self Controlling Tabu Search algorithm for the Quadratic Assignment Problem , 2011, Comput. Ind. Eng..

[20]  Celso C. Ribeiro,et al.  Variable neighborhood search for the degree-constrained minimum spanning tree problem , 2002, Discret. Appl. Math..

[21]  Thomas Stützle,et al.  The MAX–MIN Ant System and Local Search for Combinatorial Optimization Problems: Towards Adaptive Tools for Global Optimization , 1997 .

[22]  Peter Merz,et al.  Memetic algorithms for combinatorial optimization problems : fitness landscapes and effective search strategies , 2006 .

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

[24]  R. Howard,et al.  Local convergence analysis of a grouped variable version of coordinate descent , 1987 .

[25]  Fei Peng,et al.  Population-Based Algorithm Portfolios for Numerical Optimization , 2010, IEEE Transactions on Evolutionary Computation.

[26]  James Kennedy,et al.  Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

[27]  Hao Gao,et al.  A New Particle Swarm Algorithm and Its Globally Convergent Modifications , 2011, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[28]  Qingfu Zhang,et al.  An evolutionary algorithm with guided mutation for the maximum clique problem , 2005, IEEE Transactions on Evolutionary Computation.

[29]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[30]  Panos M. Pardalos,et al.  GRASP with Path-Relinking for the Quadratic Assignment Problem , 2004, WEA.

[31]  Xin Yao,et al.  A Memetic Algorithm for Periodic Capacitated Arc Routing Problem , 2011, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[32]  Fred Glover,et al.  Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory , 1999, INFORMS J. Comput..

[33]  The Centre of Excellence for Research in Computational Intelligence and Applications , .

[34]  X. Yao Evolutionary Search of Approximated N-dimensional Landscapes , 2000 .

[35]  Éric D. Taillard,et al.  FANT: Fast ant system , 1998 .

[36]  Panos M. Pardalos,et al.  A Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.

[37]  Ying Tan,et al.  An Intelligent Multifeature Statistical Approach for the Discrimination of Driving Conditions of a Hybrid Electric Vehicle , 2011, IEEE Transactions on Intelligent Transportation Systems.

[38]  M. Dorigo,et al.  1 Positive Feedback as a Search Strategy , 1991 .

[39]  Celso C. Ribeiro,et al.  Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment , 2000, INFORMS J. Comput..

[40]  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.

[41]  J. A. Lozano,et al.  Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .

[42]  T. Mahnig,et al.  Evolutionary algorithms: from recombination to search distributions , 2001 .

[43]  Thomas Stützle,et al.  Ant colony optimization: artificial ants as a computational intelligence technique , 2006 .

[44]  R. Rubinstein The Cross-Entropy Method for Combinatorial and Continuous Optimization , 1999 .

[45]  Xin Yao,et al.  Clustering and learning Gaussian distribution for continuous optimization , 2005, IEEE Trans. Syst. Man Cybern. Part C.

[46]  J. Davenport Editor , 1960 .

[47]  Corso Elvezia Ant Colonies for the QAP , 1997 .

[48]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[49]  Qingfu Zhang,et al.  Combination of Guided Local Search and Estimation of Distribution Algorithm for Quadratic Assignment Problems , 2006 .

[50]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[51]  Heinz Mühlenbein,et al.  The Equation for Response to Selection and Its Use for Prediction , 1997, Evolutionary Computation.

[52]  David E. Goldberg,et al.  Linkage Problem, Distribution Estimation, and Bayesian Networks , 2000, Evolutionary Computation.

[53]  John L. Bresina,et al.  Heuristic-Biased Stochastic Sampling , 1996, AAAI/IAAI, Vol. 1.

[54]  Mauricio G. C. Resende,et al.  A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set , 1994, Oper. Res..

[55]  Franz Rendl,et al.  QAPLIB – A Quadratic Assignment Problem Library , 1997, J. Glob. Optim..

[56]  Yaochu Jin,et al.  Knowledge incorporation in evolutionary computation , 2005 .

[57]  P. Hansen,et al.  Developments of Variable Neighborhood Search , 2002 .

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

[59]  José Luis González Velarde,et al.  A search heuristic for just-in-time scheduling in parallel machines , 1991, J. Intell. Manuf..

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

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

[62]  Rafael Martí,et al.  GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization , 1999, INFORMS J. Comput..

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

[64]  Xin Yao,et al.  A comparative study of three evolutionary algorithms incorporating different amounts of domain knowledge for node covering problem , 2005, IEEE Trans. Syst. Man Cybern. Part C.