MICPSO: A method for incorporating dependencies into discrete particle swarm optimization

In this work, we present an extension to the recently developed Integer and Categorical Particle Swarm Optimization (ICPSO), which we refer to as Markovian ICPSO (MICPSO). MICPSO uses a Markov network to represent a particle's position, thus allowing each particle to incorporate information about dependencies between solution variables. In this work, we compare MICPSO to ICPSO, Integer PSO (IPSO), an Estimation of Distribution Algorithm called Markovianity-Based Optimization Algorithm (MOA), and a hillclimber on a set of benchmark vertex coloring problems. We find that MICPSO significantly outperforms all alternatives on all problems tested.

[1]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[2]  Martin Pelikan,et al.  An introduction and survey of estimation of distribution algorithms , 2011, Swarm Evol. Comput..

[3]  Alcherio Martinoli,et al.  Discrete Multi-Valued Particle Swarm Optimization , 2006 .

[4]  Lothar Thiele,et al.  A Comparison of Selection Schemes Used in Evolutionary Algorithms , 1996, Evolutionary Computation.

[5]  Ling Wang,et al.  An effective co-evolutionary particle swarm optimization for constrained engineering design problems , 2007, Eng. Appl. Artif. Intell..

[6]  Andries Petrus Engelbrecht,et al.  Fitness function evaluations: A fair stopping condition? , 2014, 2014 IEEE Symposium on Swarm Intelligence.

[7]  David S. Johnson,et al.  Some simplified NP-complete problems , 1974, STOC '74.

[8]  Alexander E. I. Brownlee,et al.  Multivariate Markov networks for fitness modelling in an estimation of distribution algorithm , 2009 .

[9]  Shane Strasser,et al.  A New Discrete Particle Swarm Optimization Algorithm , 2016, GECCO.

[10]  Ben Taskar,et al.  Learning associative Markov networks , 2004, ICML.

[11]  Shane Strasser,et al.  Factored Evolutionary Algorithms , 2017, IEEE Transactions on Evolutionary Computation.

[12]  Roberto Santana,et al.  Estimation of Distribution Algorithms with Kikuchi Approximations , 2005, Evolutionary Computation.

[13]  Gregory J. Chaitin,et al.  Register allocation & spilling via graph coloring , 1982, SIGPLAN '82.

[14]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[15]  Roberto Santana.  A Markov Network Based Factorized Distribution Algorithm for Optimization , 2003, ECML.

[16]  Qingfu Zhang,et al.  Fitness Modeling With Markov Networks , 2013, IEEE Transactions on Evolutionary Computation.

[17]  Carlo Mannino,et al.  Models and solution techniques for frequency assignment problems , 2003, 4OR.

[18]  Vibhav Gogate,et al.  A Complete Anytime Algorithm for Treewidth , 2004, UAI.

[19]  Gilbert Owusu,et al.  A fully multivariate DEUM algorithm , 2009, 2009 IEEE Congress on Evolutionary Computation.

[20]  Siddhartha Shakya,et al.  A Markovianity based optimisation algorithm , 2012, Genetic Programming and Evolvable Machines.

[21]  Kalyan Veeramachaneni,et al.  Probabilistically Driven Particle Swarms for Optimization of Multi Valued Discrete Problems : Design and Analysis , 2007, 2007 IEEE Swarm Intelligence Symposium.

[22]  Nir Friedman,et al.  Probabilistic Graphical Models - Principles and Techniques , 2009 .