Skip to content

Valdecy/Metaheuristic-Flower_Pollination_Algorithm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

18 Commits
 
 
 
 

Repository files navigation

Metaheuristic-Flower_Pollination_Algorithm

Flower Pollination Algorithmn to Minimize Functions with Continuous Variables. The function returns: 1) An array containing the used value(s) for the target function and the output of the target function f(x). For example, if the function f(x1, x2) is used, then the array would be [x1, x2, f(x1, x2)].

  • flowers = The population size. The Default Value is 3.

  • p = Chance to create a global solution. The Default Value is 0.8.

  • gamma = Global solution parameter. The Default Value is 0.5.

  • lamb = Global solution parameter. The Default Value is 1.4.

  • min_values = The minimum value that the variable(s) from a list can have. The default value is -5.

  • max_values = The maximum value that the variable(s) from a list can have. The default value is 5.

  • generations = The total number of iterations. The Default Value is 50.

  • target_function = Function to be minimized.

Other Metaheuristics

Try online in the Colab my new library - pyMetaheuristic.

Multiobjective Optimization or Many Objectives Optimization

For Multiobjective Optimization or Many Objectives Optimization try pyMultiobjective

TSP (Travelling Salesman Problem)

For Travelling Salesman Problems try pyCombinatorial

About

Flower Pollination Algorithm to Minimize Functions with Continuous Variables

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages