IJEME Vol. 1, No. 3, 29 Sep. 2011
Cover page and Table of Contents: PDF (size: 238KB)
Full Text (PDF, 238KB), PP.79-86
Views: 0 Downloads: 0
Evolutionary algorithm, multi-objective optimization, hybrid, adaptive, non-dominated solution
An improved multi-objective evolutionary algorithm with the hybrid strategies is presented in this paper for multi-objective optimization problems. The evolution process is divided into initial exploration stage, the middle feedback stage and the accelerating convergence stage by the amount of non-dominated individuals in the population. The hybrid strategies and adaptive population structure are employed to improve the behavior of the algorithm at the different stages. The proposed algorithm is validated by 3 benchmark test problems. Compared with three other famous multi-objective algorithms by two quality indicators, the proposed algorithm achieves competitive results.
Gao Guibing,Huang Gang,Zhang Guojun,"An Improved Multi-objective Evolutionary Algorithm with the Hybrid Strategies", IJEME, vol.1, no.3, pp.79-86, 2011. DOI: 10.5815/ijeme.2011.03.12
[1].Coello C.A.C. Evolutionary multiobjective optimization: A historical view of the field [J]. IEEE Computational Intelligence Magazine, 1; 2006.pp 28–36.
[2].DEB, K.,A. PRATAP, S. AGARWAL, and T.MEYARIVAN. A fast and elitist multiobjective genetic algorithm: NSGA-II[C]. IEEE Transactions on Evolutionary Computation, 6, 2002a. pp:182–197.
[3].Deb K, Goel T. Controlled elist non-dominated sorting genetic algorithms for better convergence [C]. 1st Int Conf on Evolutionary Multi-criterion Optimization. Zurich : Springer-Verlag , 2001 : 67-81.
[4].SHEN Xiaoning, GUO Yu, CHEN Qingwei, HU Weili. Multi-objective optimization genetic algorithm keeping diversity of population[J]. Control and Decision.Vol. 23 No. 12, 2008 pp 1435-1440
[5].Jinhua Zheng, et all. A Multi-objective Genetic Algorithm Based on Quick Sort[C], conference on artificial intelligence CAI 2004 Canada , pp:175-186
[6].Zitzler E., M. Laumanns and L. Thiele. SPEA2: Improving the Strength ParetoEvolutionary Algorithm. Technical Report 103, Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH) Zurich, Gloriastrasse 35,CH-8092 Zurich, Switzerland. 2001
[7].CORNE D. W., N. R. JERRAM, J. D. KNOWLES, and M. J. OATES. PESA-II: Region-based selection in evolutionary multiobjective optimization[C]. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), Morgan Kaufmann Publishers, San Francisco, CA, 2001.pp 283–290.
[8].SHI Ruifeng , ZHOU Hong , SHANG Guan Chunxia. A Hybrid Escalating Multi-objective Evolutionary Algorithm with Its Application to Flow Shop Problems [J]. Systems engineering-Theory & Practice 2006.8 pp101-109
[9].BAI Zhijiang, LIU Guangzhong. Recursive multiple objective genetic algorithms. Journal of ShanghaiMaritime University[J]. 2007.6 pp62-67
[10].GLOVER FW, LAGUNA M. Tabu search [M ]. Norwell, MA: Kluwer Academic Publishers, 1998.
[11].Jon L. Bentley and Robert Sedgewick, Fast Algorithms for Sorting and Searching Strings, Proc. 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1997. pp 360-369,.
[12].J. Schaffer, “Multiple objective optimization with vector evaluated genetic algorithms,” in First International Conference on Genetic Algorithms, J. Grefensttete, Ed., Hillsdale, NJ, 1987. pp 93–100.
[13].E. Zitzler, K. Deb, and L. Thiele, “Comparison of multiobjective evolutionary algorithms: Empirical results,” Evolutionary Computation, vol. 8, no. 2, 2000. pp 173–195
[14].Van Veldhuizen, D.A., and G.B. Lamont. On Measuring Multiobjective Evolutionary Algorithm Performance, 2000 IEEE Congress on Evolutionary Computation, 1, 2000. pp 204-211.
[15].A. J. Nebro, E. Alba, and F. Luna, “Multi-objective optimization using grid computing,” Soft Computing, vol. 11, no. 6, 2007. pp 531–540
[16].McGill R, Tukey JW, Larsen WA. Variations of boxplots. The American Statistician, 1978,32(1):12−16.