Java Implementation of Bees Algorithm. It contains a BeesAlgoImpl class can extended to override the function "function" which is the objective function to be minimized.

For eg,

public class MyImpl extends BeesAlgoImpl {
public double function(double[] x) {
//Min sigma Xi^2 or Max -sigma Xi^2
double result = 0;
for (int j = 0; j < var; j++) { //var = no of variables -
public field in BeesAlgoImpl class
result = result + (x[j]-1) * (x[j]-1);
}
return (-result);
}

//constructor
public MyImpl(){
//super( .... ) - set the no of variables, parameters n, m, e,
ngh, nep, nsp (look into the bees algo paper), no of iterations,
uperlimit and lower limit of search, integerize - search only integers
true or false
}

public static void main(String[] args){
MyImpl a = new MyImpl();
a.run();
int i=0;
a.optimalPoint[i]; //Xi of the optimal point
}
}

Project Activity

See All Activity >

Follow Bees Algorithm Implementation

Bees Algorithm Implementation Web Site

Other Useful Business Software
$300 Free Credits for Your Google Cloud Projects Icon
$300 Free Credits for Your Google Cloud Projects

Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.

Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
Start Free Trial
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of Bees Algorithm Implementation!

Additional Project Details

Registered

2010-05-28