Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 984047, 10 pages
Research Article

A Cooperative Optimization Algorithm Inspired by Chaos–Order Transition

1School of Computer Science and Technology, Huaibei Normal University, Huaibei 235000, China
2College of Information Engineering, Chaohu University, Chaohu 238000, China

Received 17 May 2015; Revised 29 July 2015; Accepted 3 August 2015

Academic Editor: Matteo Gaeta

Copyright © 2015 Fangzhen Ge et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.