Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2016, Article ID 6761545, 15 pages
http://dx.doi.org/10.1155/2016/6761545
Research Article

A Decomposition-Based Unified Evolutionary Algorithm for Many-Objective Problems Using Particle Swarm Optimization

School of Electronics and Information, Tongji University, Shanghai 201804, China

Received 2 June 2016; Revised 24 October 2016; Accepted 26 October 2016

Academic Editor: Giuseppe Vairo

Copyright © 2016 Anqi Pan et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, “A fast and elitist multiobjective genetic algorithm: NSGA-II,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 2, pp. 182–197, 2002. View at Publisher · View at Google Scholar · View at Scopus
  2. E. Zitzler, M. Laumanns, and L. Thiele, SPEA2: Improving the Strength Pareto Evolutionary Algorithm, 2001.
  3. C. A. C. Coello, G. T. Pulido, and M. S. Lechuga, “Handling multiple objectives with particle swarm optimization,” IEEE Transactions on Evolutionary Computation, vol. 8, no. 3, pp. 256–279, 2004. View at Publisher · View at Google Scholar · View at Scopus
  4. W. Guo, M. Chen, L. Wang, and Q. Wu, “Hyper multi-objective evolutionary algorithm for multi-objective optimization problems,” Soft Computing, 2016. View at Publisher · View at Google Scholar
  5. S. Bandyopadhyay and A. Mukherjee, “An algorithm for many-objective optimization with reduced objective computations: a study in differential evolution,” IEEE Transactions on Evolutionary Computation, vol. 19, no. 3, pp. 400–413, 2015. View at Publisher · View at Google Scholar · View at Scopus
  6. J. Molina, L. V. Santana, A. G. Hernández-Díaz, C. A. Coello Coello, and R. Caballero, “g-dominance: reference point based dominance for multiobjective metaheuristics,” European Journal of Operational Research, vol. 197, no. 2, pp. 685–692, 2009. View at Publisher · View at Google Scholar · View at Scopus
  7. M. Farina and P. Amato, “A fuzzy definition of ‘optimality’ for many-criteria optimization problems,” IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans., vol. 34, no. 3, pp. 315–326, 2004. View at Publisher · View at Google Scholar · View at Scopus
  8. J. Xiao, K. Wang, and X. Bi, “Multi-objective evolutionary algorithm based on improved k-dominated sorting,” Control and Decision, vol. 29, no. 12, pp. 2165–2170, 2014. View at Google Scholar
  9. O. Schütze, “A new data structure for the nondominance problem in multi-objective optimization,” in Evolutionary Multi-Criterion Optimization, C. M. Fonseca, P. J. Fleming, E. Zitzler, L. Thiele, and K. Deb, Eds., vol. 2632 of Lecture Notes in Computer Science, pp. 509–518, Springer, Berlin, Germany, 2003. View at Publisher · View at Google Scholar
  10. H. Sato, H. E. Aguirre, and K. Tanaka, “Controlling dominance area of solutions and its impact on the performance of moeas,” in Evolutionary Multi-Criterion Optimization: 4th International Conference, EMO 2007, Matsushima, Japan, March 5–8, 2007. Proceeding, vol. 4403 of Lecture Notes in Computer Science, pp. 5–20, Springer, Berlin, Germany, 2007. View at Publisher · View at Google Scholar
  11. M. Laumanns, L. Thiele, K. Deb, and E. Zitzler, “Combining convergence and diversity in evolutionary multiobjective optimization,” Evolutionary Computation, vol. 10, no. 3, pp. 263–282, 2002. View at Publisher · View at Google Scholar · View at Scopus
  12. C. Luo, K. Shimoyama, and S. Obayashi, “A study on many-objective optimization using the kriging-surrogate-based evolutionary algorithm maximizing expected hypervolume improvement,” Mathematical Problems in Engineering, vol. 2015, Article ID 162712, 15 pages, 2015. View at Publisher · View at Google Scholar · View at Scopus
  13. K. McClymont and E. Keedwell, “Deductive sort and climbing sort: new methods for non-dominated sorting,” Evolutionary Computation, vol. 20, no. 1, pp. 1–26, 2012. View at Publisher · View at Google Scholar · View at Scopus
  14. H. Wang and X. Yao, “Corner sort for pareto-based many-objective optimization,” IEEE Transactions on Cybernetics, vol. 44, no. 1, pp. 92–102, 2014. View at Publisher · View at Google Scholar · View at Scopus
  15. Q. Zhang and H. Li, “Moea/d: a multiobjective evolutionary algorithm based on decomposition,” IEEE Transactions on Evolutionary Computation, vol. 11, no. 6, pp. 712–731, 2007. View at Publisher · View at Google Scholar · View at Scopus
  16. K. Li, K. Deb, Q. Zhang, and S. Kwong, “An evolutionary many-objective optimization algorithm based on dominance and decomposition,” IEEE Transactions on Evolutionary Computation, vol. 19, no. 5, pp. 694–716, 2015. View at Publisher · View at Google Scholar
  17. X. Ma, Y. Qi, L. Li, F. Liu, L. Jiao, and J. Wu, “MOEA/D with uniform decomposition measurement for many-objective problems,” Soft Computing, vol. 18, no. 12, pp. 2541–2564, 2014. View at Publisher · View at Google Scholar · View at Scopus
  18. D. Cai and W. Yuping, “A new uniform evolutionary algorithm based on decomposition and CDAS for many-objective optimization,” Knowledge-Based Systems, vol. 85, pp. 131–142, 2015. View at Publisher · View at Google Scholar · View at Scopus
  19. D.-W. Gong, Y.-P. Liu, X.-Y. Sun, and Y.-Y. Han, “Parallel many-objective evolutionary optimization using objectives decomposition,” Acta Automatica Sinica, vol. 41, no. 8, pp. 1438–1451, 2015. View at Publisher · View at Google Scholar · View at Scopus
  20. H. Wang and X. Yao, “Objective reduction based on nonlinear correlation information entropy,” Soft Computing, vol. 20, no. 6, pp. 2393–2407, 2016. View at Publisher · View at Google Scholar
  21. Z.-X. Chen, X.-H. Yan, K.-A. Wu, and M. Bai, “Many-objective optimization integrating open angle based congestion control strategy,” Acta Automatica Sinica, vol. 41, no. 6, pp. 1145–1158, 2015. View at Publisher · View at Google Scholar · View at Scopus
  22. K. Praditwong and X. Yao, “A new multi-objective evolutionary optimisation algorithm: the two-archive algorithm,” in Computational Intelligence and Security: International Conference, CIS 2006. Guangzhou, China, November 3–6, 2006. Revised Selected Papers, vol. 4456 of Lecture Notes in Computer Science, pp. 95–104, Springer, Berlin, Germany, 2007. View at Publisher · View at Google Scholar
  23. W. Guo, L. Wang, and Q. Wu, “Numerical comparisons of migration models for Multi-objective Biogeography-Based Optimization,” Information Sciences, vol. 328, pp. 302–320, 2016. View at Publisher · View at Google Scholar · View at Scopus
  24. P. K. Tripathi, S. Bandyopadhyay, and S. K. Pal, “Multi-objective particle swarm optimization with time variant inertia and acceleration coefficients,” Information Sciences, vol. 177, no. 22, pp. 5033–5049, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  25. W. Hu, G. G. Yen, and X. Zhang, “Multiobjective particle swarm optimization based on Pareto entropy,” Journal of Software, vol. 25, no. 5, pp. 1025–1050, 2014. View at Publisher · View at Google Scholar · View at Scopus
  26. W. Peng and Q. F. Zhang, “A decomposition-based multi-objective particle swarm optimization algorithm for continuous optimization problems,” in Proceedings of the 2008 IEEE International Conference on Granular Computing (GRC '08), vol. 1-2, pp. 534–537, Hangzhou, China, August 2008. View at Publisher · View at Google Scholar · View at Scopus
  27. L. Wang, J.-N. Shen, S.-Y. Wang, and J. Deng, “Advances in co-evolutionary algorithms,” Control and Decision, vol. 30, no. 2, pp. 193–202, 2015. View at Publisher · View at Google Scholar · View at Scopus
  28. J. E. Alvarez-Benitez, R. M. Everson, and J. E. Fieldsend, “A MOPSO algorithm based exclusively on pareto dominance concepts,” in Evolutionary Multi-Criterion Optimization, C. A. Coello Coello, A. H. Aguirre, and E. Zitzler, Eds., vol. 3410 of Lecture Notes in Computer Science, pp. 459–473, Springer, Berlin, Germany, 2005. View at Publisher · View at Google Scholar
  29. J. Healer, D. Mcguinness, R. Carter, and E. Riley, “A niched pareto genetic algorithm for multiobjective optimization,” in Proceedings of the 1st IEEE Conference on Evolutionary Computation, IEEE World Congress on Computational Intelligence, vol. 1, pp. 82–87, 1994.
  30. J. D. Knowles and D. W. Corne, “Approximating the nondominated front using the pareto archived evolution strategy,” Evolutionary Computation, vol. 8, no. 2, pp. 149–172, 2000. View at Publisher · View at Google Scholar · View at Scopus
  31. W. Guo, W. Li, Q. Zhang, L. Wang, Q. Wu, and H. Ren, “Biogeography-based particle swarm optimization with fuzzy elitism and its applications to constrained engineering problems,” Engineering Optimization, vol. 46, no. 11, pp. 1465–1484, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  32. Y. Zhang, X. Xiong, and Q. Zhang, “An improved self-adaptive PSO algorithm with detection function for multimodal function optimization problems,” Mathematical Problems in Engineering, vol. 2013, Article ID 716952, 8 pages, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  33. K. E. Parsopoulos and M. N. Vrahatis, “Parameter selection and adaptation in unified particle swarm optimization,” Mathematical and Computer Modelling, vol. 46, no. 1-2, pp. 198–213, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  34. J. Branke and S. Mostaghim, Parallel Problem Solving from Nature—PPSN IX, About Selecting the Personal Best in Multi-Objective Particle Swarm Optimization, Springer, Berlin, Germany, 2006.
  35. I. Das and J. E. Dennis, “Normal-boundary intersection: a new method for generating the Pareto surface in nonlinear multicriteria optimization problems,” SIAM Journal on Optimization, vol. 8, no. 3, pp. 631–657, 1998. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  36. D. Xiaodong, G. A. O. Hongxia, L. I. U. Xiangdong, and Z. Xuedong, “Adaptive particle swarm optimization algorithm based on population entropy,” Computer Engineering, vol. 33, no. 18, pp. 222–248, 2007. View at Google Scholar
  37. Z.-G. Lu, H. Zhao, H.-F. Xiao, H.-R. Wang, and H.-J. Wang, “An improved multi-objective bacteria colony chemotaxis algorithm and convergence analysis,” Applied Soft Computing Journal, vol. 31, pp. 224–292, 2015. View at Publisher · View at Google Scholar · View at Scopus
  38. N. Al Moubayed, A. Petrovski, and J. McCall, “D2 MOPSO: MOPSO based on decomposition and dominance with archiving using crowding distance in objective and solution spaces,” Evolutionary Computation, vol. 22, no. 1, pp. 47–77, 2014. View at Publisher · View at Google Scholar
  39. H. Zhang, X. Zhang, X.-Z. Gao, and S. Song, “Self-organizing multiobjective optimization based on decomposition with neighborhood ensemble,” Neurocomputing, vol. 173, pp. 1868–1884, 2016. View at Publisher · View at Google Scholar · View at Scopus
  40. K. C. Tan, T. H. Lee, and E. F. Khor, “Evolutionary algorithms for multi-objective optimization: performance assessments and comparisons,” Artificial Intelligence Review, vol. 17, no. 4, pp. 253–290, 2002. View at Google Scholar · View at Scopus
  41. K. Deb, L. Thiele, M. Laumanns, and E. Zitzler, “Scalable multi-objective optimization test problems,” in Proceedings of the Congress on Evolutionary Computation, vol. 1-2, pp. 825–830, Honolulu, Hawaii, USA, May 2002. View at Publisher · View at Google Scholar