Skip to main content

Self-organisation in Constraint Problem Solving

  • Chapter
Self-organising Software

Part of the book series: Natural Computing Series ((NCS))

Abstract

Constraint satisfaction (CSP) or constraint optimisation problems (COP) frameworks are well known and well addressed using classical methods coming from operations research and artificial intelligence. Nevertheless, when dynamics and distribution are added requirements, those approaches do not necessarily fit or need serious re-factoring to be efficient. The idea beneath this chapter is to exploit the intrinsic distributed and adaptive nature of self-organising systems to cooperatively solve distributed constraint based problems, in which constraints and variables can change at run-time, as environmental disturbances influence self-organising societies. In this chapter, several approaches, classical (or not), and their extensions, along with purely multi-agent and self-organising ones, are presented and evaluated in the light of certain characteristics such as distribution, decentralisation, locality, etc. We also argue and show that if we introduce self-organisation, we have benefits and better results. We then introduce one such self-organising approach, and we demonstrate its applicability to the n-queens case study.

In tackling the problems of tomorrow with yesterday’s organizations, we gather the dramas today.

Michel Crozier

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    The agent terminology is used from more than twelve years in the CSP domain.

  2. 2.

    One can note that not all the constraints are binary; but for many problems, n-ary constraints can be transformed into binary constraint by adding new constraints and variables [2].

  3. 3.

    For more details on how to detect that a solution is found by using propagation only, we redirect the reader to [12].

  4. 4.

    cost(q i )≡(cost(c j ) with (c j =cell(q i ))).

  5. 5.

    A detailed description of the colouring problem can be found at http://www.cs.ualberta.ca/~joe/Coloring/index.html.

References

  1. Axelrod, R.: The Evolution of Cooperation. Basic Books, New York (1984)

    Google Scholar 

  2. Bacchus, F., van Beek, P.: On the conversion between non-binary and binary constraint satisfaction problems. In: Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98) and of the 10th Conference on Innovative Applications of Artificial Intelligence (IAAI-98), pp. 311–318. AAAI Press, Menlo Park (1998)

    Google Scholar 

  3. Bachelet, V., Talbi, E.: Cosearch: a co-evolutionary metaheuristics. In: Proceedings of Congress on Evolutionary Computation (CEC’00), pp. 1550–1557 (2000)

    Google Scholar 

  4. Clair, G., Gleizes, M.P., Kaddoum, E., Picard, G.: Self-regulation in self-organising multi-agent systems for adaptive and intelligent manufacturing control. In: Second IEEE International Conference on Self-Adaption and Self-Organization (SASO 2008), Venice, Italy, 20–24 October 2008. IEEE Computer Society, Los Alamitos (2008)

    Google Scholar 

  5. Clearwater, S.H., Hogg, T., Huberman, B.A.: Cooperative problem solving. In: Computation: The Micro and Macro View, pp. 33–70. World Scientific, Singapore (1992)

    Chapter  Google Scholar 

  6. Dechter, R.: Constraint Processing. Morgan Kaufmann, San Mateo (2003)

    Google Scholar 

  7. Denzinger, J., Offerman, T.: On cooperation between evolutionary algorithms and other search paradigms. In: Congress on Evolutionary Computation (CEC’99), pp. 2317–2324 (1999)

    Google Scholar 

  8. Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)

    Book  MATH  Google Scholar 

  9. Dréo, J., Pétrowski, A., Siarry, P., Taillard, E.: Metaheuristics for Hard Optimization: Methods and Case Studies. Springer, Berlin (2005)

    Google Scholar 

  10. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Dordrecht (1997)

    Book  MATH  Google Scholar 

  11. Hattori, H., Ito, T.: A quick adaptation method for constraint satisfaction in a real-time environment. Int. J. Comput. Sci. Netw. Secur. 6(78), 107–112 (2006)

    Google Scholar 

  12. Hirayama, K., Yokoo, M.: The distributed breakout algorithms. Artif. Intell. 161(1–2), 89–115 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  13. Hogg, T., Huberman, B.: Better than the best: the power of cooperation. In: Lectures in Complex Systems. SFI Studies in the Sciences of Complexity, vol. V, pp. 165–184. Addison-Wesley, Reading (1993)

    Google Scholar 

  14. Holland, J.H.: Adaptation in Natural and Artificial Systems. MIT Press, Cambridge (1975). 2nd edn. (1992)

    Google Scholar 

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

    Chapter  Google Scholar 

  16. Kennedy, J., Eberhart, R.C.: Swarm Intelligence. Morgan Kaufmann, San Mateo (2001)

    Google Scholar 

  17. Kirkpatrick, S., Gellat, C., Vecchi, M.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)

    Article  MathSciNet  Google Scholar 

  18. Liu, J., Jing, H., Tang, Y.Y.: Multi-agent oriented constraint satisfaction. Artif. Intell. 136(1), 101–144 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  19. Lynch, N.: Distributed Algorithms. Morgan Kaufmann, San Mateo (1997)

    Google Scholar 

  20. Mailler, R.: Comparing two approaches to dynamic, distributed constraint satisfaction. In: Proceedings of the Fourth International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS’05), pp. 1049–1056. ACM, New York (2005)

    Chapter  Google Scholar 

  21. Mailler, R., Lesser, V.: Solving distributed constraint optimization problems using cooperative mediation. In: Proceedings of Third International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS’04), pp. 438–445. IEEE Computer Society, Los Alamitos (2004)

    Google Scholar 

  22. Mailler, R., Lesser, V.R.: Asynchronous partial overlay: a new algorithm for solving distributed constraint satisfaction problems. J. Artif. Intell. Res. 25, 529–576 (2006)

    MathSciNet  MATH  Google Scholar 

  23. Minton, S., Johnston, M., Philips, A., Laird, P.: Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Constr. Bas. Reason. 58(1–3), 161–205 (1994)

    MathSciNet  Google Scholar 

  24. Modi, P.J., Shen, W., Tambe, M., Yokoo, M.: ADOPT: asynchronous distributed constraint optimization with quality guarantees. Artif. Intell. 161(2), 149–180 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  25. Morris, P.: The breakout method for escaping from local minima. In: AAAI, pp. 40–45 (1993)

    Google Scholar 

  26. Picard, G., Glize, P.: Model and analysis of local decision based on cooperative self-organization for problem solving. Multiagent Grid Syst. 2(3), 253–265 (2006)

    MATH  Google Scholar 

  27. Picard, G., Bernon, C., Gleizes, M.P.: ETTO: emergent timetabling by cooperative self-organization. In: Engineering Self-Organizing Applications—Third International Workshop (ESOA) at the Fourth International Joint Conference on Autonomous Agents and Multi-Agents Systems (AAMAS’05), July 2005, Utrecht, Netherlands. Lecture Notes in Artificial Intelligence (LNAI), vol. 3910, pp. 31–45. Springer, Berlin (2005)

    Google Scholar 

  28. Picard, G., Gleizes, M.P., Glize, P.: Distributed frequency assignment using cooperative self-organization. In: First International Conference on Self-Adaptive and Self-Organizing Systems, 2007. SASO’07, pp. 183–192. ACM, New York (2007)

    Chapter  Google Scholar 

  29. Prakasam, P., Toulouse, M., Crainic, T.G., Qu, R.: A multilevel cooperative search algorithm for the graph colouring problem. In: Learning and Intelligent Optimization Conference (LION 3) (2009)

    Google Scholar 

  30. Shoham, Y., Leyton-Brown, K.: Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations. Cambridge University Press, Cambridge (2008)

    Google Scholar 

  31. Talbi, E.G. (ed.): Parallel Combinatorial Optimization. Wiley, New York (2006)

    Google Scholar 

  32. Toulouse, M., Crainic, T., Sansò, B.: An experimental study of the systemic behavior of cooperative search algorithms. In: Voß, S., Martello, S., Osman, I., Roucairol, C. (eds.) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 373–392. Kluwer Academic, Dordrecht (1999)

    Chapter  Google Scholar 

  33. Toulouse, M., Thulasiraman, K., Glover, F.: Multi-level cooperative search: a new paradigm for combinatorial optimization and application to graph partitioning. In: Proceedings of the 5th International Euro-Par Conference on Parallel Processing. LNCS, pp. 533–542. Springer, Berlin (1999)

    Google Scholar 

  34. Yokoo, M.: Weak-commitment search for solving constraint satisfaction problems. In: Proceedings of the 12th National Conference on Artificial Intelligence (AAAI-94), pp. 313–318. AAAI Press, Menlo Park (1994)

    Google Scholar 

  35. Yokoo, M.: Distributed Constraint Satisfaction: Foundations of Cooperation in Multi-Agent Systems. Springer, Berlin (2001)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pierre Glize .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Glize, P., Picard, G. (2011). Self-organisation in Constraint Problem Solving. In: Di Marzo Serugendo, G., Gleizes, MP., Karageorgos, A. (eds) Self-organising Software. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17348-6_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17348-6_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17347-9

  • Online ISBN: 978-3-642-17348-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics