BiCIAM - Framework Metaheurístico
1.0
Framework de optimización con algoritmos metaheurísticos y evolutivos
Cargando...
Buscando...
Nada coincide
Índice de clases
A
|
C
|
D
|
E
|
F
|
G
|
H
|
I
|
L
|
M
|
N
|
O
|
P
|
R
|
S
|
T
|
U
A
AcceptableCandidate
(
local_search.acceptation_type
)
AcceptAnyone
(
local_search.acceptation_type
)
AcceptBest
(
local_search.acceptation_type
)
AcceptMulticase
(
local_search.acceptation_type
)
AcceptNotBad
(
local_search.acceptation_type
)
AcceptNotBadT
(
local_search.acceptation_type
)
AcceptNotBadU
(
local_search.acceptation_type
)
AcceptNotDominated
(
local_search.acceptation_type
)
AcceptNotDominatedTabu
(
local_search.acceptation_type
)
AcceptType
(
local_search.acceptation_type
)
AIOMutation
(
evolutionary_algorithms.complement
)
C
CandidateType
(
local_search.candidate_type
)
CandidateValue
(
local_search.candidate_type
)
Codification
(
problem.definition
)
Crossover
(
evolutionary_algorithms.complement
)
CrossoverType
(
evolutionary_algorithms.complement
)
D
Distribution
(
evolutionary_algorithms.complement
)
DistributionEstimationAlgorithm
(
metaheuristics.generators
)
DistributionType
(
evolutionary_algorithms.complement
)
Dominance
(
local_search.acceptation_type
)
E
EvolutionStrategies
(
metaheuristics.generators
)
F
FactoresPonderados
(
problem.extension
)
FactoryAcceptCandidate
(
factory_method
)
FactoryCandidate
(
factory_method
)
FactoryCrossover
(
factory_method
)
FactoryDistribution
(
factory_method
)
FactoryFatherSelection
(
factory_method
)
FactoryGenerator
(
factory_method
)
FactoryLoader
(
factory_method
)
FactoryMutation
(
factory_method
)
FactoryReplace
(
factory_method
)
FactorySampling
(
factory_method
)
FactorySolutionMethod
(
factory_method
)
FatherSelection
(
evolutionary_algorithms.complement
)
G
GenerationalReplace
(
evolutionary_algorithms.complement
)
Generator
(
metaheuristics.generators
)
GeneratorType
(
metaheuristics.generators
)
GeneticAlgorithm
(
metaheuristics.generators
)
GreaterCandidate
(
local_search.candidate_type
)
H
HillClimbing
(
metaheuristics.generators
)
HillClimbingRestart
(
metaheuristics.generators
)
I
IFFactoryAcceptCandidate
(
factory_interface
)
IFFactoryCandidate
(
factory_interface
)
IFFactoryCrossover
(
factory_interface
)
IFFactoryDistribution
(
factory_interface
)
IFFactoryFatherSelection
(
factory_interface
)
IFFactoryGenerator
(
factory_interface
)
IFFactoryMutation
(
factory_interface
)
IFFactoryReplace
(
factory_interface
)
IFFactorySolutionMethod
(
factory_interface
)
IFFSampling
(
factory_interface
)
InstanceDE
(
metaheuristics.generators
)
InstanceEE
(
metaheuristics.generators
)
InstanceGA
(
metaheuristics.generators
)
L
LimitRoulette
(
metaheuristics.generators
)
LimitThreshold
(
metaheuristics.generators
)
M
MetricasMultiobjetivo
(
problem.extension
)
MultiCaseSimulatedAnnealing
(
metaheuristics.generators
)
MultiGenerator
(
metaheuristics.generators
)
MultiobjectiveHillClimbingDistance
(
metaheuristics.generators
)
MultiobjectiveHillClimbingRestart
(
metaheuristics.generators
)
MultiobjectiveStochasticHillClimbing
(
metaheuristics.generators
)
MultiobjectiveTabuSearch
(
metaheuristics.generators
)
MultiObjetivoPuro
(
problem.extension
)
Mutation
(
evolutionary_algorithms.complement
)
MutationOperator
(
problem.operators
)
MutationOperator
(
problem_operators
)
MutationType
(
evolutionary_algorithms.complement
)
N
NotDominatedCandidate
(
local_search.candidate_type
)
O
ObjetiveFunction
(
problem.definition
)
OnePointCrossover
(
evolutionary_algorithms.complement
)
OnePointMutation
(
evolutionary_algorithms.complement
)
Operator
(
problem.definition
)
P
Particle
(
metaheuristics.generators
)
ParticleSwarmOptimization
(
metaheuristics.generators
)
ProbabilisticSampling
(
evolutionary_algorithms.complement
)
Probability
(
evolutionary_algorithms.complement
)
Problem
(
problem.definition
)
Problem.ProblemType
(
problem.definition
)
R
RandomCandidate
(
local_search.candidate_type
)
RandomSearch
(
metaheuristics.generators
)
Range
(
evolutionary_algorithms.complement
)
Replace
(
evolutionary_algorithms.complement
)
ReplaceType
(
evolutionary_algorithms.complement
)
RouletteSelection
(
evolutionary_algorithms.complement
)
S
Sampling
(
evolutionary_algorithms.complement
)
SamplingType
(
evolutionary_algorithms.complement
)
SearchCandidate
(
local_search.candidate_type
)
SecureRandomGenerator
(
config
)
SelectionType
(
evolutionary_algorithms.complement
)
SimulatedAnnealing
(
metaheuristics.generators
)
SmallerCandidate
(
local_search.candidate_type
)
SolutionMethod
(
problem.extension
)
State
(
problem.definition
)
SteadyStateReplace
(
evolutionary_algorithms.complement
)
StopExecute
(
local_search.complement
)
Strategy
(
metaheurictics.strategy
)
StrategyType
(
local_search.complement
)
T
TabuSearch
(
metaheuristics.generators
)
TabuSolutions
(
local_search.complement
)
TowPointsMutation
(
evolutionary_algorithms.complement
)
TruncationSelection
(
evolutionary_algorithms.complement
)
TSPState
(
config.tspDynamic
)
TypeSolutionMethod
(
problem.extension
)
U
UniformCrossover
(
evolutionary_algorithms.complement
)
Univariate
(
evolutionary_algorithms.complement
)
UpdateParameter
(
local_search.complement
)
Generado el
para BiCIAM - Framework Metaheurístico por
1.15.0
1.15.0 1.15.0