نتایج جستجو برای: adaptive particle swarm optimization apso
تعداد نتایج: 664762 فیلتر نتایج به سال:
The selection of global best (Gbest) exerts a high influence on the searching performance multi-objective particle swarm optimization algorithm (MOPSO). candidates MOPSO in external archive are always estimated to select Gbest. However, most estimation methods, considered as Gbest fixed way, which is difficult adapt varying evolutionary requirements for balance between convergence and diversity...
In this paper, we propose a dynamic, non-dominated sorting, multiobjective particle-swarm-based optimizer, named Hierarchical Non-dominated Sorting Particle Swarm Optimizer (H-NSPSO), for memory usage optimization in embedded systems. It significantly reduces the computational complexity of others MultiObjective Particle Swarm Optimization (MOPSO) algorithms. Concretely, it first uses a fast no...
differential steering of in-wheel electric vehicle provides the functions of both active steering and power assisted steering with the coupling control of force and displacement transfer characteristic of system. a collaborative optimization model of the differential power-assisted steering system of in-wheel electric vehicle is built, with steering economy as the main system optimization goal,...
This paper presents a modification of Particle Swarm Optimization (PSO) technique based on cooperative behavior of swarms and learning ability of an automaton. The approach is called Cooperative Particle Swarm Optimization based on Learning Automata (CPSOLA). The CPSOLA algorithm utilizes three layers of cooperation which are intra swarm, inter swarm and inter population. There are two active p...
مسئله ی یافتن کلیک بیشینه گراف maximum clique problem (mcp)، از جمله مسائل np-complete است که به یافتن بزرگترین زیرگراف کامل در یک گراف ساده اشاره دارد و در موارد متنوعی از جمله نظریه کدگذاری، هندسه و شبکه های اجتماعی کاربرد دارد. در این پژوهش الگوریتمی ترکیبی برای حل مسئله ی کلیک بیشینه گراف پیشنهاد شده است. این الگوریتم ترکیبی از یک روش حریصانه ابتکاری و الگوریتم های مبتنی بر هوش جمعی بهینه س...
This paper proposes a refined version of particle swarm optimization technique for the optimum design of steel structures. Swarm is composed of a number of particles and each particle in the swarm represents a candidate solution of the optimum design problem. Design constraints in accordance with ASD-AISC (Allowable Stress Design Code of American Institute of Steel Institution) are imposed by t...
Gait identification task becomes difficult due to the change of appearance by different cofactors (e.g., shoe, surface, carrying, view, and clothing). Some parts of gait are affected by cofactors and other parts remains unaffected. Most of the gait identification systems consider only most effective parts thereby omitting less effective parts. However some significant features for gait identifi...
Metaheuristic optimization algorithms have become popular choice for solving complex and intricate problems which are otherwise difficult to solve by traditional methods. In the present study an attempt is made to review the hybrid optimization techniques in which one main algorithm is a well known metaheuristic; particle swarm optimization or PSO. Hybridization is a method of combining two (or...
This paper introduces a novel fuzzy adaptive optimization strategy (FAOPSO) for the particle swarm algorithm. Initially, to avoid falling into local optimums, the information of multioptimum distribution state is introduced into the particle swarm movement programming. However, in this kind of multi-optimum static programming mode (MSPPSO), the programming proportion factor of multi-optimum can...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید