نتایج جستجو برای: pso variants
تعداد نتایج: 118716 فیلتر نتایج به سال:
An algorithm with different parameter settings often performs differently on the same problem. The are difficult to determine before optimization process. variants of particle swarm (PSO) algorithms studied as exemplars intelligence algorithms. Based concept building block thesis, a PSO multiple phases was proposed analyze relation between search strategies and solved problems. Two algorithm, w...
Particle swarm optimization (PSO) is a nature-inspired algorithm that has shown outstanding performance in solving many realistic problems. In the original PSO and most of its variants all particles are treated equally, overlooking the impact of structural heterogeneity on individual behavior. Here we employ complex networks to represent the population structure of swarms and propose a selectiv...
Most of the well-established particle swarm optimization (PSO) variants do not provide alternative learning strategies when particles fail to improve their fitness during the searching process. To solve this issue, we improved the state-of-art teaching–learningbased optimization algorithm and adapted the enhanced framework into the PSO. Thus, we developed a bidirectional teaching and peer-learn...
This paper proposes a cellular particle swarm optimization (CPSO), hybridizing cellular automata (CA) and particle swarm optimization (PSO) for function optimization. In the proposed CPSO, a mechanism of CA is integrated in the velocity update to modify the trajectories of particles to avoid being trapped in the local optimum. With two different ways of integration of CA and PSO, two versions o...
Particle Swarm Optimization (PSO) is an effective tool in solving optimization problems. However, PSO usually suffers from the premature convergence due to the quick losing of the swarm diversity. In this paper, we first analyze the motion behavior of the swarm based on the probability characteristic of learning parameters. Then a PSO with double learning patterns (PSO-DLP) is developed, which ...
Premature convergence is a major challenge for particle swarm optimization algorithm (PSO) when dealing with multi-modal problems. The reason is partly due to the insufficient exploration capability because of the fast convergent speed especially in the final stage. In this paper, the PSO is regarded as a two-inputs one-output feedback system, and two PID controllers are incorporated into the m...
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...
This paper proposes a novel variant of cooperative quantum-behaved particle swarm optimization (CQPSO) algorithm with two mechanisms to reduce the search space and avoid the stagnation, called CQPSO-DVSA-LFD. One mechanism is called Dynamic Varying Search Area (DVSA), which takes charge of limiting the ranges of particles' activity into a reduced area. On the other hand, in order to escape the ...
Vehicle Routing Problem (VRP) is addressed to a class of problems for determining a set of vehicle routes, in which each vehicle departs from a given depot, serves a given set of customers, and returns back to the same depot. On the other hand, simultaneous delivery and pickup problems have drawn much attention in the past few years due to its high usage in real world cases. This study, therefo...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید