A cooperative optimization algorithm inspired by chaos-order transition

DOI10.1155/2015/984047MaRDI QIDQ1667142zbMATH OpenOpenAlexWikidataFDO

Authors Fangzhen Ge, Liurong Hong, Qilin Wu, Li Shi

Publication date 27 August 2018

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.1155/2015/984047

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Review text

Summary: 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.

Recommendations

• An optimization method inspired by ``chaotic ant behavior
• Disturbance chaotic ant swarm
• Algorithms of distributed task allocation for cooperative agents
• OPTIMIZING COMPLEX FUNCTIONS BY CHAOS SEARCH
• scientific article; zbMATH DE number 1900792

Cites work

• Adopt: asynchronous distributed constraint optimization with quality guarantees
• An optimization method inspired by ``chaotic ant behavior
• Asynchronous Broadcast-Based Convex Optimization Over a Network
• CAS based clustering algorithm for web users
• Consensus and Cooperation in Networked Multi-Agent Systems
• Consensus of Multiagent Systems and Synchronization of Complex Networks: A Unified Viewpoint
• Distributed asynchronous deterministic and stochastic gradient optimization algorithms
• Distributed Subgradient Methods for Multi-Agent Optimization
• Disturbance chaotic ant swarm
• On Distributed Convex Optimization Under Inequality and Equality Constraints
• Optimal Resource Allocation for MIMO Ad Hoc Cognitive Radio Networks
• Rate control for communication networks: shadow prices, proportional fairness and stability
• Task allocation for maximizing reliability of distributed systems: a simulated annealing approach

Cited in

(5)

• Phase transitions in swarm optimization algorithms
• Disturbance chaotic ant swarm
• scientific article; zbMATH DE number 5308321 (Why is no real title available?)
• scientific article; zbMATH DE number 1488093 (Why is no real title available?)
• scientific article; zbMATH DE number 5585054 (Why is no real title available?)

This page was built for publication: A cooperative optimization algorithm inspired by chaos-order transition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1667142)