BA: Optimization using Bat Algorithm In metaheuristicOpt: Metaheuristic for Optimization

Description

This is the internal function that implements Bat Algorithm. It is used to solve continuous optimization tasks. Users do not need to call it directly, but just use metaOpt.

Usage

 1 2 3 BA(FUN, optimType = "MIN", numVar, numPopulation = 40, maxIter = 500, rangeVar, maxFrequency = 0.1, minFrequency = -0.1, gama = 1, alphaBA = 0.1) 

Arguments

 FUN an objective function or cost function, optimType a string value that represent the type of optimization. There are two option for this arguments: "MIN" and "MAX". The default value is "MIN", which the function will do minimization. Otherwise, you can use "MAX" for maximization problem. The default value is "MIN". numVar a positive integer to determine the number variables. numPopulation a positive integer to determine the number populations. The default value is 40. maxIter a positive integer to determine the maximum number of iterations. The default value is 500. rangeVar a matrix (2 \times n) containing the range of variables, where n is the number of variables, and first and second rows are the lower bound (minimum) and upper bound (maximum) values, respectively. If all variable have equal upper bound, you can define rangeVar as matrix (2 \times 1). maxFrequency a numeric to determine maximum frequency. The default value is 0.1. minFrequency a numeric to determine minimum frequency. The default value is -0.1. gama a numeric greater than equal to 1. It use to increase pulse rate. The default value is 1. alphaBA a numeric between 0 and 1. It use to decrease loudness. The default value is 0.1.

Details

This algorithm was proposed by (Yang, 2011). It was inspired by echolocation of bats. Candidate solutions in bat algorithm are represented by bat. They have flying speed, pulse rate, loudness and pulse frequency and they move based on them.

In order to find the optimal solution, the algorithm follow the following steps.

• initialize population randomly.

• move every candidate solutions based on velocity and pulse frequnecy.

• move some candidate solutions near globak best randomly.

• If a candidate solution have better fitness than global best replace it with new random candidate solution then increase its pulse rate and decrease its loudness.

• If a termination criterion (a maximum number of iterations or a sufficiently good fitness) is met, exit the loop, else back to move every candidate solutions.

Value

Vector [v1, v2, ..., vn] where n is number variable and vn is value of n-th variable.

References

Yang, X. S., (2011), Bat Algorithm for Multiobjective Optimization, Int. J. Bio-Inspired Computation, Vol. 3, No. 5, pp.267-274.

metaOpt
  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 ################################## ## Optimizing the schewefel's problem 1.2 function # define schewefel's problem 1.2 function as objective function schewefels1.2 <- function(x){ dim <- length(x) result <- 0 for(i in 1:dim){ result <- result + sum(x[1:i])^2 } return(result) } ## Define parameter numVar <- 5 rangeVar <- matrix(c(-10,10), nrow=2) ## calculate the optimum solution using bat algorithm resultBA <- BA(schewefels1.2, optimType="MIN", numVar, numPopulation=20, maxIter=100, rangeVar) ## calculate the optimum value using schewefel's problem 1.2 function optimum.value <- schewefels1.2(resultBA)