Search Java Classes and Packages
#Com.numericalmethod.suanshu.optimization.multivariate.geneticalgorithm Classes and Interfaces - 23 results found.
| Name | Description | Type | Package | Framework |
| Best1Bin | The Best-1-Bin rule is the same as the Rand-1-Bin rule, except that it always pick the best candidate in the population to be the base. | Class | com.numericalmethod.suanshu.optimization.multivariate.geneticalgorithm.minimizer.deoptim | SuanShu |
| Best2Bin | The Best-1-Bin rule always picks the best chromosome as the base. | Class | com.numericalmethod.suanshu.optimization.multivariate.geneticalgorithm.minimizer.deoptim | SuanShu |
| Chromosome | A chromosome is a representation of a solution to an optimization problem. | Interface | com.numericalmethod.suanshu.optimization.multivariate.geneticalgorithm | SuanShu |
| ConstrainedCellFactory | This defines a Differential Evolution operator that takes in account constraints. | Class | com.numericalmethod.suanshu.optimization.multivariate.geneticalgorithm.minimizer.deoptim.constrained | SuanShu |
| DEOptim | Differential Evolution (DE) is a global optimization method. | Class | com.numericalmethod.suanshu.optimization.multivariate.geneticalgorithm.minimizer.deoptim | SuanShu |
| DEOptim .NewCellFactory | This factory constructs a new DEOptimCellFactory for each minimization problem. | Interface | com.numericalmethod.suanshu.optimization.multivariate.geneticalgorithm.minimizer.deoptim | SuanShu |
| DEOptimCellFactory | A DEOptimCellFactory produces DEOptimCellFactory. | Class | com.numericalmethod.suanshu.optimization.multivariate.geneticalgorithm.minimizer.deoptim | SuanShu |
| FirstGeneration | This interface allows customization of how the first pool of chromosomes is generated. | Interface | com.numericalmethod.suanshu.optimization.multivariate.geneticalgorithm.minimizer.simplegrid.firstgeneration | SuanShu |
| GeneticAlgorithm | A genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution. | Class | com.numericalmethod.suanshu.optimization.multivariate.geneticalgorithm | SuanShu |
| GlobalSearchByLocalMinimizer | This minimizer is a global optimization method. | Class | com.numericalmethod.suanshu.optimization.multivariate.geneticalgorithm.minimizer.local | SuanShu |
| IntegralConstrainedCellFactory | This implementation defines the constrained Differential Evolution operators that solve an Integer Programming problem. | Class | com.numericalmethod.suanshu.optimization.multivariate.geneticalgorithm.minimizer.deoptim.constrained | SuanShu |
| IntegralConstrainedCellFactory .AllIntegers | This integral constraint makes all variables in the objective function integral variables. | Class | com.numericalmethod.suanshu.optimization.multivariate.geneticalgorithm.minimizer.deoptim.constrained | SuanShu |
| IntegralConstrainedCellFactory .IntegerConstraint | The integral constraints are defined by implementing this interface. | Interface | com.numericalmethod.suanshu.optimization.multivariate.geneticalgorithm.minimizer.deoptim.constrained | SuanShu |
| IntegralConstrainedCellFactory .SomeIntegers | This integral constraint makes some variables in the objective function integral variables. | Class | com.numericalmethod.suanshu.optimization.multivariate.geneticalgorithm.minimizer.deoptim.constrained | SuanShu |
| LocalSearchCellFactory | A LocalSearchCellFactory produces LocalSearchCellFactory. | Class | com.numericalmethod.suanshu.optimization.multivariate.geneticalgorithm.minimizer.local | SuanShu |
| LocalSearchCellFactory .MinimizerFactory | This factory constructs a new Minimizer for each mutation operation. | Interface | com.numericalmethod.suanshu.optimization.multivariate.geneticalgorithm.minimizer.local | SuanShu |
| PerturbationAroundPoint | The initial population is generated by adding a variance around a given initial. | Class | com.numericalmethod.suanshu.optimization.multivariate.geneticalgorithm.minimizer.simplegrid.firstgeneration | SuanShu |
| Rand1Bin | The Rand-1-Bin rule is defined by: mutation by adding a scaled, randomly sampled vector difference to a third vector | Class | com.numericalmethod.suanshu.optimization.multivariate.geneticalgorithm.minimizer.deoptim | SuanShu |
| RealScalarFunctionChromosome | This chromosome encodes a real valued function. | Class | com.numericalmethod.suanshu.optimization.multivariate.geneticalgorithm.minimizer.simplegrid | SuanShu |
| SimpleCellFactory | A SimpleCellFactory produces SimpleCellFactory. | Class | com.numericalmethod.suanshu.optimization.multivariate.geneticalgorithm.minimizer.simplegrid | SuanShu |
| SimpleGridMinimizer | This minimizer is a simple global optimization method. | Class | com.numericalmethod.suanshu.optimization.multivariate.geneticalgorithm.minimizer.simplegrid | SuanShu |
| SimpleGridMinimizer .NewCellFactoryCtor | This factory constructs a new SimpleCellFactory for each minimization problem. | Interface | com.numericalmethod.suanshu.optimization.multivariate.geneticalgorithm.minimizer.simplegrid | SuanShu |
| UniformMeshOverRegion | The initial population is generated by putting a uniform mesh/grid/net over the entire region. | Class | com.numericalmethod.suanshu.optimization.multivariate.geneticalgorithm.minimizer.simplegrid.firstgeneration | SuanShu |