نتایج جستجو برای: improved particle swarm optimization

تعداد نتایج: 901286  

Journal: :Symmetry 2021

Particle Swarm Optimization (PSO) has been widely used to solve various types of optimization problems. An efficient algorithm must have symmetry information between participating entities. Enhancing efficiency relative the symmetric concept is a critical challenge in field security. PSO also becomes trapped into local optima similarly other nature-inspired algorithms. The literature depicts th...

2013
Heqing Li

The basic Particle Swarm Optimization (PSO) algorithm and its principle have been introduced, the Particle Swarm Optimization has low accelerate speed and can be easy to fall into local extreme value, so the Particle Swarm Optimization based on the improved inertia weight is presented. This method means using nonlinear decreasing weight factor to change the fundamental ways of PSO. To allow ful...

2013
Deyu TANG Yongming CAI Xianfa CAI

Quantum-behaved particle swarm optimization (QPSO) algorithm is a global convergence guaranteed algorithms, which has been applied widely for continuous optimization problems. In this paper, we propose an improved quantum-behaved particle swarm optimization with memory according to the means of best position of particles and using sigal step seaching strategy for sovle the multidimentional prob...

2010
Lei WAN Xiao LIANG Bingjie GUO

Sigmoid surface controller has been proved to be effective in motion control of autonomous underwater vehicles, but it is hard to adjust its control parameters. Improved particle swarm optimization of sigmoid surface controller was proposed in this paper, which solves the problems that particle swarm optimization may be trapped in local optimum and fails to converge to global optimum. Moreover,...

Journal: :مهندسی صنایع 0
مهدی بشیری department of industrial engineering reza b. kazemzade department of industrial engineering anthony c. atkinson department of statistics of lse hossein karimi department of industrial engineering

the simultaneous optimization of multiple responses is an important problem in the design of industrial processes in order to achieve improved quality. in this paper, we present a new metaheuristic approach including simulated annealing and particle swarm optimization to optimize all responses simultaneously. for the purpose of illustration and comparison, the proposed approach is applied to tw...

Journal: :journal of chemical and petroleum engineering 2014
abdolnabi hashemi afshin ghanbarzadeh siamak hosseini

the dogleg severity is one of the most important parameters in directional drilling. improvement of these indicators actually means choosing the best conditions for the directional drilling in order to reach the target point. selection of high levels of the dogleg severity actually means minimizing well trajectory, but on the other hand, increases fatigue in drill string, increases torque and d...

2010
Qiang Lu Xuena Qiu

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

2006
Jing Jie Jianchao Zeng Chongzhao Han

Swarm-diversity is an important factor influencing the global convergence of particle swarm optimization (PSO). In order to overcome the premature convergence, the paper introduced a negative feedback mechanism into particle swarm optimization and developed an adaptive PSO. The improved method takes advantage of the swarm-diversity to control the tuning of the inertia weight (PSO-DCIW), which i...

2015
Jianping Li J. P. Li

To enhance the performance of quantum-behaved PSO, some improvements are proposed. First, an encoding method based on the Bloch sphere is presented. In this method, each particle carries three groups of Bloch coordinates of qubits, and these coordinates are actually the approximate solutions. The particles are updated by rotating qubits about an axis on the Bloch sphere, which can simultaneousl...

2012
K. Thanushkodi K. Deeba

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

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید