scholarly journals Fitness Function Based Particle Swarm Optimization Algorithm for Mobile Adhoc Networks

2018 ◽  
Vol 7 (3.1) ◽  
pp. 31
Author(s):  
Rohan Gupta ◽  
Gurpreet Singh ◽  
Amanpreet Kaur ◽  
Aashdeep Singh

Mobile adhoc network is a network which carries out discussion between nodes in the absence of infrastructure. The fitness function based Particle Swarm Optimization Algorithm has been projected for improving the network performance. The effect of changing the number of nodes, communication range and transmission range is investigated on various qualities of service metrics namely packet delivery ratio, throughput and average delay. The investigation has been carried out using NS-2 simulator.  

2012 ◽  
Vol 6-7 ◽  
pp. 736-741
Author(s):  
Xin Min Ma ◽  
Lin Li Wu

A new algorithm for timetabling based on particle swarm optimization algorithm was proposed, and the key problems such as particle coding, fitness function fabricating, particle swarm initialization and crossover operation were settled. The fitness value declines when the evolution generation increases. The results showed that it was a good solution for course timetabling problem in the educational system.


2020 ◽  
Vol 14 ◽  
pp. 174830262097353
Author(s):  
Ji Zhao ◽  
Yi Fu ◽  
Juan Mei

A novel dynamic cooperative random drift particle swarm optimization algorithm based on entire search history decision (CRDPSO) is reported. At each iteration, the positions and the fitness values of the evaluated solutions in the algorithm are stored by a binary space partitioning tree structure archive, which leads to a fast fitness function approximation. The mutation is adaptive and parameter-less because of the fitness function approximation enhancing the mutation strategy. The dynamic cooperation between the particles by using the context vector increases the population diversity helps to improve the search ability of the swarm and cooperatively searches for the global optimum. The performance of CRDPSO is tested on standard benchmark problems including multimodal and unimodal functions. The empirical results show that CRDPSO outperforms other well-known stochastic optimization methods.


Author(s):  
Sunil Kumar K N ◽  
Shiva Shankar

Objective: The conventional Ad Hoc On-Demand Distance Vector (AODV) routing algorithm, route discovery methods pose route failure resulting in data loss and routing overhead. In the proposed method, needs significant low energy consumption while routing from one node to another node by considering the status of node forwards the packet. So that while routing it avoids unnecessary control overhead and improves the network performance. Methods: Particle Swarm Optimization (PSO) algorithm is a nature- inspired, population-based algorithm. Particle Swarm Optimization (PSO) is a Computational Intelligence technique which optimizes the objective function. It works by considering that every member of the swarm contributes in finding the ideal solution by keeping a track of their own best known location and the best-known location of the group and keeps updating them whenever there is a change and hence minimizes the objective fitness function. The fitness function which we considered here is the Node lifetime, Link Lifetime and available Bandwidth. If these parameters are with good then status of node will be strong and hence routing of packet over those nodes will reduce delay and improves network performance. Result: To verify the feasibility and effectiveness of our proposal, the routing performance of AODV and PSO-AODV is compared with respect to various network metrics like Network Lifetime, packet delivery ratio and routing overhead and validated the result by comparing both routing algorithm using Network Simulator 2. The results of the PSO-AODV has outperformed the AODV in terms of low energy, less end to end delay and high packet delivery ratio and less control overhead. Conclusion: Here we proposed to use Particle Swarm Optimization in order to obtain the more suitable parameters for the decision making. The existing AODV protocol was modified to make a decision to recover from route failure; at the link failure predecessor node implementing PSO based energy prediction concept and using weights for each argument considered in the decision function. The fitness values for each weight were found through PSO basic form. We observed that the PSO showed satisfactory behaviour improvement than the performance of AODV for all metrics on the investigated scenarios.


2011 ◽  
Vol 55-57 ◽  
pp. 633-638 ◽  
Author(s):  
Wen Xian Tang ◽  
Jun Jie Sun ◽  
Bin Wang

A method for comprehensive dynamic balance of mechanism based on the particle swarm optimization is presented. This paper adopted nonlinear multi-objective programming method to carry out a study on three dynamic property indexes including inertia force, reaction of kinematic pair and input torque. Optimum solution for the parameters estimation problem based on the particle swarm optimization algorithm is obtained by constructing a fitness function of the mathematical optimization model, which consists of those property indexes. The simulation results indicate that the proposed method could eliminate the reluctant evaluations and interactions remarkably, thus improves the application's performance.


2013 ◽  
Vol 722 ◽  
pp. 550-556
Author(s):  
Xiao Mo Yu ◽  
Ai Ling Qin ◽  
Jia Hai Xue ◽  
Jun Ke Ye ◽  
Wen Jing Zhou

In this paper, the forming process is applied to the structure design of the metal bellows for the synergistic optimization.With bellows minimum overall stiffness and minimum weight for the optimization objectives to establish multi-objective optimization design model, using the Maximin fitness function strategy based multi-objective particle swarm optimization algorithm and introduce the multiple subgroup cooperative search strategy by master-slave clustering to get the optimized solution at the same time. The algorithm is applied to the synergistic optimization of the metal bellows structure design. The results show that the convergent speed of the algorithm is fast and can effectively approximate the actual bellows structure design, and provide users with more practical and intuitive effectively design scheme.


2013 ◽  
Vol 823 ◽  
pp. 661-664
Author(s):  
Guang Yao Lian ◽  
Peng Cheng Yan ◽  
Jiang Sheng Sun ◽  
Kao Li Huang

To solve the backdating problem of traditional test generation methods, it puts forward a new test generation method based on improved binary particle swarm optimization algorithm in the paper. It estates the fitness function of test vector and faults in the circuits, and the optimal solution is the maximal value of the function. The experimentations prove that the method can reduce the compute quantity of test generation.


Sensor Review ◽  
2019 ◽  
Vol 39 (5) ◽  
pp. 708-715
Author(s):  
Xiaobin Xu ◽  
Minzhou Luo ◽  
Zhiying Tan ◽  
Min Zhang ◽  
Hao Yang

Purpose This paper aims to investigate the effect of unknown noise parameters of Kalman filter on velocity and displacement and to enhance the measured accuracy using adaptive Kalman filter with particle swarm optimization algorithm. Design/methodology/approach A novel method based on adaptive Kalman filter is proposed. Combined with the displacement measurement model, the standard Kalman filtering algorithm is established. The particle swarm optimization algorithm fused with Kalman is used to obtain the optimal noise parameter estimation using different fitness function. Findings The simulations and experimental results show that the adaptive Kalman filter algorithm fused with particle swarm optimization can improve the accuracy of the velocity and displacement. Originality/value The adaptive Kalman filter algorithm fused with particle swarm optimization can serve as a new method for optimal state estimation of moving target.


2014 ◽  
Vol 889-890 ◽  
pp. 1073-1077 ◽  
Author(s):  
Chen Ming Li ◽  
Yan Wang ◽  
Hong Min Gao ◽  
Li Li Zhang

Hyperspectral images have been widely used in earth observation. However, there are some problems such as huge amount of data and high correlation between bands. An application of particle swarm optimization algorithm based on B distance was proposed to band selection of hyperspectral images. First of all, bands are grouping by the correlation coefficient of the band and adjacent bands. B distance was used as separability criterion between classes and the fitness function comes into being. Finally, the classification results illustrate that the total classification accuracy of the proposed method is higher than the traditional method.


Sign in / Sign up

Export Citation Format

Share Document