This paper proposes Hybrid SFL-Bees Algorithm that combines strengths of Shuffled Frog Leaping Algorithm (SFLA) and Bees Algorithms (BA). While SFLA can find optimal solutions quickly because of directive searching and exchange of information, BA has higher random that make it easily escape local optima to find global solutions. Thus Hybrid SFL-Bees Algorithm is able to find optimal solutions q...

This paper proposes Hybrid SFL-Bees Algorithm that combines strengths of Shuffled Frog Leaping Algorithm (SFLA) and Bees Algorithms (BA). While SFLA can find optimal solutions quickly because of directive searching and exchange of information, BA has higher random that make it easily escape local optima to find global solutions. Thus Hybrid SFL-Bees Algorithm is able to find optimal solutions q...

In this paper, we propose a novel artificial bee colony(ABC) algorithm for the multidimensional knapsack problems, which introduces the attraction pheromone and presents a transition strategy based on the attraction pheromone. In our algorithm, the scout generates a food source according to the transition strategy and replaces the abandoned food source by comparison with the corresponding elite...

In order to improve the convergence and diversity of multiobjective optimization algorithms, the harmonic average distance is employed to improve the aggregating function combined L-rank value. Selection model and searching scheme of artificial bee colony algorithm and diversity maintaining scheme are improved in this paper. This novel many objectives optimization method based on improved artif...

The Economic Load Dispatch (ELD) problems in power generation systems are to reduce the fuel cost by reducing the total cost for the generation of electric power. This paper presents an efficient Modified Firefly Algorithm (MFA), for solving ELD Problem. The main objective of the problems is to minimize the total fuel cost of the generating units having quadratic cost functions subjected to lim...

In the basic Artificial Bee Colony (ABC) algorithm, if the fitness value associated with a food source is not improved for a certain number of specified trials then the corresponding bee becomes a scout to which a random value is assigned for finding the new food source. Basically, it is a mechanism of pulling out the candidate solution which may be entrapped in some local optimizer due to whic...

A mobile ad hoc network (MANET) consists of a set of mobile nodes which communicate over radio. One of the major challenging issues in this kind of networks is to develop an efficient routing protocol. Since MANET nodes have restricted battery capacity, an energy-aware routing protocol can play an important role in its performance. On the other hand, in recent years nature has been emerged as s...

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. ...