نتایج جستجو برای: cpso

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

2011
Bilal Benmessahel Mohamed Touahria

Vertical partition is an important technique in database design used to enhance performance in database systems. Vertical fragmentation is a combinatorial optimization problem that is NP-hard in most cases. We propose an application and an adaptation of an improved combinatorial particle swarm optimization (ICPSO) algorithm for the vertical fragmentation problem. The original CPSO algorithm [1]...

2015
Erdong Zhao Jing Zhao Liwei Liu Zhongyue Su Ning An Frede Blaabjerg

Wind speed forecasting is difficult not only because of the influence of atmospheric dynamics but also for the impossibility of providing an accurate prediction with traditional statistical forecasting models that work by discovering an inner relationship within historical records. This paper develops a self-adaptive (SA) auto-regressive integrated moving average with exogenous variables (ARIMA...

2013
Michael Mutingi Charles Mbohwa

The home healthcare staff scheduling problem is concerned with the allocation of care tasks to healthcare staff at a minimal cost, subject to healthcare service requirements, labor law, organizational requirements, staff preferences, and other restrictions. Healthcare service providers strive to meet the time window restrictions specified by the patients to improve their service quality. This p...

2016
Hongmin Li Yigang He Yichuang Sun

An approach for the construction of optimal analog wavelet bases is presented. First, the definition of an analog wavelet is given. Based on the definition and the least-squares error criterion, a general framework for designing optimal analog wavelet bases is established, which is one of difficult nonlinear constrained optimization problems. Then, to solve this problem, a hybrid algorithm by c...

2001
F. van den Bergh

The Cooperative Particle Swarm Optimiser (CPSO) is a variant of the Particle Swarm Optimiser (PSO) that splits the problem vector, for example a neural network weight vector, across several swarms. This paper investigates the influence that the number of swarms used (also called the split factor) has on the training performance of a Product Unit Neural Network. Results are presented, comparing ...

2003
Tim M. Blackwell

Charged particle swarm optimization (CPSO) is well suited to the dynamic search problem since inter-particle repulsion maintains population diversity and good tracking can be achieved with a simple algorithm. This work extends the application of CPSO to the dynamic problem by considering a bi-modal parabolic environment of high spatial and temporal severity. Two types of charged swarms and an a...

2015
Shubham Tiwari Abhishek Maurya

Economic load dispatch is a non linear optimization problem which is of great importance in power systems . While analytical methods suffer from slow conversion and curse of dimensionality particle swarm optimization can be an efficient alternative to solve large scale non linear optimization problem.A lot of advancements have been done to modify this algorithm. This paper presents an overview ...

Journal: :Iet Renewable Power Generation 2022

In this paper, the amount of microgrid frequency deviation in dynamic state can be reduced by improving controller and implementing a new method. The proposed is designed for including renewable resources, control strategy such that coefficients are adjusted optimised at all times model predictive (MPC). weight parameters MPC have been particle swarm optimisation (PSO) algorithm. located second...

Journal: :Axioms 2022

To achieve the maximum power from wind in variable-speed regions of turbines (WTs), a suitable control signal should be applied to pitch angle blades. However, available uncertainty modeling WTs complicates calculations these signals. cope with this problem, an optimal controller is suitable, such as particle swarm optimization (PSO). improve performance controller, fractional order PSO (FPSO) ...

Journal: :Xibei gongye daxue xuebao 2021

In order to solve the problem of path planning for spacecraft cluster reach dynamic target point under premise considering obstacle avoidance. view fixed search radius, it will be difficult find a better value when is close point. This paper converts orbital dynamics each member into an optimization constraints, and proposes improved CPSO algorithm based on coordination. The method traditional ...

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

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