Particle Swarm Optimization (PSO) is one of the most powerful algorithms for optimization. Traditional PSO algorithm tends to suffer from slow convergence and trapping into local optimum. In this paper, an improved PSO algorithm is proposed by combining dynamic fractional order technology and the wavelet mutation strategy. In the proposed method, a dynamic fractional order velocity update equat...

This paper proposes a hybrid Particle Swarm Optimization (PSO) method, which is based on the fusion of the PSO, Clonal Selection Algorithm (CSA), and Mind Evolutionary Computation (MEC). The clone function borrowed from the CSA and MEC-characterized similartaxis and dissimilation operations are embedded in the original PSO algorithm. Simulations of nonlinear function optimization are made to co...

In this paper, we formulate the dynamics and philosophy of Quantum-behaved Particle Swarm Optimization (QPSO) Algorithm, and suggest a parameter control method based on the whole population level. After that we introduce a diversity-guided model into the QPSO to make the PSO system an open evolutionary particle swarm and therefore propose the Adaptive Quantum-behaved Particle Swarm Optimization...

Particle Swarm Optimization (PSO) has been a popular meta-heuristic for black-box optimization for almost two decades. In essence, within this paradigm, the system is fully defined by a swarm of “particles” each characterized by a set of features such as its position, velocity and acceleration. The consequent optimized global best solution is obtained by comparing the personal best solutions of...

Particle swarm optimization (PSO) has emerged as an acclaimed approach for solving complex optimization problems. The nature metaphors of flocking birds or schooling fish that originally motivated PSO have made the algorithm easy to describe but have also occluded the view of valuable strategies based on other foundations. From a complementary perspective, scatter search (SS) and path relinking...

A new particle filter algorithm based on new Clone particle swarm optimization(NCPSO-PF) is presented in this paper in order to solve the problem of low precision and complicated calculation of particle filter based on particle swarm optimization algorithm(PSO-PF). The algorithm enables the particles to fit the environment better and then reach the goal of global optimization through orthogonal...

Particle swarm optimization (PSO) method is relatively a new population-based intelligence algorithm and exhibits good performance in optimization problems. However, during the optimization process, the particles become more and more similar, and gather into the neighborhood of the best particle in the swarm, which makes the swarm prematurely converged possibly around the local solution. PSO te...

Efficient multiprocessor scheduling is essentially the problem of allocating a set of computational jobs to a set of processors to minimize the overall execution time. The main issue is how jobs are partitioned in which total finishing time and waiting time is minimized. Minimization of these two criteria simultaneously, is a multi objective optimization problem. There are many variations of th...

Graph coloring problem (GCP) is one of the most studied combinatorial optimization problems. It is important in theory and practice. There have been many algorithms for graph coloring problem, including exact algorithms and (meta-)heuristic algorithms. In this paper, we attempt another meta-heuristic method⎯particle swarm optimization to graph coloring problem. Particle swarm optimization (PSO)...

The vehicle routing problem VRP is a well-known combinatorial optimization problem. It has been studied for several decades because finding effective vehicle routes is an important issue of logistic management. This paper proposes a new hybrid algorithm based on two main swarm intelligence SI approaches, ant colony optimization ACO and particle swarm optimization PSO , for solving capacitated v...