scholarly journals Validation of Hybridized Particle Swarm Optimization (PSO) Algorithm with the Pheromone Mechanism of Ant Colony Optimization (ACO) using Standard Benchmark Function

2018 ◽  
Vol 7 (23) ◽  
pp. 13-20
Author(s):  
Mogaji Stephen ◽  
Alese Boniface ◽  
Adetunmbi Adebayo
Keyword(s):  
Particle Swarm Optimization ◽  
Ant Colony Optimization ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Ant Colony ◽  
Benchmark Function ◽  
Swarm Optimization

A Comparative Study on Inverse Vibration Based Damage Assessment Techniques in Beam Structure Using Ant Colony Optimization and Particle Swarm Optimization

2020 ◽  
Vol 12 (7) ◽  
pp. 918-923
Author(s):  
Aditi Majumdar ◽  
Bharadwaj Nanda
Keyword(s):  
Particle Swarm Optimization ◽  
Ant Colony Optimization ◽  
Damage Assessment ◽  
Damage Identification ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Ant Colony ◽  
Swarm Optimization ◽  
Soft Computing Techniques ◽  
Frequency Changes

Use of swarm intelligence has proliferated over previous couple of years for damage assessment in large and complex structures using vibration data. Available literatures shows ‘ant colony optimization’ (ACO) and ‘particle swarm optimization’ (PSO) are predominantly used for solving complex engineering problems including damage identification and quantification problems. The time requirement and accuracy of the vibration based damage identification algorithms depends on early exploration and late exploitation capabilities of soft computing techniques. However, there are not any literature available comparing algorithms on these bases. In the current study, an inverse problem is constructed using the natural frequency changes which is then solved using ACO and PSO algorithms. The algorithm is run for identification of single and multiple damages in simple support and cantilever beam structures. It's found that, both ACO and PSO based algorithms are capable of detecting and quantifying the damage accurately within the limited number of iterations. However, ACO based algorithm by virtue of its good exploration capability is able to identify near optimal region faster than PSO based algorithm, whereas PSO algorithm has good exploitation capability and hence able to provide better damage quantification than ACO algorithm at latter stages of iteration. Further, PSO based algorithm takes less time to reach at required accuracy level. It is also observed that, the time required for these algorithms are independent of numbers of damage and support conditions.

scholarly journals QALPA- An Efficient QoS Aware Hybrid Localization Model Using Particle Swarm Optimization and Ant Colony Optimization for Cognitive Wireless Sensor Networks

2021 ◽  
Vol 14 (1) ◽  
pp. 270-280
Author(s):  
Abhijit Halkai ◽  
◽  
Sujatha Terdal ◽  
Keyword(s):  
Particle Swarm Optimization ◽  
Sensor Networks ◽  
Ant Colony Optimization ◽  
Large Scale ◽  
Cluster Head ◽  
Particle Swarm ◽  
Base Station ◽  
Ant Colony ◽  
Swarm Optimization ◽  
Localization Model

A sensor network operates wirelessly and transmits detected information to the base station. The sensor is a small sized device, it is battery-powered with some electrical components, and the protocols should operate efficiently in such least resource availability. Here, we propose a novel improved framework in large scale applications where the huge numbers of sensors are distributed over an area. The designed protocol will address the issues that arise during its communication and give a consistent seamless communication system. The process of reasoning and learning in cognitive sensors guarantees data delivery in the network. Localization in Scarce and dense sensor networks is achieved by efficient cluster head election and route selection which are indeed based on cognition, improved Particle Swarm Optimization, and improved Ant Colony Optimization algorithms. Factors such as mobility, use of sensor buffer, power management, and defects in channels have been identified and solutions are presented in this research to build an accurate path based on the network context. The achieved results in extensive simulation prove that the proposed scheme outperforms ESNA, NETCRP, and GAECH algorithms in terms of Delay, Network lifetime, Energy consumption.

Particle Swarm Optimization Combined with Ant Colony Optimization for the Multiple Traveling Salesman Problem

2009 ◽  
Vol 626-627 ◽  
pp. 717-722 ◽  
Author(s):  
Hong Kui Feng ◽  
Jin Song Bao ◽  
Jin Ye
Keyword(s):  
Particle Swarm Optimization ◽  
Ant Colony Optimization ◽  
Traveling Salesman Problem ◽  
Particle Swarm ◽  
Traveling Salesman ◽  
Ant Colony ◽  
Great Success ◽  
Swarm Optimization ◽  
Continuous Space ◽  
Multiple Traveling Salesman Problem

A lot of practical problem, such as the scheduling of jobs on multiple parallel production lines and the scheduling of multiple vehicles transporting goods in logistics, can be modeled as the multiple traveling salesman problem (MTSP). Due to the combinatorial complexity of the MTSP, it is necessary to use heuristics to solve the problem, and a discrete particle swarm optimization (DPSO) algorithm is employed in this paper. Particle swarm optimization (PSO) in the continuous space has obtained great success in resolving some minimization problems. But when applying PSO for the MTSP, a difficulty rises, which is to find a suitable mapping between sequence and continuous position of particles in particle swarm optimization. For overcoming this difficulty, PSO is combined with ant colony optimization (ACO), and the mapping between sequence and continuous position of particles is established. To verify the efficiency of the DPSO algorithm, it is used to solve the MTSP and its performance is compared with the ACO and some traditional DPSO algorithms. The computational results show that the proposed DPSO algorithm is efficient.

scholarly journals Hybrid chaos-based particle swarm optimization-ant colony optimization algorithm with asynchronous pheromone updating strategy for path planning of landfill inspection robots

2019 ◽  
Vol 16 (4) ◽  
pp. 172988141985908 ◽  
Author(s):  
Peng Chen ◽  
Qing Li ◽  
Chao Zhang ◽  
Jiarui Cui ◽  
Hao Zhou
Keyword(s):  
Particle Swarm Optimization ◽  
Path Planning ◽  
Ant Colony Optimization ◽  
Particle Swarm ◽  
Ant Colony ◽  
Planning Problem ◽  
Swarm Optimization ◽  
Gas Poisoning ◽  
Inspection Robots ◽  
Elitist Strategy

Robots are coming to help us in different harsh environments such as deep sea or coal mine. Waste landfill is the place like these with casualty risk, gas poisoning, and explosion hazards. It is reasonable to use robots to fulfill tasks like burying operation, transportation, and inspection. In these assignments, one important issue is to obtain appropriate paths for robots especially in some complex applications. In this context, a novel hybrid swarm intelligence algorithm, ant colony optimization enhanced by chaos-based particle swarm optimization, is proposed in this article to deal with the path planning problem for landfill inspection robots in Asahikawa, Japan. In chaos-based particle swarm optimization, Chebyshev chaotic sequence is used to generate the random factors for particle swarm optimization updating formula so as to effectively adjust particle swarm optimization parameters. This improved model is applied to optimize and determine the hyper parameters for ant colony optimization. In addition, an improved pheromone updating strategy which combines the global asynchronous feature and “Elitist Strategy” is employed in ant colony optimization in order to use global information more appropriately. Therefore, the iteration number of ant colony optimization invoked by chaos-based particle swarm optimization can be reduced reasonably so as to decrease the search time effectively. Comparative simulation experiments show that the chaos-based particle swarm optimization-ant colony optimization has a rapid search speed and can obtain solutions with similar qualities.

Sign in / Sign up

Export Citation Format

Share Document