Skip to main content

A New Distributed Particle Swarm Optimization Algorithm for Constraint Reasoning

  • Conference paper
Book cover Knowledge-Based and Intelligent Information and Engineering Systems (KES 2010)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6277))

Abstract

Within the framework of constraint reasoning we introduce a newer distributed particle swarm approach. The latter is a new multi-agent approach which addresses additive Constraint Satisfaction problems ((CSPs). It is inspired by the dynamic distributed double guided genetic algorithm (D3G2A) for Constraint reasoning. It consists of agents dynamically created and cooperating in order to solve problems. Each agent performs locally its own particle swarm optimization algorithm (PSO). This algorithm is slightly different from other PSO algorithms. As well, not only do the new approach parameters allow diversification but also permit escaping from local optima. Second,. Experimentations are held to show effectiveness of our approach.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Bellicha, A., Capelle, C., Habib, M., Kökény, T., Vilarem, M.: Exploitation de la relation de substitualité pour la résolution des CSPs. Revue d’intelligence artificielle RIA, vol. 3 (1997)

    Google Scholar 

  2. Bouammama, S., Ghedira, K.: A Family of Distributed Double Guided Genetic Algorithm for Max_CSPs. The International Journal of Knowledge-based and Intelligent Engineering Systems 10(5), 363–376 (2006)

    Google Scholar 

  3. Bouammama, S., Ghedira, K.: Une nouvelle génération d’algorithmes génétiques guidés distribués pour la résolution des Max_CSPs. Revue des sciences et technologie de l’information, serie Technique et science informatique, TSI 27(1-2), 109–140 (2008)

    Google Scholar 

  4. Bouammama, S., Ghedira, K.: A Dynamic Distributed Double Guided Genetic Algorithm for Optimization and Constraint Reasoning. International Journal of Computational Intelligence Research 2(2), 181–190 (2006)

    Article  Google Scholar 

  5. Chu, M., Allstot, D.J.: An elitist distributed particle swarm algorithm for RF IC optimization. In: The ACM Conference on Asia South Pacific Design Automation, Shanghai, China, SESSION: RF Circuit Design and Design Methodology (2005)

    Google Scholar 

  6. Craenen, B., Eiben, A.E., van Hemert, J.I.: Comparing Evolutionary Algorithms on Binary Constraint Satisfaction Problems. IEEE Transactions on Evolutionary Computation 7(5), 424–444 (2003)

    Article  Google Scholar 

  7. Darwin, C.: The Origin of Species, Sixth London edn. (1859/1999)

    Google Scholar 

  8. Hereford, J.M.: A Distributed Particle Swarm Optimization Algorithm for Swarm Robotic Applications. In: IEEE Congress on Evolutionary Computation (2006)

    Google Scholar 

  9. Hu, X., Eberhart, R.: Solving Constrained Nonlinear Optimization Problems with Particle Swarm Optimization. In: 6th World Multiconference on Systemics, Cybernetics and Informatics, Orlando, Florida, USA (2002)

    Google Scholar 

  10. Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, pp. 1942–1948. IEEE Service Center, Piscataway (1995)

    Chapter  Google Scholar 

  11. Lin, C., Hsieh, S., Sun, Y., Liu, C.: PSO-based learning rate adjustment for blind source separation. In: IEEE International Symposium on Intelligent Signal Processing and Communication Systems (2005)

    Google Scholar 

  12. Schiex, T., Fargier, H., Verfaillie, G.: Valued constrained satisfaction problems: hard and easy problems. In: 14th IJCAI, Montreal, Canada (1995)

    Google Scholar 

  13. Schoofs, L., Naudts, B.: Swarm intelligence on the binary constraint satisfaction problem. In: IEEE Congress on Evolutionary Computation (2002)

    Google Scholar 

  14. Schutte, J.F., Reinbolt, J.A., Fregly, B.J., Haftka, R.T., George, A.D.: Parallel global optimization with particle swarm algorithm. International Journal for Numerical Methods in Engineering 61, 2296–2315 (2004)

    Article  MATH  Google Scholar 

  15. Tsang, E.P.K., Wang, C.J., Davenport, A., Voudouris, C., Lau, T.L.: A family of stochastic methods for Constraint Satisfaction and Optimization. Technical report, University of Essex, Colchester, UK (November 1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bouamama, S. (2010). A New Distributed Particle Swarm Optimization Algorithm for Constraint Reasoning. In: Setchi, R., Jordanov, I., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based and Intelligent Information and Engineering Systems. KES 2010. Lecture Notes in Computer Science(), vol 6277. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15390-7_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15390-7_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15389-1

  • Online ISBN: 978-3-642-15390-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics