Nothing Special   »   [go: up one dir, main page]

Skip to main content

Distributed Constraint Satisfaction, Restricted Recombination, and Hybrid Genetic Search

  • Conference paper
Genetic and Evolutionary Computation – GECCO 2004 (GECCO 2004)

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

Included in the following conference series:

Abstract

In this paper, we present simple and genetic forms of an evolutionary paradigm known as a society of hill-climbers (SoHC). We compare these simple and genetic SoHCs on a test suite of 400 randomly generated distributed constraint satisfaction problems (DisCSPs) that are composed of asymmetric constraints (referred to as DisACSPs). Our results show that all of the genetic SoHCs dramatically outperform the simple SoHC even at the phase transition where the most difficult DisACSPs reside.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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.

Similar content being viewed by others

References

  • Bäck, T., Hammel, U., Schwefel, H.-P.: Evolutionary Computation: Comments on the History and Current State. IEEE Transactions on Evolutionary Computation 1, 1–23 (1997)

    Article  Google Scholar 

  • Bejar, R., Krishnamachari, B., Gomes, C., Selman, B.: Distributed Constraint Satisfaction in a Wireless Sensor Tracking System. In: Proceedings of the IJCAI 2001 Workshop on Distributed Constraint Reasoning, pp. 81–90 (2001)

    Google Scholar 

  • Bowen, J., Dozier, G.: Constraint Satisfaction Using A Hybrid Evolutionary Hill-Climbing Algorithm That Performs Opportunistic Arc and Path Revision. In: Proceedings of AAAI 1996, pp. 326–331. AAAI Press / The MIT Press (1996)

    Google Scholar 

  • Calisti, M., Faltings, B.: Agent-Based Negotiations for Multi-Provider Interactions. Journal of Autonomous Agents and Multi-Agent Systems (2001)

    Google Scholar 

  • Dozier, G.: Solving Distributed Asymmetric CSP Using via a Society of Hill- Climbers. In: Proceedings of the 2002 International Conference on Artificial Intelligence, Las Vegas, NV, June 24-27, pp. 949–953. CSREA (2002)

    Google Scholar 

  • Dozier, G., Bowen, J., Homaifar, A.: Solving Constraint Satisfaction Problems Using Hybrid Evolutionary Search. IEEE Transactions on Evolutionary Computation 2(1), 23–33 (1998)

    Article  Google Scholar 

  • Fogel, D.B.: Evolutionary Computation: Toward a New Philosophy of Machine Intelligence, 2nd edn. IEEE Press, Los Alamitos (2000)

    Google Scholar 

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

    Google Scholar 

  • Jones, T.: Crossover, Macromutation and Population-based Search. In: Proceedings of The Sixth International Conference (ICGA 1995), pp. 73–80. Morgan Kaufmann, San Francisco (1995)

    Google Scholar 

  • MacIntyre, E., Prosser, P., Smith, B., Walsh, T.: Random Constraint Satisfaction: Theory Meets Practice. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 325–339. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  • Morris, P.: The Breakout Method for Escaping From Local Minima. In: Proceedings of AAAI 1993, pp. 40–45 (1993)

    Google Scholar 

  • Sebag, M., Shoenauer, M.: A Society of Hill-Climbers. In: The Proceedings of the 1997 International Conference on Evolutionary Computation, pp. 319–324. IEEE Press, Los Alamitos (1997)

    Google Scholar 

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

    Google Scholar 

  • Smith, B.: Phase Transition and the Mushy Region in Constraint Satisfaction Problems. In: Cohn, A. (ed.) Proceedings of the 11th European Conference on Artificial Intelligence, pp. 100–104. John Wiley & Sons, Ltd., Chichester (1994)

    Google Scholar 

  • Solnon, C.: Ants can solve constraint satisfaction problems. IEEE Transactions on Evolutionary Computation 6(4), 347–357 (2002)

    Article  Google Scholar 

  • Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, Ltd., London (1993)

    Google Scholar 

  • Yokoo, M.: Distributed Constraint Satisfaction. Springer, Heidelberg (2001)

    MATH  Google Scholar 

  • Zhang, F.: A Comparison of Distributed Restricted Recombination Operators for Genetic Societies of Hill-Climbers: a DisACSP Perspective. Auburn University Masters Thesis, Department of Computer Science & Software Engineering (2003)

    Google Scholar 

  • Zhang, X., Xing, Z.: Distributed Breakout vs. Distributed Stochastic: A Comparative Evaluation on Scan Scheduling. In: AAMA 2002 Third International Workshop on Distributed Constraint Reasoning, Bologna, Italy, July 16, pp. 192–201 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dozier, G., Cunningham, H., Britt, W., Zhang, F. (2004). Distributed Constraint Satisfaction, Restricted Recombination, and Hybrid Genetic Search. In: Deb, K. (eds) Genetic and Evolutionary Computation – GECCO 2004. GECCO 2004. Lecture Notes in Computer Science, vol 3102. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24854-5_106

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24854-5_106

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22344-3

  • Online ISBN: 978-3-540-24854-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics