Dependency trees, permutations, and quadratic assignment problem

This paper describes and analyzes an estimation of distribution algorithm based on dependency tree models (dtEDA), which can explicitly encode probabilistic models for permutations. dtEDA is tested on deceptive ordering problems and a number of instances of the quadratic assignment problem. The performance of dtEDA is compared to that of the standard genetic algorithm with the partially matched crossover (PMX) and the linear order crossover (LOX). In the quadratic assignment problem, the robust tabu search is also included in the comparison.

[1]  R. A. Leibler,et al.  On Information and Sufficiency , 1951 .

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

[3]  Emanuel Falkenauer,et al.  A genetic algorithm for job shop , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[4]  Thomas Stützle,et al.  An Ant Approach to the Flow Shop Problem , 1998 .

[5]  David E. Goldberg,et al.  OMEGA - Ordering Messy GA: Solving Permutation Problems with the Fast Genetic Algorithm and Random Keys , 2000, GECCO.

[6]  M. Pelikán,et al.  The Bivariate Marginal Distribution Algorithm , 1999 .

[7]  Vassilis Zissimopoulos,et al.  On the landscape ruggedness of the quadratic assignment problem , 2001, Theor. Comput. Sci..

[8]  Franz Rothlauf,et al.  Representations for genetic and evolutionary algorithms , 2002, Studies in Fuzziness and Soft Computing.

[9]  Dirk Thierens,et al.  New IDEAs and more ICE by learning and using unconditional permutation factorizations , 2001 .

[10]  Panos M. Pardalos,et al.  Generating quadratic assignment test problems with known optimal permutations , 1992, Comput. Optim. Appl..

[11]  P. Bosman,et al.  Continuous iterated density estimation evolutionary algorithms within the IDEA framework , 2000 .

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

[13]  Frank Harary,et al.  Graph Theory , 2016 .

[14]  Pedro Larrañaga,et al.  Solving the Traveling Salesman Problem with EDAs , 2002, Estimation of Distribution Algorithms.

[15]  Kalyanmoy Deb,et al.  Ordering Genetic Algorithms and Deception , 1992, PPSN.

[16]  Georges R. Harik,et al.  Finding Multimodal Solutions Using Restricted Tournament Selection , 1995, ICGA.

[17]  Carvalho,et al.  Microarray Layout and the Quadratic Assignment Problem , 2006 .

[18]  H. Mühlenbein,et al.  From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.

[19]  Eric Angela,et al.  On the landscape ruggedness of the quadratic assignment problem , 2001 .

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

[21]  Max Henrion,et al.  Propagating uncertainty in bayesian networks by probabilistic logic sampling , 1986, UAI.

[22]  David E. Goldberg,et al.  Scalability of the Bayesian optimization algorithm , 2002, Int. J. Approx. Reason..

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

[24]  David E. Goldberg,et al.  Node Histogram vs . Edge Histogram : A Comparison of PMBGAs in Permutation Domains , 2006 .

[25]  C. N. Liu,et al.  Approximating discrete probability distributions with dependence trees , 1968, IEEE Trans. Inf. Theory.

[26]  David E. Goldberg,et al.  A Survey of Optimization by Building and Using Probabilistic Models , 2002, Comput. Optim. Appl..

[27]  Shumeet Baluja,et al.  A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning , 1994 .

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

[29]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[30]  Heinz Mühlenbein,et al.  FDA -A Scalable Evolutionary Algorithm for the Optimization of Additively Decomposed Functions , 1999, Evolutionary Computation.

[31]  Dieter Jungnickel,et al.  Graphs, Networks, and Algorithms , 1980 .

[32]  Sven Rahmann,et al.  Microarray Layout as Quadratic Assignment Problem , 2006, German Conference on Bioinformatics.

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

[34]  Dirk Thierens,et al.  Crossing the road to efficient IDEAs for permutation problems , 2001 .

[35]  S. Baluja,et al.  Using Optimal Dependency-Trees for Combinatorial Optimization: Learning the Structure of the Search Space , 1997 .

[36]  Daniel Merkle,et al.  On solving permutation scheduling problems with ant colony optimization , 2005, Int. J. Syst. Sci..

[37]  Franz Rothlauf,et al.  Evaluation-Relaxation Schemes for Genetic and Evolutionary Algorithms , 2004 .

[38]  George G. Polak.  On A Special Case of the Quadratic Assignment Problem with an Application to Storage-and-Retrieval Devices , 2005, Ann. Oper. Res..

[39]  Franz Rothlauf,et al.  Network Random KeysA Tree Representation Scheme for Genetic and Evolutionary Algorithms , 2002, Evolutionary Computation.

[40]  David E. Goldberg,et al.  Solving Sequence Problems by Building and Sampling Edge Histograms , 2002 .

[41]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[42]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[43]  T. Koopmans,et al.  Assignment Problems and the Location of Economic Activities , 1957 .

[44]  David E. Goldberg,et al.  Alleles, loci and the traveling salesman problem , 1985 .

[45]  Martin Pelikan,et al.  Hierarchical Bayesian optimization algorithm: toward a new generation of evolutionary algorithms , 2010, SICE 2003 Annual Conference (IEEE Cat. No.03TH8734).

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

[47]  Martin Pelikan,et al.  Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications (Studies in Computational Intelligence) , 2006 .