|
SOFTWARE
|
|
|||
|
public class BCO {
public static void main(String[] args) { int numberOfBees = 10; int nuberOfIteration = 10; int numberOfPasses = 10; int numberOfChanges = 5; Solution solution = new Solution(); Bee[] bee = new Bee[numberOfBees]; for(int i = 0;i < numberOfBees;i++) bee[i] = new Bee(); solution.findInitialSolution(); solution.evaluateSolution(); for(Bee b : bee) { b.findInitialSolution(); b.evaluateSolution(); } GroupOfBees.checkTheBestSolution(solution, bee); for(int it = 1;it <= nuberOfIteration;it++) { GroupOfBees.setInitialSolution(solution, bee);
for(int i = 1; i < numberOfPasses; i++) { for(int j = 1;j < numberOfChanges;j++) { for(Bee b : bee) { b.makeChanges(); b.evaluateSolution(); } GroupOfBees.checkTheBestSolution(solution, bee); } GroupOfBees.normalizeObjectiveFunctions(bee); GroupOfBees.determineLoyalty(bee,i); GroupOfBees.following(bee); } } solution.showSolution(); } } public class Solution { double objectiveFunction; void findInitialSolution() { } void evaluateSolution() { } void showSolution() { } } public class Bee extends Solution{ void makeChanges() { } } public class GroupOfBees { public static void setInitialSolution(Solution solution,Bee[] bee) { } public static void checkTheBestSolution(Solution solution,Bee[] bee) { } public static void normalizeObjectiveFunctions(Bee[] bee) { } public static void determineLoyalty(Bee[] bee,int passNumber) { } public static void following(Bee[] bee) { } } |
||||
|
|
||||