On Self-Organization of Cooperative Systems and Fuzzy Logic
A collection of many systems that cooperatively solve an optimization problem is considered. The consideration aims to determine conditions for the systems to be self-organized demonstrating their best performance for the problem. A general framework based on a concept of structural complexity is proposed to determine the conditions. The main merit of this framework is that it allows to set up computational experiments revealing a condition of best performance. The experiments give evidence to suggest that the condition is realized when the structural complexity of cooperative systems equals the structural complexity of the optimization problem. Importantly, the key parameter involved in the condition is of fuzzy logic character and admits interpretation in terms of human perceptions. The results of the paper give a new perspective in the developing of optimization methods based on cooperative systems and show the relevance of fuzzy logic to self-organization.
KeywordsOptimal Algorithm Fuzzy Logic Computational Experiment Complexity Space Travel Salesman Problem
Unable to display preview. Download preview PDF.
- 1.R. Axelrod, (1984) The Evolution of Cooperation, Basic Books, New York.Google Scholar
- 3.B. Huberman, (1990) The Performance of Cooperative Processes, Physica D, vol. 42, pp. 39–47.Google Scholar
- 6.L. Zadeh, (1996), Fuzzy Logic = Computing with Words, IEEE Transactions on Fuzzy Systems, vol. 4, No. 2, pp. 103–111.Google Scholar
- 9.E. Prouhet, (1851) Memoire sur Quelques Relations entre les Puissances des Nombres, C.R. Acad. Sci., Paris, vol. 33, p. 225.Google Scholar
- 10.A. Thue, (1906) Uber unendliche Zeichenreihen, Norske vid. Selsk. Skr. I. Mat. Nat. Kl. Christiana, vol. 7, p. 1.Google Scholar
- 11.M. Morse, (1921) Recurrent Geodesics on a Surface of Negative Curvature, Trans. Amer. Math. Soc., vol. 22, p. 84.Google Scholar
- 13.ftp://ftp.wiwi.uni-frankfurt.de/pub/TSPLIB 1.2
- 14.S. Weinberg, (1993) Dreams of a Final Theory, Vintage, London.Google Scholar
- 15.R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman and L. Troyansky, (1999) Determining Computational Complexity from Characteristic ‘Phase Transitions’, Nature, vol. 400, pp. 133–137.Google Scholar