A decomposition-based binary ACO algorithm for the multiobjective UBQP

The multiobjective unconstrained binary quadratic programming (mUBQP) is a combinatorial optimization problem which is able to represent several multiobjective optimization problems (MOPs). The problem can be characterized by the number of variables, the number of objectives and the objective correlation strength. Multiobjective evolutionary algorithms (MOEAs) are known as an efficient technique for solving MOPs. Moreover, several recent studies have shown the effectiveness of the MOEA/D framework applied to different MOPs. Previously, we have presented a preliminary study on an algorithm based on MOEA/D framework and the bio-inspired metaheuristic called binary ant colony optimization (BACO). The metaheuristic uses a positive feedback mechanism according to the best solutions found so far to update a probabilistic model which maintains the learned information. This paper presents the improved MOEA/D-BACO framework for solving the mUBQP. The components (i) mutation-like effect, and (ii) diversity preserving method are incorporated into the framework to enhance its search ability avoiding the premature convergence of the model and consequently maintaining a more diverse population of solutions. Experimental studies were conducted on a set of mUBQP instances. The results have shown that the proposed MOEA/D-BACO has outperformed MOEA/D, which uses genetic operators, in most of the test instances. Moreover, the algorithm has produced competitive results in comparison to the best approximated Pareto fronts from the literature.

[1]  Antonio J. Nebro,et al.  A Study of the Parallelization of the Multi-Objective Metaheuristic MOEA/D , 2010, LION.

[2]  Qingfu Zhang,et al.  MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.

[3]  Qingfu Zhang,et al.  A replacement strategy for balancing convergence and diversity in MOEA/D , 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).

[4]  Chongguo Li,et al.  Diversity Metrics in Multi-objective Optimization: Review and Perspective , 2007, 2007 IEEE International Conference on Integration Technology.

[5]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[6]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[7]  Hisao Ishibuchi,et al.  Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling , 2003, IEEE Trans. Evol. Comput..

[8]  F. Glover,et al.  Adaptive Memory Tabu Search for Binary Quadratic Programs , 1998 .

[9]  Aurora Trinidad Ramirez Pozo,et al.  MOEA/D-GM: Using probabilistic graphical models in MOEA/D for solving combinatorial optimization problems , 2015, ArXiv.

[10]  Hua Xu,et al.  Scale adaptive reproduction operator for decomposition based estimation of distribution algorithm , 2015, 2015 IEEE Congress on Evolutionary Computation (CEC).

[11]  Qingfu Zhang,et al.  An Evolutionary Many-Objective Optimization Algorithm Based on Dominance and Decomposition , 2015, IEEE Transactions on Evolutionary Computation.

[12]  Jiahai Wang,et al.  A directional-biased tabu search algorithm for multi-objective unconstrained binary quadratic programming problem , 2013, 2013 Sixth International Conference on Advanced Computational Intelligence (ICACI).

[13]  Concha Bielza,et al.  A review on probabilistic graphical models in evolutionary computation , 2012, Journal of Heuristics.

[14]  Peter J. Fleming,et al.  Generalized decomposition and cross entropy methods for many-objective optimization , 2014, Inf. Sci..

[15]  Saúl Zapotecas Martínez,et al.  Injecting CMA-ES into MOEA/D , 2015, GECCO.

[16]  Fang Liu,et al.  MOEA/D with Adaptive Weight Adjustment , 2014, Evolutionary Computation.

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

[18]  Sébastien Vérel,et al.  Experiments on Local Search for Bi-objective Unconstrained Binary Quadratic Programming , 2015, EMO.

[19]  Carlos A. Coello Coello,et al.  Using the Averaged Hausdorff Distance as a Performance Measure in Evolutionary Multiobjective Optimization , 2012, IEEE Transactions on Evolutionary Computation.

[20]  Sébastien Vérel,et al.  A hybrid metaheuristic for multiobjective unconstrained binary quadratic programming , 2014, Appl. Soft Comput..

[21]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation) , 2006 .

[22]  Roman Neruda,et al.  Incorporating User Preferences in MOEA/D through the Coevolution of Weights , 2015, GECCO.

[24]  Alexander Mendiburu,et al.  A Distance-Based Ranking Model Estimation of Distribution Algorithm for the Flowshop Scheduling Problem , 2014, IEEE Transactions on Evolutionary Computation.

[25]  Qingfu Zhang,et al.  MOEA/D with Tabu Search for multiobjective permutation flow shop scheduling problems , 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).

[26]  Fred W. Glover,et al.  Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems , 2010, Int. J. Metaheuristics.

[27]  Thomas Stützle,et al.  Ant Colony Optimization Theory , 2004 .

[28]  Aimin Zhou,et al.  A decomposition based estimation of distribution algorithm for multiobjective traveling salesman problems , 2013, Comput. Math. Appl..

[29]  Peter J. Fleming,et al.  Generalized Decomposition , 2013, EMO.

[30]  Siddhartha Shakya,et al.  A Review of Estimation of Distribution Algorithms and Markov Networks , 2012 .

[31]  Qingfu Zhang,et al.  MOEA/D-ACO: A Multiobjective Evolutionary Algorithm Using Decomposition and AntColony , 2013, IEEE Transactions on Cybernetics.

[32]  M. Dorigo,et al.  Ant System: An Autocatalytic Optimizing Process , 1991 .

[33]  Fred W. Glover,et al.  A unified modeling and solution framework for combinatorial optimization problems , 2004, OR Spectr..

[34]  Min Kong,et al.  Introducing a Binary Ant Colony Optimization , 2006, ANTS Workshop.

[35]  Fred W. Glover,et al.  The unconstrained binary quadratic programming problem: a survey , 2014, Journal of Combinatorial Optimization.

[36]  Heinz Mühlenbein,et al.  Optimal Mutation Rate Using Bayesian Priors for Estimation of Distribution Algorithms , 2001, SAGA.

[37]  Aurora Trinidad Ramirez Pozo,et al.  On the Design of Hard mUBQP Instances , 2016, GECCO.

[38]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[39]  Qingfu Zhang,et al.  Multiobjective Optimization Problems With Complicated Pareto Sets, MOEA/D and NSGA-II , 2009, IEEE Transactions on Evolutionary Computation.

[40]  Thomas Stützle,et al.  An experimental analysis of design choices of multi-objective ant colony optimization algorithms , 2012, Swarm Intelligence.

[41]  Aurora Trinidad Ramirez Pozo,et al.  Multiobjective Binary ACO for Unconstrained Binary Quadratic Programming , 2015, 2015 Brazilian Conference on Intelligent Systems (BRACIS).

[42]  Hong Li,et al.  MOEA/D + uniform design: A new version of MOEA/D for optimization problems with many objectives , 2013, Comput. Oper. Res..

[43]  Qingfu Zhang,et al.  Hybridization of Decomposition and Local Search for Multiobjective Optimization , 2014, IEEE Transactions on Cybernetics.

[44]  Kok Kiong Tan,et al.  A hybrid estimation of distribution algorithm for solving the multi-objective multiple traveling salesman problem , 2012, 2012 IEEE Congress on Evolutionary Computation.

[45]  Francisco Herrera,et al.  A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms , 2011, Swarm Evol. Comput..

[46]  Hisao Ishibuchi,et al.  A Study on the Specification of a Scalarizing Function in MOEA/D for Many-Objective Knapsack Problems , 2013, LION.

[47]  Hiroyuki Sato,et al.  MOEA/D using constant-distance based neighbors designed for many-objective optimization , 2015, 2015 IEEE Congress on Evolutionary Computation (CEC).

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

[49]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems , 2002, Genetic Algorithms and Evolutionary Computation.