PSO-based multiobjective optimization with dynamic population size and adaptive local archives

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 38, Issue 5, 2008, Pages 1270-1293

  Leong, Wen Fung ^a   Yen, Gary G ^a  

^a Oklahoma State University   (United States)

Author keywords

Multiobjective optimization; Multiple swarm; Particle swarm optimization (PSO); Population size

Indexed keywords

ALGORITHMS; CHLORINE COMPOUNDS; COMPUTATIONAL COMPLEXITY; EVOLUTIONARY ALGORITHMS; OPTIMIZATION; PARTICLE SWARM OPTIMIZATION (PSO); POPULATION STATISTICS;

BENCH MARK TEST; COMPUTATIONAL COSTS; DYNAMIC POPULATION; MULTI OBJECTIVES; MULTI-OBJECTIVE EVOLUTIONARY ALGORITHMS; MULTI-OBJECTIVE OPTIMIZATION PROBLEMS; MULTIOBJECTIVE PARTICLE SWARM OPTIMIZATION; MULTIPLE SWARM; PERFORMANCE METRICS; POPULATION SIZE; POPULATION SIZES; SEARCH SPACES;

MULTIOBJECTIVE OPTIMIZATION;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; AUTOMATED PATTERN RECOGNITION; BIOMIMETICS; INFORMATION RETRIEVAL; METHODOLOGY; POPULATION DENSITY; SOCIAL BEHAVIOR;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BIOMIMETICS; INFORMATION STORAGE AND RETRIEVAL; PATTERN RECOGNITION, AUTOMATED; POPULATION DENSITY; SOCIAL BEHAVIOR;

EID: 52349086355     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCB.2008.925757     Document Type: Article

References (42)

1. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, "A fast and elitist multiobjective genetic algorithm: NSGA-II," IEEE Trans. Evol. Comput., vol. 6, no. 2, pp. 182-197, Apr. 2002.
2. E. Zitzler, M. Laumanns, and L. Thiele, "SPEA2: Improving the strength Pareto evolutionary algorithm," Swiss Federal Inst. Technol., Zurich, Switzerland, TIK-Rep. 103, 2001.
3. J. D. Knowles and D. W. Corne, "Approximating the nondominated front using the Pareto archived evolution strategy," Evol. Comput., vol. 8, no. 2, pp. 149-172, Jun. 2000.
4. X. Hu and R. C. Eberhart, "Multiobjective optimization using dynamic neighborhood particle swarm optimization," in Proc. Congr. Evol. Comput., Honolulu, HI, 2002, pp. 1677-1681.
5. T. Ray and K. M. Liew, "A swarm metaphor for multiobjective design optimization," Eng. Optim., vol. 34, no. 2, pp. 141-153, Mar. 2002.
6. L. B. Zhang, C. G. Zhou, X. H. Liu, Z. Q. Ma, M. Ma, and Y. C. Liang, "Solving multi objective problems using particle swarm optimization," in Proc. Congr. Evol. Comput., Canberra, Australia, 2003, pp. 2400-2405.
7. S. Mostaghim and J. Teich, "Strategies for finding good local grades in multi-objective particle swarm optimization," in Proc. IEEE Swarm Intell. Symp., Indianapolis, IN, 2003, pp. 26-33.
8. J. Branke and S. Mostaghim, "About selecting the personal best in multi-objective particle swarm optimization," in Proc. Conf. Parallel Probl. Solving Nature, Reykjavik, Iceland, 2006, pp. 523-532.
9. X. Hu, R. C. Eberhart, and Y. Shi, "Particle swarm with extended memory for multiobjective optimization," in Proc. IEEE Swarm Intell. Symp. Indianapolis, IN, 2003, pp. 193-197.
10. J. E. Fieldsand and S. Singh, "A multi-objective algorithm based upon particle swarm optimization, an efficient data structure and turbulence," in Proc. U.K. Workshop Comput. Intell., Birmingham, U.K., 2002, pp. 37-44.
11. S. Mostaghim and J. Teich, "The role of ε-dominance in multi-objective particle swarm optimization methods," in Proc. Congr. Evol. Comput. Canberra, Australia, 2003, pp. 1764-1771.
12. X. Li, "A non-dominated sorting particle swarm optimizer for multiobjective optimization," in Proc. Genetic Evol. Comput. Conf. 2003, pp. 37-48.
13. C. A. Coello Coello and M. S. Lechuga, "MOPSO: A proposal for multiple objective particle swarm optimization," in Proc. Congr. Evol. Comput., Honolulu, HI, 2002, pp. 1051-1056.
14. C. A. Coello Coello, G. Toscano Pulido, and M. S. Lechuga, "Handling multiple objectives with particle swarm optimization," IEEE Trans. Evol. Comput., vol. 8, no. 3, pp. 256-279, Jun. 2004.
15. M. R. Sierra and C. A. Coello Coello, "Improving PSO-based multi-objective optimization using crowding, mutation and ε-dominance," in Proc. Evol. Multi-Criterion Optim. Conf., Guanajuato, Mexico, 2005, pp. 505-519.
16. M. J. Reddy and D. N. Kumar, "An efficient multi-objective optimization algorithm based on swarm intelligence for engineering design," Eng. Optim., vol. 39, no. 1, pp. 49-68, Jan. 2007.
17. G. Toscano Pulido and C. A. Coello 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.
18. X. Li, "Better spread and convergence: Particle swarm multiobjective optimization using the maximin fitness function," in Proc. Genetic Evol. Comput. Conf., Seattle, WA, 2004, pp. 117-128.
19. S. Mostaghim and J. Teich, "Covering Pareto-optimal fronts by subswarms in multi-objective particle swarm optimization," in Proc. Congr. Evol. Comput., Portland, OR, 2004, pp. 1404-1411.
20. R. L. Becerra, C. A. Coello Coello, A. G. Hernández-Diaz, R. Caballero, and J. Molina, "Alternative technique to solve hard multi-objective optimization problems," in Proc. Genetic Evol. Comput. Conf., London, U.K., 2007, pp. 757-764.
21. J. Arabas, Z. Michalewicz, and J. Mulawka, "GAVaPS - A genetic algorithm with varying population size," in Proc. Congr. Evol. Comput., Orlando, FL, 1994, pp. 73-74.
22. N. Zhuang, M. Benten, and P. Cheung, "Improved variable ordering of BBDS with novel genetic algorithm," in Proc. IEEE Int. Symp. Circuits Syst., Atlanta, GA, 1996, pp. 414-417.
23. J. Grefenstette, "Optimization of control parameters for genetic algorithms," IEEE Trans. Syst., Man, Cybern., vol. SMC-16, no. 1, pp. 122-128, Jan. 1986.
24. Alander, "On optimal population size of genetic algorithms," in Proc. IEEE Int. Conf. Comput. Syst. Softw. Eng., Silver Spring, MD, 1992, pp. 65-70.
25. K. C. Tan, T. H. Lee, and E. F. Khor, "Evolutionary algorithms with dynamic population size and local exploration for multiobjective optimization," IEEE Trans. Evol. Comput., vol. 5, no. 6, pp. 565-588, Dec. 2001.
26. G. G. Yen and H. Lu, "Dynamic multiobjective evolutionary algorithm: Adaptive cell-based rank and density estimation," IEEE Trans. Evol. Comput., vol. 7, no. 3, pp. 253-274, Jun. 2003.
27. J. Kennedy and R. C. Eberhart, "Particle swarm optimization," in Proc. Int. Joint Conf. Neural Netw., Perth, Australia, 1995, pp. 1942-1948.
28. Y. Shi and R. C. Eberhart, "A modified particle swarm optimizer," in Proc. Congr. Evol. Comput., Anchorage, AK, 1998, pp. 69-73.
29. H. Lu and G. G. Yen, "Rank-density-based multiobjective genetic algorithm and benchmark test function study," IEEE Trans. Evol. Comput., vol. 7, no. 4, pp. 325-343, Aug. 2003.
30. C. A. Coello Coello and E. M. Montes, "Constraint-handling in genetic algorithms through the use of dominance-based tournament selection," Adv. Eng. Inf., vol. 16, no. 3, pp. 193-203, Jul. 2002.
31. J.E. Alvarez-Benitez, R. M. Everson, and J. E. Fieldsend, "A MOPSO algorithm based exclusively on Pareto dominance concepts," in Proc. Evol. Multi-Criterion Optim. Conf., Guanajuato, Mexico, 2005, pp. 459-473.
32. J. D. Knowles and D. W. Corne, "M-PAES: A memetic algorithm for multiobjective optimization," in Proc. Congr. Evol. Comput., La Jolla, CA, 2000, pp. 325-332.
33. E. Zitler, "Evolutionary algorithms for multiobjective optimization: Methods and applications," Ph.D dissertation, Swiss Federal Inst. Technol., Zurich, Switzerland, 1999.
34. J. D. Knowles, L. Thiele, and E. Zitzler, "A tutorial on performance assessment of stochastic multiobjective optimizers," Comput. Eng. Netw. Lab., ETH Zurich, Zurich, Switzerland, pp. 1-35, TIK-Rep. No. 214, Feb. 2006. (revised version).
35. E. Zitzler, L. Thiele, M. Laumanns, C. M. Fonseca, and V. G. da Fonseca, "Performance assessment of multiobjective optimizers: An analysis and review," IEEE Trans. Evol. Comput., vol. 7, no. 2, pp. 117-132, Apr. 2003.
36. E. Zitzler, K. Deb, and L. Thiele, "Comparison of multiobjective evolutionary algorithms: Empirical results," Evol. Comput., vol. 8, no. 2, pp. 173-195, 2000.
37. K. Deb, L. Thiele, M. Laumanns, and E. Zitzler, "Scalable test problems for evolutionary multi-objective optimization," Swiss Federal Inst. Technol., Zurich, Switzerland, Tech. Rep. 112, 2001.
38. PISA website. [Online]. Available: http://www.tik.ee.ethz.ch/pisa/
39. D. A. Van Veldhuizen and G. B. Lamount, "Multiobjective evolutionary algorithm research: A history and analysis," Dept. Elect. Comput. Eng., Air Force Inst. Technol., Wright-Patterson AFB, OH, Tech. Rep. TR-98-03, 1998.
40. C. Grosan, C. Dumitrescu, and D. Lazar, "A particle swarm optimization for solving 0/1 knapsack problem," in Proc. Int. Conf. Comput. Commun., Oradea, Romania, 2004, pp. 200-204.
41. H. S. Lope and L. S. Coelho, "Particle swarm optimization with fast local search for the blind traveling salesman problem," in Proc. Int. Conf. Hybrid Intell. Syst., Sao Paulo, Brazil, 2005, pp. 245-250.
42. S.A. Zonouz, J. Habibi, and M. Saniee, "A hybrid PS-based optimization algorithm for solving traveling salesman problem," in Proc. IEEE Int. Symp. Front. Netw. Appl., Vienna, Austria, 2006, pp. 245-250.