نتایج جستجو برای: bee colony optimization algorithm
تعداد نتایج: 1024006 فیلتر نتایج به سال:
K-means algorithm is sensitive to initial cluster centers and its solutions are apt to be trapped in local optimums. In order to solve these problems, we propose an optimized artificial bee colony algorithm for clustering. The proposed method first obtains optimized sources by improving the selection of the initial clustering centers; then, uses a novel dynamic local optimization strategy utili...
in this paper, a robust integral of the sign error (rise) feedback controller is designed for a rigid-link electrically driven (rled) robot manipulator actuated by direct current dc motor in presence of parametric uncertainties and additive disturbances. rise feedback with implicitly learning capability is a continuous control method based on the lyapunov stability analysis to compensate an add...
assigning a set of objects to groups such that objects in one group or cluster are more similar to each other than the other clusters’ objects is the main task of clustering analysis. sspco optimization algorithm is anew optimization algorithm that is inspired by the behavior of a type of bird called see-see partridge. one of the things that smart algorithms are applied to solve is the problem ...
The optimization of energy consumption in the cloud computing environment is the question how to use various energy conservation strategies to efficiently allocate resources. The need of different resources in cloud environment is unpredictable. It is observed that load management in cloud is utmost needed in order to provide QOS. The jobs at over-loaded physical machine are shifted to under-lo...
Software test suite optimization is one of the most important issue in software testing as testing consumes a lot of time in executing redundant test cases. In this paper, we have proposed and implemented a new approach for test suite optimization, namely, Mutated Artificial Bee Colony. Artificial Bee colony algorithm combines local search carried out by employed and onlooker bees with global s...
In this paper, a cardinality constrained mean-variance model is introduced for the portfolio optimization problems. This model is a mixed quadratic and integer programming problem for which efficient algorithms do not exist. The use of heuristic algorithms in this case is necessary. Some studies have investigated the cardinality constrained mean-variance model using heuristic algorithm. But alm...
In this paper an improved version of the Artificial Bee Colony (ABC) algorithm adjusted for constrained optimization problems is presented. It has been implemented and tested on several engineering benchmarks which contain discrete and continuous variables. Our results were compared to the results obtained by Simple Constrained Particle Swarm optimization algorithm (SiC-PSO) which showed a very...
Although lot streaming scheduling is an active research field, lot streaming flexible flow lines problems have received far less attention than classical flow shops. This paper deals with scheduling jobs in lot streaming flexible flow line problems. The paper mathematically formulates the problem by a mixed integer linear programming model. This model solves small instances to optimality. Moreo...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید