نتایج جستجو برای: bee mating optimization hbmo algorithm

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

عارفی, علی, حقی فام , محمودرضا , فتحی, سید حمید ,

This paper presents a novel algorithm based on particle swarm optimization (PSO) to estimate the states of electric distribution networks. In order to improve the performance, accuracy, convergence speed, and eliminate the stagnation effect of original PSO, a secondary PSO loop and mutation algorithm as well as stretching function is proposed. For accounting uncertainties of loads in distributi...

2013
Fong Cheng Weng Hishammuddin bin Asmuni

A recently invented foraging behavior optimization algorithm which is the Artificial Bee Colony (ABC) algorithm has been widely implemented in addressing various types of optimization problems such as job shop scheduling, constraint optimization problems, complex numerical optimization problems, and mathematical function problems. However, the high exploration ability of conventional ABC has ca...

Journal: :Appl. Soft Comput. 2015
Mustafa Servet Kiran

Artificial bee colony (ABC) algorithm, one of the swarm intelligence algorithms, has been proposed for continuous optimization, inspired intelligent behaviors of real honey bee colony. For the optimization problems having binary structured solution space, the basic ABC algorithm should be modified because its basic version is proposed for solving continuous optimization problems. In this study,...

Journal: :international journal of smart electrical engineering 2013
reza ilka yousef alinejad-beromi hossein asgharpour-alamdari hamid yaghobi

permanent magnet synchronous generators (pmsgs) are novel generators which can be used in high-performance wind farms. high efficiency and flexibility in producing electricity from variable rotation make them good candidate for wind power applications. furthermore, because these kinds of generators have no excitation winding, there is no copper loss on rotor; hence, they can operate at high pow...

Journal: :Mathematics 2023

For constructing the best local codebook for image compression, there are many Vector Quantization (VQ) procedures, but simplest VQ procedure is Linde–Buzo–Gray (LBG) procedure. Techniques such as Gaussian Dissemination Function (GDF) used searching process in generating a global particle swarm optimization (PSO), Honeybee mating (HBMO), and Firefly (FA) procedures. However, when velocity very ...

Determination of optimum location for drilling a new well not only requires engineering judgments but also consumes excessive computational time. Additionally, availability of many physical constraints such as the well length, trajectory, and completion type and the numerous affecting parameters including, well type, well numbers, well-control variables prompt that the optimization approaches b...

2013
Mimoun Younes Riad Lakhdar Kherfane Fouad Khodja

In this paper, a novel hybrid optimization algorithm, which combines a firefly algorithms and Artificial Bee Colony algorithm (FFAABC), is proposed for solving the economic power dispatch (EPD) problem. The hybrid algorithm is structured with two stages. The first stage uses the search by firefly algorithm (FFA) and second stage is a search with Artificial Bee Colony algorithm (ABC). The hybrid...

Investment decision making is one of the key issues in financial management. Selecting the appropriate tools and techniques that can make optimal portfolio is one of the main objectives of the investment world. This study tries to optimize the decision making in stock selection or the optimization of the portfolio by means of the artificial colony of honey bee algorithm. To determine the effect...

Journal: :journal of advances in computer engineering and technology 0
azita yousefi payame noor university,tehran,iran. bita amirshahi payame noor university,tehran.iran

abstract— in this paper we have tried to develop an altered version of the artificial bee colony algorithm which is inspired from and combined with the meta-heuristic algorithm of firefly. in this method, we have tried to change the main equation of searching within the original abc algorithm. on this basis, a new combined equation was used for steps of employed bees and onlooker bees. for this...

The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

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

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