Exploratory study of sorting particle swarm optimizer for multiobjective design optimization

Mathematical and Computer Modelling

Volumn 52, Issue 11-12, 2010, Pages 1966-1975

  Feng, Yixiong ^a   Zheng, Bing ^b   Li, Zhongkai ^c  

^a ZHEJIANG UNIVERSITY   (China)

^b ZHEJIANG GONGSHANG UNIVERSITY   (China)

^c CHINA UNIVERSITY OF MINING AND TECHNOLOGY   (China)

Author keywords

Crowding distance; Multiobjective evolutionary algorithm; Multiobjective particle swarm optimization; Pareto optimal set; Standard test problems

Indexed keywords

CROWDING DISTANCE; MULTI OBJECTIVE PARTICLE SWARM OPTIMIZATION; MULTIOBJECTIVE EVOLUTIONARY ALGORITHM; PARETO-OPTIMAL SETS; STANDARD TEST PROBLEMS;

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; PARETO PRINCIPLE; PARTICLE SWARM OPTIMIZATION (PSO); PROBLEM SOLVING; SCREENING; STANDARDS;

MULTIOBJECTIVE OPTIMIZATION;

EID: 77956341291     PISSN: 08957177     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.mcm.2010.04.020     Document Type: Article

References (26)

1. Forouraghi B. Optimal tolerance allocation using a multiobjective particle swarm optimizer. International Journal of Advanced Manufacturing Technology 2009, 44(7-8):710-724.
2. Schaffer J.D. Multiobjective optimization with vector evaluated genetic algorithms. Proc of the 1st Int'1 Conf on Genetic Algorithms 1985, 93-100. Lawrence Erlbaum Associates, Inc., Mahwah. J.J. Grefenstette (Ed.).
3. Knowles J.D., Corne D.W. Approximating the nondominated front using the Pareto archived evolution strategy. Evolutionary Computation 2000, 8(2):149-172.
4. Srinivas N., Deb K. Multiobjective optimization using nondominated sorting in genetic algorithms. Evolutionary Computation 1994, 2(3):221-248.
5. Zitzler E., Thiele L. Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Transactions on Evolutionary Computation 1999, 3(4):257-271.
6. Deb K., Pratab A., Agarwal S., MeyArivan T. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 2002, 6(2):182-197.
7. E. Zitzler, M. Laumanns, L. Thiele, SPEA2: improving the strength Pareto evolutionary algorithm, Swiss Federal Institute of Technology, Tech Rep: 103, 2001.
8. J. Kennedy, R.C. Eberhart, Particle swarm optimization, in: Proc. of IEEE International Conference on Neutral Networks, vol. 4, Australia, 1995, pp. 1942-1948.
9. Yen G.G., Leong W.F. Dynamic multiple swarms in multiobjective particle swarm optimization. IEEE Transactions Systems, Man, and Cybernetics Part A: Systems and Humans 2009, 39(4):890-911.
10. Coello C.A., Pulido G.T., Lechuga M.S. Handling multiple objectives with particle swarm optimization. IEEE Transactions on Evolutionary Computation 2004, 8(3):256-279.
11. S. Bird, X. Li, Enhancing the robustness of a speciation-based PSO, in: Proc. Congr. Evol. Comput., Vancouver, BC, Canada, 2006, pp. 3185-3192.
12. Wang L., Liu Y.S., Xu Y.Q. Online elite archiving in multiobjective particle swarm optimization. Transactions of Beijing Institute of Technology 2006, 26(10):883-886.
13. G.T. Pulido, C.A. Coello, Using clustering techniques to improve the performance of a particle swarm optimizer, in: Proc. Genetic Evol. Comput. Conf., Seattle, WA, 2004, pp. 225-237.
14. Ho S.L., Yang S., Ni G., Lo E., et al. A particle swarm optimization-based method for multiobjective design optimizations. IEEE Transactions on Magnetics 2005, 41(5):1756-1759.
15. Blackwell T., Branke J. Multiswarms, exclusion, and anticonvergence in dynamic environments. IEEE Transactions on Evolutionary Computation 2006, 10(4):459-472.
16. X.D. Li, A nondominated sorting particle swarm optimizer for multiobjective optimization, in: E. Cantu-Paz et al. (Eds), Proc Genetic and Evolutionary Computation? GECCO 2003 - Part I, vol. 7, in: LNCS, vol. 2723, Berlin, Germany, 2003, pp. 37-48.
17. Xiong S.W., Liu L., Wang Q., Shi M. Improved multiobjective particle swarm algorithm. Journal of Wuhan University (Natural Science Edition) 2005, 51(3):308-312.
18. Alvarez-Benitez J.E., Everson R.M., Fieldsend J.E. A MOPSO algorithm based exclusively on Pareto dominance concepts. LNCS 2005, vol. 3410:459-473.
19. A. Passaro, A. Starita, Clustering particles for multimodal function optimization, in: Proc. ECAI Workshop Evol. Comput., Riva del Garda, Italy, 2006, pp. 124-131.
20. Liu D.S., Tan K.C., Goh C.K., Ho W.K. A multiobjective memtic algorithm based on particle swarm optimization. IEEE Transactions on Systems, Man and Cybernetics Part B: Cybernetics 2007, 37(1):42-50.
21. Veldhuizen D., Lamont G.B. Multiobjective evolutionary algorithms: analyzing the state-of-the-art. IEEE Transactions on Evolutionary Computation 2000, 18(2):125-147.
22. Clerc M., Kennedy J. The particle swarm: explosion stability and convergence in a multi-dimensional complex space. IEEE Transactions on Evolution Computer 2002, 6(1):58-73.
23. Jin X.L., Ma L.H., Liu B., Qian J.X. A fast multiobjective particle swarm optimization based on dynamic exchange strategy. Journal of Circuits and Systems 2007, 12(2):78-82.
24. K. Deb, L. Thiele, M. Laumanns, E. Zitzler, Scalable multiobjective optimization test problems, in: Proc of the 2002 Congress on Evolutionary Computation, 2002 pp. 825-830.
25. Zhang L.B., Zhou C.G., Ma M., Sun C. A multiobjective differential evolution algorithm based on max-min distance density. Journal of Computer Research and Development 2007, 44(1):177-184.
26. K. Deb, S. Jain, Multi-speed gearbox design using multiobjective evolutionary algorithms, KanGAL Report No. 2002001, 2002.