The development of a sub-population genetic algorithm II (SPGA II) for multi-objective combinatorial problems

Previous research has shown that sub-population genetic algorithm is effective in solving the multi-objective combinatorial problems. Based on these pioneering efforts, this paper extends the SPGA algorithm with a global Pareto archive technique and a two-stage approach to solve the multi-objective problems. In the first stage, the areas next to the two single objectives are searched and solutions explored around these two extreme areas are reserved in the global archive for later evolutions. Then, in the second stage, larger searching areas except the middle area are further extended to explore the solution space in finding the near-optimal frontiers. Through extensive experimental results, SPGA II does outperform SPGA, NSGA II, and SPEA 2 in the parallel scheduling problems and knapsack problems; it shows that the approach improves the sub-population genetic algorithm significantly. It may be of interests for researchers in solving multi-objective combinatorial problems.

[1]  Gary B. Lamont,et al.  Explicit building-block multiobjective evolutionary algorithms for NPC problems , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[2]  Christine L. Mumford,et al.  Comparing representations and recombination operators for the multi-objective 0/1 knapsack problem , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[3]  John E. Beasley,et al.  A Genetic Algorithm for the Multidimensional Knapsack Problem , 1998, J. Heuristics.

[4]  Zbigniew Michalewicz,et al.  Genetic Algorithms for the 0/1 Knapsack Problem , 1994, ISMIS.

[5]  Joshua D. Knowles,et al.  On metrics for comparing nondominated sets , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

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

[7]  Maria João Alves,et al.  MOTGA: A multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem , 2007, Comput. Oper. Res..

[8]  Hisao Ishibuchi,et al.  Comparison Between Lamarckian and Baldwinian Repair on Multiobjective 0/1 Knapsack Problems , 2005, EMO.

[9]  Hideo Tanaka,et al.  Genetic algorithms and neighborhood search algorithms for fuzzy flowshop scheduling problems , 1994 .

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

[11]  Pei-Chann Chang,et al.  Two-phase sub population genetic algorithm for parallel machine-scheduling problem , 2005, Expert Syst. Appl..

[12]  Yuping Wang,et al.  Multiobjective programming using uniform design and genetic algorithm , 2000, IEEE Trans. Syst. Man Cybern. Part C.

[13]  Abdullah Al Mamun,et al.  An evolutionary artificial immune system for multi-objective optimization , 2008, Eur. J. Oper. Res..

[14]  Carlos A. Coello Coello,et al.  Handling multiple objectives with particle swarm optimization , 2004, IEEE Transactions on Evolutionary Computation.

[15]  Kalyanmoy Deb,et al.  A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II , 2000, PPSN.

[16]  Marco Laumanns,et al.  A Tutorial on Evolutionary Multiobjective Optimization , 2004, Metaheuristics for Multiobjective Optimisation.

[17]  Andrzej Jaszkiewicz,et al.  On the performance of multiple-objective genetic local search on the 0/1 knapsack problem - a comparative experiment , 2002, IEEE Trans. Evol. Comput..

[18]  A. Eiben,et al.  A multi-sexual genetic algorithm for multiobjective optimization , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[19]  Gary B. Lamont,et al.  Multiobjective evolutionary algorithms: classifications, analyses, and new innovations , 1999 .

[20]  Jürgen Teich,et al.  Covering Pareto-optimal fronts by subswarms in multi-objective particle swarm optimization , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[21]  Michael Affenzeller,et al.  New Generic Hybrids Based upon Genetic Algorithms , 2002, IBERAMIA.

[22]  Pei-Chann Chang,et al.  A Global Archive Sub-Population Genetic Algorithm with Adaptive Strategy in Multi-objective Parallel-Machine Scheduling Problem , 2006, ICNC.

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

[24]  D. Corne,et al.  On Metrics for Comparing Non Dominated Sets , 2001 .

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

[26]  Jianjun Hu,et al.  The Hierarchical Fair Competition (HFC) Framework for Sustainable Evolutionary Algorithms , 2005, Evolutionary Computation.

[27]  David Corne,et al.  A comparison of diverse approaches to memetic multiobjective combinatorial optimization , 2000 .

[28]  John W. Fowler,et al.  A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines , 2003, Comput. Oper. Res..

[29]  H. Ishibuchi,et al.  Effects of repair procedures on the performance of EMO algorithms for multiobjective 0/1 knapsack problems , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..