Optimisation-based methods are enormously used in the field of data classification. Particle Swarm Optimization (PSO) is a metaheuristic algorithm based on swarm intelligence, widely to solve global optimisation problems throughout real world. The main problem PSO faces premature convergence due lack diversity, and it usually stuck local minima when dealing with complex real-world problems. In ...

Abstract Aiming at the problem of low localization accuracy and poor robustness when conventional algorithms are used for WSN nodes, an improved particle swarm algorithm based on evolutionary mechanism is proposed. To reduce ranging error in a complex environment, anchor box by using information, search area reduced to determine possible region where unknown nodes exist. Then objective function...

job shop scheduling problem has significant importance in many researchingfields such as production management and programming and also combinedoptimizing. job shop scheduling problem includes two sub-problems: machineassignment and sequence operation performing. in this paper combination ofparticle swarm optimization algorithm (pso) and gravitational search algorithm(gsa) have been presented f...

This paper deals with the problem of unconstrained optimization. An improved probability particle swarm optimization algorithm is proposed. Firstly, two normal distributions are used to describe the distributions of particle positions, respectively. One is the normal distribution with the global best position as mean value and the difference between the current fitness and the global best fitne...

Vehicle routing problem is a NP hard problem. To solve the premature convergence problem of the particle swarm optimization, an improved particle swarm optimization method was proposed. In the first place, introducing the neighborhood topology, defining two new concepts lepton and hadron. Lepton are particles within the scope of neighborhood, which have weak interaction between each other, so t...

this article presents the application of two algorithms: heuristic big bang-big crunch (hbb-bc) and a heuristic particle swarm ant colony optimization (hpsaco) to discrete optimization of reinforced concrete planar frames subject to combinations of gravity and lateral loads based on aci 318-08 code. the objective function is the total cost of the frame which includes the cost of concrete, formw...

this paper presents a relatively new management model for the optimal design and operation of irrigation water pumping systems. the model makes use of the newly introduced particle swarm optimization algorithm. a two step optimization model is developed and solved with the particle swarm optimization method. the model first carries out an exhaustive enumeration search for all feasible sets of p...

This paper presents an analysis of the relationship of particle velocity and convergence of the particle swarm optimization. Its premature convergence is due to the decrease of particle velocity in search space that leads to a total implosion and ultimately fitness stagnation of the swarm. An improved algorithm which introduces a velocity differential evolution (DE) strategy for the hierarchica...

Particle swarm optimization (PSO) is a kind of evolutionary algorithm to find optimal solutions for continuous optimization problems. Updating kinetic equations for particle swarm optimization algorithm are improved to solve traveling salesman problem (TSP) based on problem characteristics and discrete variable. Those strategies which are named heuristic factor, reversion mutant and adaptive no...