Skip to main content
SpringerLink
Log in
Book cover

Genetic and Evolutionary Computation Conference

GECCO 2003: Genetic and Evolutionary Computation — GECCO 2003 pp 561–572Cite as

Solving Distributed Asymmetric Constraint Satisfaction Problems Using an Evolutionary Society of Hill-Climbers

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2723))

Abstract

The distributed constraint satisfaction problem (DisCSP) can be viewed as a 4-tuple (X, D, C, A), where X is a set of n variables, D is a set of n domains (one domain for each of the n variables), C is a set of constraints that constrain the values that can be assigned to the n variables, and A is a set of agents for which the variables and constraints are distributed. The objective in solving a DisCSP is to allow the agents in A to develop a consistent distributed solution by means of message passing. In this paper, we present an evolutionary society of hill-climbers (ESoHC) that outperforms a previously developed algorithm for solving randomly generated DisCSPs that are composed of asymmetric constraints on a test suite of 2,800 distributed asymmetric constraint satisfaction problems.

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

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bejar, R., Krishnamachari, B., Gomes, C., and Selman, B. (2001). “Distributed Constraint Satisfaction in a Wireless Sensor Tracking System”, Proc. of the IJCAI Workshop on Distributed Constraint Reasoning, pp. 81–90.

    Google Scholar 

  2. Calisti, M., and Faltings, B. (2000). “Agent-Based Negotiations for Multi-Provider Interactions”, Proc. of the Intl. Sym. on Agent Sys. and Applications, pp. 235–248.

    Google Scholar 

  3. Calisti, M., and Faltings, B. (2000). “Distributed Constrained Agents for Allocating Service Demands in Multi-Provider Networks”, Journal of the Italian Operational Society, Special Issue on Constraint Problem Solving, vol. XXIX, no. 91.

    Google Scholar 

  4. Dozier, G. and Rupela, V. (2002). “Solving Distributed Asymmetric CSPs via a Society of Hill-Climbers”, Proc. of IC-AI’02, pp. 949–953, CSREA Press.

    Google Scholar 

  5. Freuder, E. C., Minca, M., and Wallace, R. J. (2001). “Privacy/Efficiency Tradeoffs in Distributed Meeting Scheduling by Constraint-Based Agents”, Proc. of the IJCAI Workshop on Distributed Constraint Reasoning, pp. 63–71.

    Google Scholar 

  6. Krishnamachari, B., Bejar, R., and Wicker, S. (2002). “Distributed Problem Solving and the Boundaries of Self-Configuration in Multi-hop Wireless Networks”, Proc. of the Hawaii Intl. Conference on System Sciences, HICSS-35.

    Google Scholar 

  7. MacIntyre, E., Prosser, P., Smith, B., and Walsh, T. (1998). “Random Constraint Satisfaction: Theory Meets Practice,” The Proc. of CP-98, pp. 325–339.

    Google Scholar 

  8. Mackworth, A. K. (1977). “Consistency in networks of relations”. Artificial Intelligence, 8(1), pp. 99–118.

    Article  MATH  MathSciNet  Google Scholar 

  9. Modi, P. J., Jung, H., Tambe, M., Shen, W.-M., and Kulkarni, S. (2001). “Dynamic Distributed Resource Allocation: A Distributed Constraint Satisfaction Approach” Proc. of the IJCAI Workshop on Distributed Constraint Reasoning, pp. 73–79.

    Google Scholar 

  10. Morris, P. (1993). “The Breakout Method for Escaping From Local Minima,” Proc. of AAAI’93, pp. 40–45.

    Google Scholar 

  11. Sebag, M. and Shoenauer, M. (1997). “A Society of Hill-Climbers,” The Proc. of ICEC-97, pp. 319–324, IEEE Press.

    Google Scholar 

  12. Silaghi, M.-C., Sam-Haroud, D., Calisti, M., and Faltings, B. (2001). “Generalized English Auctions by Relaxation in Dynamic Distributed CSPs with Private Constraints”, Proc. of the IJCAI Workshop on Distributed Constraint Reasoning, pp. 45–54.

    Google Scholar 

  13. Smith, B. (1994). “Phase Transition and the Mushy Region in Constraint Satisfaction Problems,” Proc. of ECAI-94, pp. 100–104, John Wiley & Sons, Ltd.

    Google Scholar 

  14. Solnon, C. (2002). “Ants can solve constraint satisfaction problems”, to appear in: IEEE Transactions on Evolutionary Computation, IEEE Press.

    Google Scholar 

  15. Tsang, E. (1993). Foundations of Constraint Satisfaction, Academic Press, Ltd.

    Google Scholar 

  16. Walrand, J. (1998). Communication Networks: A First Course, 2nd Edition, WCB/McGraw-Hill.

    Google Scholar 

  17. Yokoo, M. (2001). Distributed Constraint Satisfaction, Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Software Engineering, Auburn University, Auburn, AL, 36849-5347, USA

    Gerry Dozier

Authors
  1. Gerry Dozier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Lawrence Livermore National Laboratory, Center for Applied Scientific Computing (CASC), 7000 East Avenue, L-561, Livermore, CA, 94550, USA

    Erick Cantú-Paz

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dozier, G. (2003). Solving Distributed Asymmetric Constraint Satisfaction Problems Using an Evolutionary Society of Hill-Climbers. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2723. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45105-6_68

Download citation

  • DOI: https://doi.org/10.1007/3-540-45105-6_68

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40602-0

  • Online ISBN: 978-3-540-45105-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation