A new hierarchical approach for MOPSO based on Dynamic subdivision of the population using Pareto fronts

Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

Volumn , Issue , 2010, Pages 947-954

  Fdhila, Raja ^a   Hamdani, Tarek M ^a   Alimi, Adel M ^a  

^a UNIVERSITY OF SFAX   (Tunisia)

Author keywords

Dynamic population; Multiobjective optimization; Pareto dominance; Pareto fronts

Indexed keywords

COMPARATIVE STUDIES; DYNAMIC POPULATION; FIXED SIZE; HIERARCHICAL APPROACH; HIERARCHICAL ARCHITECTURES; MULTI OBJECTIVE; ON DYNAMICS; OTHER ALGORITHMS; PARETO DOMINANCE; PARETO FRONT; SUB-POPULATIONS; TWO STAGE;

ALGORITHMS; CYBERNETICS; MATHEMATICAL OPERATORS; PARETO PRINCIPLE; POPULATION STATISTICS;

MULTIOBJECTIVE OPTIMIZATION;

EID: 78751491603     PISSN: 1062922X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSMC.2010.5641884     Document Type: Conference Paper

References (25)

1. J. Kennedy and R. Eberhart, "Particle Swarm Optimization " inProceedings of the 1995 IEEE International Conference on Neural Networks, Piscataway, New Jersey, IEEE Service Center, 1995, pages 1942-1948.
2. K. Deb, Multi-objective Optimization using Evolutionary Algorithms, Wiley, Chichester, UK, 2001.
3. S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi. Optimization by simulated annealing. Science, 220:671-680, 1983.
4. Goldberg, Algorithmes génétiques : exploration, optimisation et apprentissage automatique. Traduction de l'anglais (américain) par Vincent Corruble. Éditions Addison-Wesley France, 417 p.
5. S. Xiong and F. Li, "Parallel strength Pareto multi-objective evolutionaryalgorithm for optimization problems," in Proc. Congr. Evol. Comput., Canberra, Australia, 2003, pp. 2712-2718.
6. R. Brits, A. P. Engelbrecht, and F. van den Bergh, "Scalability of niche PSO ", in ProC. IEEE Swarm Intell. Sy mp., Indianapolis, IN, 2003, pp. 228-234.
7. M. R. Sierra and C. A. Coello Coello, "Multi-Objective Particle Swarm Optimizers: A Survey of the State-of-the-Art", in International Journal of Computational Intelligence Research. ISSN 0973-1873 Vol.2, No.3 (2006), pp. 287-308
8. M. R. Sierra and C. A. Coello Coello, "Improving PSO-based multi objective optimization using crowding, mutation and ε-dominance," in Proc. Evol. Multi-Criterion Optimization Conf., Guanajuato, Mexico, 2005, pp. 505-519.
9. Passaro and Starita, «Clustering particles for multimodal function optimization», in Proc. ECAI Workshop Eval. Comput. , Riva del Garda, Italy, 2006, pp. 124-131.
10. J. H. Seo, C. H. Lim, C. G. Heo, J. K. Kim, H. K. Jung, and C. C. Lee, "Multi modal function optimization based on particle swarm optimization," IEEE Trans. Magn., vol. 42, no. 4, pp. 1095-1098, Apr. 2006.
11. J. Zhang, D. S. Huang, T. M. Lok, and M. R. Lyu, "A novel adaptive sequential niche technique for multimodal function optimization," Neurocomputing, vol. 69, no. 16-18, pp. 2396-2401, Oct . 2006.
12. T. Blackwell and J. Branke, "Multiswarms, exclusion, and anticonvergencein dynamic environments," IEEE Trans. Evol. Comput., vol. 10, no. 4,pp. 459-472, Aug. 2006.
13. D. Parrott and X. Li, "Locating and tracking multiple dynamic optima by a particle swarm model using speciation," IEEE Trans. Evol. Comput., vol. 10, no. 4, pp. 440-458, Aug. 2006.
14. J. Kennedy, "Stereotyping: Improving particle swarm performance with cluster analysis," in Proc.Congr. Evol. Comput., San Diego, CA, 2000, pp. 1507-1512.
15. F. van den Bergh and A. P. Engelbrecht, "A cooperative approach to particle swarm optimization," IEEE Trans. Evol. Comput., vol. 8, no. 3, pp. 225-239, Jun. 2004.
16. G. T oscano 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.
17. W. F. Leong and G. G. Yen, "PSO-based multiobjective optimization with dynamic population size and adaptive local archives," IEEETrans. Syst., Man, Cybern. B, Cybern., vol. 38, no. 5, pp. 1270-1293, Oct . 2008.
18. D. A. Van Veldhuizen and G. B. Lamont, "Multiobjective Evolutionary Algorithm Research: A History and Analysis," Dept. Elec. Comput . Eng., Graduate School of Eng., Air Force Inst . Technol., Wright - Patterson, AFB, OH, Tech. Rep. TR-98-03, 1998.
19. K. Deb, A. Pratap, S. Agarwal, T. Meyarivan: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. on Evol. Computation 6 (2002) 182-197. (Pubitemid 34555372)
20. Jung-Sook Kim. "Distributed Genetic Algorithm with Multiple Populations Using Multi-agent ", international symposium on high performance computing No4, Kansai Science City , JAPON (15/05/2002)
21. Hamdani, T.M.; Alimi, A.M.; Karray, F. "Distributed Genetic Algorithm with Bi-Coded Chromosomes and a New Evaluation Function for Features Selection ", Evolutionary Computation, 2006.
22. K. Deb, A. Samir, P. Amrit and T. Meyarivan, A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: Nsga-ii, IEEE Transactions on Evolutionary Computation 6 (2) (2002), pp.103-112
23. Zitzler, Eckart and Laumanns, Marco and Thiele, Lothar (2001) SPEA2: Improving the Strength Pareto Evolutionary Algorithm. Evolutionary Methods for Design, Optimisation, and Control.
24. M. Laumans, L. Thiele, K. Deb, and E. Zitzler (2002). Combining convergence and diversity in evolutionary multi-objective optimization. Evolutionary Computation 10(3).
25. Kalyanmoy Deb, Amrit Pratap, Sameer Agarwal, and T. Meyarivan. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2):182-197, April 2002.