Constructor and Description |
---|
CF_ForwardRecursion(umontreal.ssj.probdist.Distribution[] demands,
ImmediateValueFunction<State,Action,Double> immediateValueFunction,
ImmediateValueFunction<State,Action,Integer,Double> immediateValueFunctionOutcome,
Function<State,ArrayList<Action>> buildActionList,
double discountFactor,
HashType hashType,
int stateSpaceSizeLowerBound,
float loadFactor,
SamplingScheme samplingScheme,
int sampleSize,
double reductionFactorPerStage) |
CF_ForwardRecursion(umontreal.ssj.probdist.Distribution[] demands,
ImmediateValueFunction<State,Action,Double> immediateValueFunction,
ImmediateValueFunction<State,Action,Integer,Double> immediateValueFunctionOutcome,
Function<State,ArrayList<Action>> buildActionList,
double discountFactor,
HashType hashType,
SamplingScheme samplingScheme,
int sampleSize,
double reductionFactorPerStage) |
Constructor and Description |
---|
BR_ForwardRecursion(int horizonLength,
double[][][] machineLocation,
int[][] fuelConsumption,
ImmediateValueFunction<State,Action,Double> immediateValueFunction,
Function<State,ArrayList<Action>> buildActionList,
double discountFactor,
HashType hashType) |
BR_ForwardRecursion(int horizonLength,
double[][][] machineLocation,
int[][] fuelConsumption,
ImmediateValueFunction<State,Action,Double> immediateValueFunction,
Function<State,ArrayList<Action>> buildActionList,
double discountFactor,
HashType hashType,
int stateSpaceSizeLowerBound,
float loadFactor) |
Constructor and Description |
---|
BRF_ForwardRecursion(int horizonLength,
double[][][] machineLocation,
umontreal.ssj.probdist.DiscreteDistribution[][] fuelConsumption,
ImmediateValueFunction<State,Action,Double> immediateValueFunction,
Function<State,ArrayList<Action>> buildActionList,
double discountFactor,
HashType hashType,
int stateSpaceSizeLowerBound,
float loadFactor,
SamplingScheme samplingScheme,
int sampleSize,
double reductionFactorPerStage) |
Constructor and Description |
---|
BRL_ForwardRecursion(int horizonLength,
double[][][] machineLocation,
int[][] fuelConsumption,
ImmediateValueFunction<State,Action,Double> immediateValueFunction,
Function<State,ArrayList<Action>> buildActionList,
double discountFactor,
HashType hashType,
int stateSpaceSizeLowerBound,
float loadFactor,
SamplingScheme samplingScheme,
int sampleSize,
double reductionFactorPerStage) |
Modifier and Type | Field and Description |
---|---|
protected ImmediateValueFunction<State,Action,Double> |
ValueRepository.immediateValueFunction |
Modifier and Type | Method and Description |
---|---|
void |
ValueRepository.setImmediateValue(ImmediateValueFunction<State,Action,Double> immediateValueFunction)
Sets the immediate value function of a transition from
initialState to finalState under a chosen action . |
Constructor and Description |
---|
ValueRepository(ImmediateValueFunction<State,Action,Double> immediateValueFunction,
double discountFactor,
HashType hash)
Creates a new value repository.
|
ValueRepository(ImmediateValueFunction<State,Action,Double> immediateValueFunction,
double discountFactor,
int stateSpaceSizeLowerBound,
float loadFactor,
HashType hash)
Creates a new value repository.
|
Constructor and Description |
---|
BackwardRecursionImpl(Recursion.OptimisationDirection optimisationDirection,
umontreal.ssj.probdistmulti.DiscreteDistributionIntMulti[] demand,
ImmediateValueFunction<State,Action,Double> immediateValueFunction,
RandomOutcomeFunction<State,Action,double[]> randomOutcomeFunction,
Function<State,ArrayList<Action>> buildActionList,
Function<State,Action> idempotentAction,
double discountFactor,
SamplingScheme samplingScheme,
int maxSampleSize,
double reductionFactorPerStage,
HashType hash)
Creates an instance of the problem and initialises state space, transition probability and value repository.
|
BackwardRecursionImpl(Recursion.OptimisationDirection optimisationDirection,
umontreal.ssj.probdistmulti.DiscreteDistributionIntMulti[] demand,
ImmediateValueFunction<State,Action,Double> immediateValueFunction,
RandomOutcomeFunction<State,Action,double[]> randomOutcomeFunction,
Function<State,ArrayList<Action>> buildActionList,
Function<State,Action> idempotentAction,
double discountFactor,
SamplingScheme samplingScheme,
int maxSampleSize,
double reductionFactorPerStage,
int stateSpaceSizeLowerBound,
float loadFactor,
HashType hash)
Creates an instance of the problem and initialises state space, transition probability and value repository.
|
Constructor and Description |
---|
BackwardRecursionImpl(Recursion.OptimisationDirection optimisationDirection,
umontreal.ssj.probdist.Distribution[][][] demand,
double[][][] supportLB,
double[][][] supportUB,
ImmediateValueFunction<State,Action,Double> immediateValueFunction,
RandomOutcomeFunction<State,Action,Double> randomOutcomeFunction,
Function<State,ArrayList<Action>> buildActionList,
Function<State,Action> idempotentAction,
double discountFactor,
SamplingScheme samplingScheme,
int maxSampleSize,
double reductionFactorPerStage,
HashType hash)
Creates an instance of the problem and initializes state space, transition probability and value repository.
|
BackwardRecursionImpl(Recursion.OptimisationDirection optimisationDirection,
umontreal.ssj.probdist.Distribution[][] demand,
double[][] supportLB,
double[][] supportUB,
ImmediateValueFunction<State,Action,Double> immediateValueFunction,
RandomOutcomeFunction<State,Action,Double> randomOutcomeFunction,
Function<State,ArrayList<Action>> buildActionList,
Function<State,Action> idempotentAction,
double discountFactor,
SamplingScheme samplingScheme,
int maxSampleSize,
double reductionFactorPerStage,
HashType hash)
Creates an instance of the problem and initializes state space, transition probability and value repository.
|
BackwardRecursionImpl(Recursion.OptimisationDirection optimisationDirection,
umontreal.ssj.probdist.Distribution[] demand,
double[] supportLB,
double[] supportUB,
ImmediateValueFunction<State,Action,Double> immediateValueFunction,
RandomOutcomeFunction<State,Action,Double> randomOutcomeFunction,
Function<State,ArrayList<Action>> buildActionList,
Function<State,Action> idempotentAction,
double discountFactor,
SamplingScheme samplingScheme,
int maxSampleSize,
double reductionFactorPerStage,
HashType hash)
Creates an instance of the problem and initializes state space, transition probability and value repository.
|
BackwardRecursionImpl(Recursion.OptimisationDirection optimisationDirection,
umontreal.ssj.probdist.Distribution[] demand,
double[] supportLB,
double[] supportUB,
ImmediateValueFunction<State,Action,Double> immediateValueFunction,
RandomOutcomeFunction<State,Action,Double> randomOutcomeFunction,
Function<State,ArrayList<Action>> buildActionList,
Function<State,Action> idempotentAction,
double discountFactor,
SamplingScheme samplingScheme,
int maxSampleSize,
double reductionFactorPerStage,
int stateSpaceSizeLowerBound,
float loadFactor,
HashType hash)
Creates an instance of the problem and initializes state space, transition probability and value repository.
|
Copyright © 2017–2018. All rights reserved.