Highly Flexible Swarm Intelligence Algorithm for Resilient Autonomous Systems

Author(s):  
J. Clifford ◽  
M. Towhidnejad ◽  
J. Neighbors ◽  
E. Verenich ◽  
G. Staskevich
2014 ◽  
Vol 951 ◽  
pp. 239-244 ◽  
Author(s):  
Xiao Qiang Xu ◽  
De Ming Lei

The lot streaming (LS) problem in job shop with equal-size sub-lots and intermittent idling is considered. An effective swarm intelligence algorithm with an artificial bee colony (ABC) algorithm is proposed for the minimization of total penalties of tardiness and earliness. In the first period of ABC, the employed bee phase and the onlooker bee phase are both for lot/sub-lot scheduling. In the second period, the LS conditions are determined in the employed bee phase and the lot/sub-lot is scheduled in the onlooker phase. The worst solution of the swarm is replaced with the elite one every few cycles. Computational results show the promising advantage of ABC.


Author(s):  
Ahmed T. Sadiq Al-Obaidi ◽  
Hasanen S. Abdullah ◽  
Zied O. Ahmed

<p>Evolutionary computation and swarm intelligence meta-heuristics are exceptional instances that environment has been a never-ending source of creativeness. The behavior of bees, bacteria, glow-worms, fireflies and other beings have stirred swarm intelligence scholars to create innovative optimization algorithms. This paper proposes the Meerkat Clan Algorithm (MCA) that is a novel swarm intelligence algorithm resulting from watchful observation of the Meerkat (Suricata suricatta) in the Kalahari Desert in southern Africa. This animal shows an exceptional intelligence, tactical organizational skills, and remarkable directional cleverness in its traversal of the desert when searching for food. A Meerkat Clan Algorithm (MCA) proposed to solve the optimization problems through reach the optimal solution by efficient way comparing with another swarm intelligence. Traveling Salesman Problem uses as a case study to measure the capacity of the proposed algorithm through comparing its results with another swarm intelligence. MCA shows its capacity to solve the Traveling Salesman’s Problem. Its dived the solutions group to sub-group depend of meerkat behavior that gives a good diversity to reach an optimal solution. Paralleled with the current algorithms for resolving TSP by swarm intelligence, it has been displayed that the size of the resolved problems could be enlarged by adopting the algorithm proposed here.</p>


2021 ◽  
pp. 47-60
Author(s):  
Ayushi Kirar ◽  
Siddharth Bhalerao ◽  
Om Prakash Verma ◽  
Irshad Ahmad Ansari

2015 ◽  
pp. 1434-1469 ◽  
Author(s):  
Hindriyanto Dwi Purnomo ◽  
Hui-Ming Wee

A new metaheuristic algorithm is proposed. The algorithm integrates the information sharing as well as the evolution operators in the swarm intelligence algorithm and evolutionary algorithm respectively. The basic soccer player movement is used as the analogy to describe the algorithm. The new method has two basic operators; the move off and the move forward. The proposed method elaborates the reproduction process in evolutionary algorithm with the powerful information sharing in the swarm intelligence algorithm. Examples of implementations are provided for continuous and discrete problems. The experiment results reveal that the proposed method has the potential to become a powerful optimization method. As a new method, the proposed algorithm can be enhanced in many different ways such as investigating the parameter setting, elaborating more aspects of the soccer player movement as well as implementing the proposed method to solve various optimization problems.


IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 64744-64757 ◽  
Author(s):  
Shiqiang Wang ◽  
Jianchun Xing ◽  
Ziyan Jiang ◽  
Yunchuang Dai

Sign in / Sign up

Export Citation Format

Share Document