Uses of Class
es.urjc.etsii.grafo.improve.Improver
Packages that use Improver
Package
Description
-
Uses of Improver in es.urjc.etsii.grafo.algorithms
Fields in es.urjc.etsii.grafo.algorithms declared as ImproverConstructors in es.urjc.etsii.grafo.algorithms with parameters of type ImproverModifierConstructorDescriptionIteratedGreedy(String name, int maxIterations, int stopIfNotImprovedIn, Constructive<S, I> constructive, Destructive<S, I> destructive, Reconstructive<S, I> reconstructive, Improver<S, I> improver) Iterated Greedy Algorithm constructor: uses one constructive method when building the initial solution and another one when reconstructingIteratedGreedy(String name, int maxIterations, int stopIfNotImprovedIn, Constructive<S, I> constructive, Shake<S, I> destructionReconstruction, Improver<S, I> improver) IteratedGreedy(String name, int maxIterations, int stopIfNotImprovedIn, Reconstructive<S, I> constructive, Destructive<S, I> destructive, Improver<S, I> improver) Iterated Greedy Algorithm constructor: uses same constructive method when building the initial solution and after the destructive.IteratedGreedy(String name, Objective<?, S, I> objective, int maxIterations, int stopIfNotImprovedIn, Constructive<S, I> constructive, Shake<S, I> destructionReconstruction, Improver<S, I> improver) Iterated Greedy Algorithm constructorSimpleAlgorithm(String algorithmName, Constructive<S, I> constructive, Improver<S, I> improver) Constructor for SimpleAlgorithm. -
Uses of Improver in es.urjc.etsii.grafo.algorithms.scattersearch
Fields in es.urjc.etsii.grafo.algorithms.scattersearch declared as ImproverMethods in es.urjc.etsii.grafo.algorithms.scattersearch with parameters of type ImproverModifier and TypeMethodDescriptionScatterSearchBuilder.withImprover(Improver<S, I> improver) Configure an improvement method for the Scatter Search algorithm.Constructors in es.urjc.etsii.grafo.algorithms.scattersearch with parameters of type ImproverModifierConstructorDescriptionScatterSearch(String name, double initialRatio, int refsetSize, Constructive<S, I> constructiveGoodValues, Constructive<S, I> constructiveGoodDiversity, Improver<S, I> improver, SolutionCombinator<S, I> combinator, Objective<?, S, I> objective, int maxIterations, double diversityRatio, SolutionDistance<S, I> solutionDistance, boolean softRestartEnabled) -
Uses of Improver in es.urjc.etsii.grafo.algorithms.vns
Fields in es.urjc.etsii.grafo.algorithms.vns declared as ImproverMethods in es.urjc.etsii.grafo.algorithms.vns with parameters of type ImproverModifier and TypeMethodDescriptionVNSBuilder<S, I> VNSBuilder.withImprover(Improver<S, I> improver) Configures the improvement procedureConstructors in es.urjc.etsii.grafo.algorithms.vns with parameters of type ImproverModifierConstructorDescriptionVNS(String algorithmName, int maxK, Constructive<S, I> constructive, Shake<S, I> shake, Improver<S, I> improver) VNS with default KMapper, which starts at 0 and increments by 1 each time the solution does not improve.VNS(String algorithmName, Objective<?, S, I> objective, VNSNeighChange<S, I> neighChange, Constructive<S, I> constructive, Shake<S, I> shake, Improver<S, I> improver) Execute VNS until finished -
Uses of Improver in es.urjc.etsii.grafo.aop
Methods in es.urjc.etsii.grafo.aop with parameters of type ImproverModifier and TypeMethodDescriptionTimedAspect.logImprover(org.aspectj.lang.ProceedingJoinPoint point, Improver improver, Solution solution) -
Uses of Improver in es.urjc.etsii.grafo.autoconfigtests.components
Subclasses of Improver in es.urjc.etsii.grafo.autoconfigtests.componentsModifier and TypeClassDescriptionclassTest improver used to validate the autoconfig modeclass -
Uses of Improver in es.urjc.etsii.grafo.bmssc.alg
Constructors in es.urjc.etsii.grafo.bmssc.alg with parameters of type ImproverModifierConstructorDescriptionMultistartOnlyBestAppliesLS(String name, int iterations, Constructive<BMSSCSolution, BMSSCInstance> constructor, Improver<BMSSCSolution, BMSSCInstance> improver) -
Uses of Improver in es.urjc.etsii.grafo.bmssc.improve
Subclasses of Improver in es.urjc.etsii.grafo.bmssc.improveConstructors in es.urjc.etsii.grafo.bmssc.improve with parameters of type ImproverModifierConstructorDescriptionShakeImprover(Improver<BMSSCSolution, BMSSCInstance> improver, Shake<BMSSCSolution, BMSSCInstance> shake) -
Uses of Improver in es.urjc.etsii.grafo.improve
Subclasses of Improver in es.urjc.etsii.grafo.improveModifier and TypeClassDescriptionstatic classImprover.NullImprover<S extends Solution<S,I>, I extends Instance> Do nothing local searchstatic classImprover.SequentialImprover<S extends Solution<S,I>, I extends Instance> classVND class.Methods in es.urjc.etsii.grafo.improve that return ImproverModifier and TypeMethodDescriptionImprover.nul()Create a no operation improve method Returns the solution immediately without executing any operationMethods in es.urjc.etsii.grafo.improve with parameters of type ImproverModifier and TypeMethodDescriptionConstructors in es.urjc.etsii.grafo.improve with parameters of type ImproverConstructor parameters in es.urjc.etsii.grafo.improve with type arguments of type Improver -
Uses of Improver in es.urjc.etsii.grafo.improve.ls
Subclasses of Improver in es.urjc.etsii.grafo.improve.lsModifier and TypeClassDescriptionclassLocalSearch<M extends Move<S,I>, S extends Solution<S, I>, I extends Instance> Local search procedures start from a given feasible solution and explore a determined neighborhood in each iteration, replacing the current solution if a neighbor solution improves the objective function of the current one.classLocalSearchBestImprovement<M extends Move<S,I>, S extends Solution<S, I>, I extends Instance> Local search procedures start from a given feasible solution and explore a determined neighborhood in each iteration, replacing the current solution if a neighbor solution improves the objective function of the current one.classLocalSearchCachedBestImprovement<M extends Move<S,I> & RefreshableMove<M, S, I>, S extends Solution<S, I>, I extends Instance> Cached best improvement local search.classLocalSearchFirstImprovement<M extends Move<S,I>, S extends Solution<S, I>, I extends Instance> Local search procedures start from a given feasible solution and explore a determined neighborhood in each iteration, replacing the current solution if a neighbor solution improves the objective function of the current one. -
Uses of Improver in es.urjc.etsii.grafo.improve.sa
Subclasses of Improver in es.urjc.etsii.grafo.improve.saModifier and TypeClassDescriptionclassSimulatedAnnealing<M extends Move<S,I>, S extends Solution<S, I>, I extends Instance> Simulated annealing (SA) is a metaheuristic whose name comes from annealing in metallurgy.