A Cooperative Optimization Algorithm Inspired by Chaos–Order Transition

Fangzhen Ge, Liurong Hong, Qilin Wu and Li Shi

Mathematical Problems in Engineering, 2015, vol. 2015, 1-10

Abstract:

The growing complexity of optimization problems in distributed systems (DSs) has motivated computer scientists to strive for efficient approaches. This paper presents a novel cooperative algorithm inspired by chaos–order transition in a chaotic ant swarm (CAS). This work analyzes the basic dynamic characteristics of a DS in light of a networked multiagent system at microlevel and models a mapping from state set to self-organization mechanism set under the guide of system theory at macrolevel. A collaborative optimization algorithm (COA) in DS based on the chaos–order transition of CAS is then devised. To verify the validity of the proposed model and algorithm, we solve a locality-based task allocation in a networked multiagent system that uses COA. Simulations show that our algorithm is feasible and effective compared with previous task allocation approaches, thereby illustrating that our design ideas are correct.

Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2015/984047.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2015/984047.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:984047

DOI: 10.1155/2015/984047

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().