An effective model of multiple multi-objective evolutionary algorithms with the assistance of regional multi-objective evolutionary algorithms: VIPMOEAs

Division of the evolutionary search among multiple multi-objective evolutionary algorithms (MOEAs) is a recent advantage in MOEAs design, particularly in effective parallel and distributed MOEAs. However, most these algorithms rely on such a central (re) division that affects the algorithms' efficiency. This paper first proposes a local MOEA that searches on a particular region of objective space with its novel evolutionary selections. It effectively searches for Pareto Fronts (PFs) inside the given polar-based region, while nearby the region is also explored, intelligently. The algorithm is deliberately designed to adjust its search direction to outside the region - but nearby - in the case of a region with no Pareto Front. With this contribution, a novel island model is proposed to run multiple forms of the local MOEA to improve a conventional MOEA (e.g. NSGA-II or MOEA/D) running along - in another island. To dividing the search, a new division technique is designed to give particular regions of objective space to the local MOEAs, frequently and effectively. Meanwhile, the islands benefit from a sophisticated immigration strategy without any central (re) collection, (re) division and (re) distribution acts. Results of three experiments have confirmed that the proposed island model mostly outperforms to the clustering MOEAs with similar division technique and similar island models on DTLZs. The model is also used and evaluated on a real-world combinational problem, flexible logistic network design problem. The model definitely outperforms to a similar island model with conventional MOEA (NSGA-II) used in each island.

[1]  Antoni Wibowo,et al.  A flexible three-level logistic network design considering cost and time criteria with a multi-objective evolutionary algorithm , 2013, J. Intell. Manuf..

[2]  Pei-Chann Chang,et al.  The development of a sub-population genetic algorithm II (SPGA II) for multi-objective combinatorial problems , 2009, Appl. Soft Comput..

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

[4]  Mitsuo Gen,et al.  Network Models and Optimization: Multiobjective Genetic Algorithm Approach , 2008 .

[5]  Carlos A. Coello Coello,et al.  Evolutionary multi-objective optimization: a historical view of the field , 2006, IEEE Comput. Intell. Mag..

[6]  Eckart Zitzler,et al.  Evolutionary algorithms for multiobjective optimization: methods and applications , 1999 .

[7]  Pei-Chann Chang,et al.  Sub-population genetic algorithm with mining gene structures for multiobjective flowshop scheduling problems , 2007, Expert Syst. Appl..

[8]  Kalyanmoy Deb,et al.  Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.

[9]  Kiyoshi Tanaka,et al.  Local Dominance Including Control of Dominance Area of Solutions in MOEAs , 2007, 2007 IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making.

[10]  Carlos A. Coello Coello,et al.  pMODE-LD+SS: An Effective and Efficient Parallel Differential Evolution Algorithm for Multi-Objective Optimization , 2010, PPSN.

[11]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[12]  Gary B. Lamont,et al.  Considerations in engineering parallel multiobjective evolutionary algorithms , 2003, IEEE Trans. Evol. Comput..

[13]  Kalyanmoy Deb,et al.  Distributed Computing of Pareto-Optimal Solutions with Evolutionary Algorithms , 2003, EMO.

[14]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .

[15]  Kalyanmoy Deb,et al.  Parallelizing multi-objective evolutionary algorithms: cone separation , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[16]  Kiyoshi Tanaka,et al.  Local dominance using polar coordinates to enhance multiobjective evolutionary algorithms , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[17]  Alejandro Sierra,et al.  The polar evolution strategy , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[18]  Hussein A. Abbass,et al.  Local models—an approach to distributed multi-objective optimization , 2009, Comput. Optim. Appl..

[19]  Yongquan Yu,et al.  A novel evolution strategy algorithm based on the selected direction by the polar coordinates , 2006, 2006 1st International Symposium on Systems and Control in Aerospace and Astronautics.

[20]  Kiyoshi Tanaka,et al.  Local dominance and local recombination in MOEAs on 0/1 multiobjective knapsack problems , 2007, Eur. J. Oper. Res..

[21]  Günter Rudolph,et al.  Parallel Approaches for Multiobjective Optimization , 2008, Multiobjective Optimization.

[22]  Andreas Zell,et al.  Parallelization of Multi-objective Evolutionary Algorithms Using Clustering Algorithms , 2005, EMO.

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