Research Article
A New Modified Artificial Bee Colony Algorithm with Exponential Function Adaptive Steps
Input: , max iteration | Output: Best solution | () Initialize the food sources using the following equation | for and , | where and are upper and lower boundaries of parameter , respectively | () Evaluate the food sources using (3) | () Iter = 1, where Iter denotes iteration number | () While Iter max iteration do | () Send employed bees to produce new solutions as in (1) | () Evaluate the new solutions and apply greedy selection | () Calculate the probability using (2) | () Send onlooker bees to produce new greedy selection | () Evaluate the new solutions and apply greedy selection | () Send one scout into the search area for discovering a new food source | () Memorize the best solution found so far | () Iter = Iter + 1 | () end while | () Return the best solution |
|