In this paper, an effective combination of two Metaheuristic algorithms, namely Invasive Weed Optimization and the Particle Swarm Optimization, has been proposed. This hybridization called as HIWOPSO, consists of two main phases of Invasive Weed Optimization (IWO) and Particle Swarm Optimization (PSO). Invasive weed optimization is the natureinspired algorithm which is inspired by colonial beha...

With the combination of particle swarm optimization and neural network, this paper presents a kind of analog circuit fault diagnosis method based on particle swarm neural network. In the training process, the linear decreasing inertia weight particle swarm algorithm optimized BP network’s initial weights and initial threshold, adaptive learning rate and additional momentum BP algorithm adjusted...

By taking advantage of niche sharing scheme,we propose a novel co-evolutionary particle swarm optimization algorithm (NCPSO) to solve permutation flow shop scheduling problem. As the core of this algorithm, niche sharing scheme maximizes the diversity of population and hence improves the quality of individuals. To evaluate the performance of the proposed algorithm, we have use eight Taillard in...

Vehicle routing problem is a NP-hard problem in combination optimization problem, It is influenced by many factors, and the process is complex. However, the search space of particle swarm algorithm is limited and prone to precocious phenomenon. In this paper, we based on the original particle swarm optimization, present a new way of location update algorithm (VPSO).VPSO in the process of solvin...

A niche chaotic mutation particle swarm optimization (NCPSO) algorithm is proposed to overcome the problem of loss details of images, the contrast is not obvious and poor adaptability in traditional image enhancement methods. In this algorithm, niching methods and elimination strategy are introduced to improve the global optimization ability. Mutative scale chaos mutation algorithm has refined ...

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

In this paper, we propose a new optimized PID controller to stabilize the synchronous machine connected to an infinite bus. The model for the synchronous machine is 4-ordered linear Philips-Heffron synchronous machine. In this research, the parameters of the PID controller are optimally achieved by minimizing a definite fitness function to removes the unstable Eigen-value to the left side of im...

A new promising strategy for the PSO (Particle swarm optimization) algorithm is proposed and described in this paper. This new strategy presents alternative way of assigning new velocity to each individual in particle swarm (population). This new multiple choice particle swarm optimization (MC-PSO) algorithm is tested on two different shifted test functions to show the performance on problems t...

State-of-the-art heuristic algorithms to solve the vehicle routing problem with time windows (VRPTW) usually present slow speeds during the early iterations and easily fall into local optimal solutions. Focusing on solving the above problems, this paper analyzes the particle encoding and decoding strategy of the particle swarm optimization algorithm, the construction of the vehicle route and th...

We propose a new Memetic Particle Swarm Optimization scheme that incorporates local search techniques in the standard Particle Swarm Optimization algorithm, resulting in an efficient and effective optimization method, which is analyzed theoretically. The proposed algorithm is applied to different unconstrained, constrained, minimax and integer programming problems and the obtained results are c...