Skip to main content

D2G2A: A Distributed Double Guided Genetic Algorithm for Max_CSPs

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

Abstract

Inspired by the distributed guided genetic algorithm (DGGA), D2G2A is a new multi-agent approach, which addresses Maximal Constraint Satisfaction Problems (Max-CSP). GA efficiency provides good solution quality for Max\_CSPs in one hand and benefits from multi-agent principles reducing GA temporal complexity. In addition to that the approach will be enhanced by a new parameter called guidance operator. The latter allows not only diversification but also an escaping from local optima. D2G2A and DGGA are been applied to a number of randomly generated Max\_CSPs. In order to show D2G2A advantages, experimental comparison is provided. As well, guidance operator is experimentally outlined in order to determine its best given value.

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 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.00
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. Briot, J.P.: Actalk: A testbed for classifying and designing Actor languages in the Smalltalk-80 Environment. In: Proceedings of European Conference on Object-Oriented Programming (ECOOP 1989), July 1989. British Computer Society Workshop Series, Cambridge University Press, Cambridge (1989)

    Google Scholar 

  2. Ghédira, K.: A Distributed approach to Partial Constraint Satisfaction Problem. In: Perram, J., Müller, J.P. (eds.) MAAMAW 1994. LNCS(LNAI), vol. 1069, Springer, Heidelberg (1996)

    Google Scholar 

  3. Ghédira, K., Jlifi, B.: A Distributed Guided Genetic Algorithm for Max_CSPs. journal of sciences and technologies of information (RSTI), journal of artificial intelligence series (RIA) 16(3) (2002)

    Google Scholar 

  4. Goldberg, D.E.: Genetic algorithms in search, Optimisation, and Machine Learning. Addison-Wesley, Reading (1989)

    Google Scholar 

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

    Google Scholar 

  6. Tsang, E.P.K., Wang, C.J., Davenport, A., Voudouris, C., Lau, T.L.: A family of stochastic methods for Constraint Satisfaction and Optimization. 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

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bouamama, S., Jlifi, B., Ghédira, K. (2003). D2G2A: A Distributed Double Guided Genetic Algorithm for Max_CSPs. In: Palade, V., Howlett, R.J., Jain, L. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2003. Lecture Notes in Computer Science(), vol 2773. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45224-9_59

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45224-9_59

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40803-1

  • Online ISBN: 978-3-540-45224-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics