SortingSubsetOptimizationAlgorithm#

class pybrops.opt.algo.SortingSubsetOptimizationAlgorithm.SortingSubsetOptimizationAlgorithm(**kwargs)[source]#

Optimization algorithm class that scores individuals separate from each other, sorts to scores, and selects a solution from the sorted list.

Assumes a convex search space where decision variables are additive. Ignores any and all constraint violations.

Constructor for a steepest ascent hillclimber capable of handling constraints.

Parameters:

rng –
kwargs (dict) – Additional keyword arguments used for cooperative inheritance.

Methods

Minimize an optimization problem.

minimize(prob, miscout=None, **kwargs)[source]#

Minimize an optimization problem.

Parameters:

prob (SubsetProblem) – A subset problem definition object on which to optimize.
miscout (dict) – Miscellaneous output from the constrained optimizaiont algorithm.
kwargs (dict) – Additional keyword arguments

Returns:

out – An object containing the solution to the provided subset problem.

Return type:

SubsetSolution