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

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

2014
SHI MEI

Most reservoirs offer a mean of managing and regulating the downstream water flow and demands over time and space. It is a challenging task for the reservoir operator to evaluate the trade-off during drought and heavy rainfall season. This study proposes a review on the application of different computational intelligent models, especially the Artificial Bee Colony (ABC) approach in reservoir in...

Journal: :Inf. Sci. 2012
Bahriye Akay Dervis Karaboga

Swarm intelligence is a research field that models the collective intelligence in swarms of insects or animals. Many algorithms that simulates these models have been proposed in order to solve a wide range of problems. The Artificial Bee Colony algorithm is one of the most recent swarm intelligence based algorithms which simulates the foraging behaviour of honey bee colonies. In this work, modi...

Journal: :The Journal of Basic and Applied Zoology 2021

Abstract Background There is one queen in each honey bee, Apis mellifera L., colony under normal conditions. This performs egg laying and pheromonal control the colony. All genetic characteristics of bee workers drones depend on queen. reflects importance In this review, behaviors queens are presented further studies suggested to fill gaps knowledge. Main body The major about either inside or o...

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

Artificial bee colony (ABC) algorithm has been introduced for solving numerical optimization problems, inspired collective behavior of honey bee colonies. ABC algorithm has three phases named as employed bee, onlooker bee and scout bee. In the model of ABC, only one design parameter of the optimization problem is updated by the artificial bees at the ABC phases by using interaction in the bees....

2011
Ivona BRAJEVIC

This paper presents an artificial bee colony (ABC) algorithm adjusted for the capacitated vehicle routing problem. The vehicle routing problem is an NP-hard problem and capacitated vehicle routing problem variant (CVRP) is considered here. The artificial bee metaheuristic was successfully used mostly on continuous unconstrained and constrained problems. Here this algorithm has been implemented ...

2005
Dušan TEODOROVIĆ Mauro DELL

Various natural systems teach us that very simple individual organisms can create systems able to perform highly complex tasks by dynamically interacting with each other. The Bee Colony Optimization Metaheuristic (BCO) is proposed in this paper. The artificial bee colony behaves partially alike, and partially differently from bee colonies in nature. The BCO is capable to solve deterministic com...

Journal: :Swarm and Evolutionary Computation 2017
Anguluri Rajasekhar Nandar Lynn Swagatam Das Ponnuthurai N. Suganthan

Over past few decades, families of algorithms based on the intelligent group behaviors of social creatures like ants, birds, fishes, and bacteria have been extensively studied and applied for computer-aided optimization. Recently there has been a surge of interest in developing algorithms for search, optimization, and communication by simulating different aspects of the social life of a very we...

2012
O. Abedinia N. Amjady H. R. Izadfar H. A. Shayanfar

In this paper a Multi-objective Honey Bee Mating Optimization (MOHBMO) technique is applied to damp power system oscillation by tuning the Power System Stabilizer (PSS) parameters. Selecting the parameters of PSS which simultaneously stabilize system oscillations is converted to a simple optimization problem which is solved by a HBMO. In the proposed syndicate tuning technique, two performances...

2011
Li Li Yurong Cheng Lijing Tan Ben Niu

In this paper, a new discrete artificial bee colony algorithm is used to solve the symmetric traveling salesman problem (TSP). The concept of Swap Operator has been introduced to the original artificial bee colony (ABC) algorithm which can help the bees to generate a better candidate tour by greedy selection. By taken six typical TSP instances as examples, the proposed algorithm is compared wit...

2014
Broderick Crawford Ricardo Soto Rodrigo Cuesta Fernando Paredes

The set covering problem is a formal model for many practical optimization problems. In the set covering problem the goal is to choose a subset of the columns of minimal cost that covers every row. Here, we present a novel application of the artificial bee colony algorithm to solve the non-unicost set covering problem. The artificial bee colony algorithm is a recent swarm metaheuristic techniqu...

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

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