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

Pareto-Ranking Based Quantum-Behaved Particle Swarm Optimization for Multiobjective Optimization

1Institute of Educational Informatization, Jiangnan University, Wuxi 214122, China
2Institute of Electrical Automation, Jiangnan University, Wuxi 214122, China

Received 27 April 2015; Accepted 25 June 2015

Academic Editor: Fabio Tramontana

Copyright © 2015 Na Tian and Zhicheng Ji. 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. A. Konak, D. W. Coit, and A. E. Smith, “Multi-objective optimization using genetic algorithms: a tutorial,” Reliability Engineering and System Safety, vol. 91, no. 9, pp. 992–1007, 2006. View at Publisher · View at Google Scholar · View at Scopus
  3. C. A. C. Ceollo, 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. M. Reyes-Sierra and C. A. Coello Coello, “Multi-objective particle swarm optimizers: a survey of the state-of-the-art,” International Journal of Computational Intelligence Research, vol. 2, no. 3, pp. 287–308, 2006. View at Google Scholar · View at MathSciNet
  5. J. Sun, B. Feng, and W. B. Xu, “Particle swarm optimization with particles having quantum behavior,” in Proceedings of the Congress on Evolutionary Computation (CEC '04), pp. 325–331, Portland, Ore, USA, June 2004. View at Scopus
  6. J. Sun, W. Fang, X. J. Wu, V. Palade, and W. Xu, “Quantum-behaved particle swarm optimization: analysis of individual particle behavior and parameter selection,” Evolutionary Computation, vol. 20, no. 3, pp. 349–393, 2012. View at Publisher · View at Google Scholar · View at Scopus
  7. J. Sun, X. Wu, V. Palade, W. Fang, C.-H. Lai, and W. Xu, “Convergence analysis and improvements of quantum-behaved particle swarm optimization,” Information Sciences, vol. 193, pp. 81–103, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. P. Brandimarte, “Routing and scheduling in a flexible job shop by tabu search,” Annals of Operations Research, vol. 41, no. 3, pp. 157–183, 1993. View at Publisher · View at Google Scholar · View at Scopus
  9. Z. Davarzani, M. Akbarzadeh, and N. Khairdoost, “Multi-objective artificial immune algorithm for flexible job shop scheduling problem,” International Journal of Hybrid Information Technology, vol. 5, no. 3, pp. 75–88, 2012. View at Google Scholar
  10. I. Kacem, S. Hammadi, and P. Borne, “Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems,” IEEE Transactions on Systems, Man and Cybernetics, Part C: Applications and Reviews, vol. 32, no. 1, pp. 1–13, 2002. View at Publisher · View at Google Scholar · View at Scopus
  11. I. Kacem, S. Hammadi, and P. Borne, “Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic,” Mathematics and Computers in Simulation, vol. 60, no. 3–5, pp. 245–276, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. G. H. Zhang, X. Y. Shao, P. G. Li, and L. Gao, “An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem,” Computers & Industrial Engineering, vol. 56, no. 4, pp. 1309–1318, 2009. View at Publisher · View at Google Scholar · View at Scopus
  13. J. Gao, L. Sun, and M. Gen, “A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems,” Computers & Operations Research, vol. 35, no. 9, pp. 2892–2907, 2008. View at Publisher · View at Google Scholar · View at Scopus
  14. J. Kennedy and R. C. Eberhart, “Particle swarm optimization,” in Proceedings of the IEEE International Conference on Neural Networks, pp. 1942–1948, Perth, Australia, December 1995. View at Scopus
  15. R. C. Eberhart and Y. Shi, “Comparison between genetic algorithms and particle swarm optimization,” in Evolutionary Programming VII, vol. 1447 of Lecture Notes in Computer Science, pp. 611–616, Springer, Berlin, Germany, 1998. View at Publisher · View at Google Scholar
  16. F. Van den Bergh, An analysis of particle swarm optimizers [Ph.D. thesis], University of Pretoria, Pretoria, South Africa, 2001.
  17. M. Clerc and J. Kennedy, “The particle swarm—explosion, stability, and convergence in a multidimensional complex space,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 1, pp. 58–73, 2002. View at Publisher · View at Google Scholar · View at Scopus
  18. S. Mostaghim and J. Teich, “Strategies for finding good local guides in multi-objective particle swarm optimization,” in Proceedings of the IEEE Swarm Intelligence Symposium, pp. 26–33, 2003.
  19. J. J. Yang, J. Zhou, L. Liu, and Y. Li, “A novel strategy of pareto-optimal solution searching in multi-objective particle swarm optimization (MOPSO),” Computers & Mathematics with Applications, vol. 57, no. 11-12, pp. 1995–2000, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. Y. Wang and Y. Yang, “Particle swarm optimization with preference order ranking for multi-objective optimization,” Information Sciences, vol. 179, no. 12, pp. 1944–1959, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. I. Das, “A preference ordering among various pareto optimal alternatives,” Structural Optimization, vol. 18, no. 1, pp. 30–35, 1999. View at Publisher · View at Google Scholar · View at Scopus
  22. F. di Pierro, S.-T. Khu, and D. A. Savić, “An investigation on preference order ranking scheme for multiobjective evolutionary optimization,” IEEE Transactions on Evolutionary Computation, vol. 11, no. 1, pp. 17–45, 2007. View at Publisher · View at Google Scholar · View at Scopus
  23. K. Deb, L. Thiele, M. Laumanns, and E. Zitzler, “Scalable multi-objective optimization test problems,” in Proceedings of the Congress on Evolutionary Computation (CEC '02), vol. 1, pp. 825–830, May 2002. View at Publisher · View at Google Scholar · View at Scopus