Back to Search
Start Over
A Cooperative Optimization Algorithm Inspired by Chaos–Order Transition.
- Source :
-
Mathematical Problems in Engineering . 9/16/2015, Vol. 2015, p1-10. 10p. - Publication Year :
- 2015
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 1024123X
- Volume :
- 2015
- Database :
- Academic Search Index
- Journal :
- Mathematical Problems in Engineering
- Publication Type :
- Academic Journal
- Accession number :
- 109990536
- Full Text :
- https://doi.org/10.1155/2015/984047