Skip to main content

Constrained Multi-objective Optimization Using a Quantum Behaved Particle Swarm

  • Conference paper
Neural Information Processing (ICONIP 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7665))

Included in the following conference series:

Abstract

The possibility to get a set of Pareto optimal solutions in a single run is one of the attracting and motivating features of using population based algorithms to solve optimization problems with multiple objectives. In this paper, constrained multi-objective problems are tackled using an extended quantum behaved particle swarm optimization. Two strategies to handle constraints are investigated. The first one is a death penalty strategy which discards infeasible solutions that are generated through iterations forcing the search process to explore only the feasible region. The second approach takes into account the infeasible solutions when computing the local attractors of particles and adopts a policy that achieves a balance between searching in infeasible and feasible regions. Several benchmark test problems have been used for assessment and validation. Experimental results show the ability of QPSO to handle constraints effectively in multi-objective context. However, none of the two investigated strategies has been found to be the best in all cases. The first strategy achieved the best results in terms of convergence and diversity for some test problems whereas the second strategy did the same for the others.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Sun, J., Feng, B., Xu, W.: Particle Swarm Optimization with Particles having Quantum Behavior. In: IEEE Proceedings of Congress on Evolutionary Computation, pp. 325–331 (2004)

    Google Scholar 

  2. Fang, W., Sun, J., Ding, Y., Wu, X., Xu, W.: A review of Quantum-behaved Particle Swarm Optimization. IETE Technical Review (2010)

    Google Scholar 

  3. Sun, J., Xu, W., Feng, B.: A Global Search Strategy of Quantum-behaved Particle Swarm Optimization. In: IEEE Conference on Cybernetics and Intelligent Systems, pp. 111–116 (2004)

    Google Scholar 

  4. Meshoul, S., Al-Owaisheq, T.: QPSO-MD: A Quantum Behaved Particle Swarm Optimization for Consensus Pattern Identification. In: Cai, Z., Li, Z., Kang, Z., Liu, Y. (eds.) ISICA 2009. CCIS, vol. 51, pp. 369–378. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  5. Deb, K.: Multi-objective optimization using evolutionary algorithms. Wiley, Chichester (2001)

    MATH  Google Scholar 

  6. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGAII. IEEE Transactions on Evolutionary Computation, 182–197 (2002)

    Google Scholar 

  7. Coello, C.A.: Constraint-Handling using an Evolutionary Multiobjective Optimization Technique. Civil Engineering and Environmental Systems 17, 319–346 (2000)

    Article  Google Scholar 

  8. Coello, C.A., Pulido, G.T., Lechuga, M.S.: Handling multiple objectives with particle swarm optimization. IEEE Transactions on Evolutionary Computation, 256–279 (2004)

    Google Scholar 

  9. Sun, J., Lai, C.H., Xu, W.-B., Chai, Z.: A Novel and More Efficient Search Strategy of Quantum-Behaved Particle Swarm Optimization. In: Beliczynski, B., Dzielinski, A., Iwanowski, M., Ribeiro, B. (eds.) ICANNGA 2007. LNCS, vol. 4431, pp. 394–403. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  10. Binh, T., Korn, U.: MOBES: A Multiobjective Evolution Strategy For Constrained Optimization Problems. In: Proceedings of the Third International Conference on Genetic Algorithms (Mendel 1997), pp. 76–182 (1997)

    Google Scholar 

  11. Abranham, A., Jain, L.: Evolutionary multiobjective optimization. In: Ajith, A., Lakhmi, J., Robert, G. (eds.) Evolutionary Multiobjective Optimization, Advanced Information and Knowledge Processing, pp. 1–6 (2005)

    Google Scholar 

  12. AlBaity, H., Meshoul, S., Kaban, A.: On Extending Quantum Behaved Particle Swarm Optimization to MultiObjective Context. In: Proceedings of the IEEE World Congress on Computational Intelligence (IEEE CEC 2012), pp. 996–1003 (2012)

    Google Scholar 

  13. Mostaghim, S., Teich, J.: Strategies for finding good local guides in multi-objective particle swarm optimization (mopso). In: Proceedings of the IEEE Swarm Intelligence Symposium, pp. 26–33 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Al-Baity, H., Meshoul, S., Kaban, A. (2012). Constrained Multi-objective Optimization Using a Quantum Behaved Particle Swarm. In: Huang, T., Zeng, Z., Li, C., Leung, C.S. (eds) Neural Information Processing. ICONIP 2012. Lecture Notes in Computer Science, vol 7665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34487-9_55

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34487-9_55

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34486-2

  • Online ISBN: 978-3-642-34487-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics