Overview | Package | Class | Use | Tree | Deprecated | Index | Help
| OptaPlanner distribution 6.0.0.Beta5
PREV NEXT | FRAMES NO FRAMES

## Uses of Interface
org.optaplanner.core.impl.phase.SolverPhase

Packages that use SolverPhase
org.optaplanner.core.config.phase |
org.optaplanner.core.impl.bruteforce |
org.optaplanner.core.impl.constructionheuristic |
org.optaplanner.core.impl.constructionheuristic.greedyFit |
org.optaplanner.core.impl.localsearch |
org.optaplanner.core.impl.phase |
org.optaplanner.core.impl.phase.custom |
org.optaplanner.core.impl.solver |

Uses of SolverPhase in org.optaplanner.core.config.phase

Methods in org.optaplanner.core.config.phase that return SolverPhase
`abstract SolverPhase` | `SolverPhaseConfig.buildSolverPhase(int phaseIndex, HeuristicConfigPolicy solverConfigPolicy, Termination solverTermination)`

Uses of SolverPhase in org.optaplanner.core.impl.bruteforce

Subinterfaces of SolverPhase in org.optaplanner.core.impl.bruteforce
`interface` | `BruteForceSolverPhase` A `BruteForceSolverPhase` is a `SolverPhase` which uses the brute force algorithm.

Classes in org.optaplanner.core.impl.bruteforce that implement SolverPhase
`class` | `DefaultBruteForceSolverPhase` Default implementation of `BruteForceSolverPhase`.

Uses of SolverPhase in org.optaplanner.core.impl.constructionheuristic

Subinterfaces of SolverPhase in org.optaplanner.core.impl.constructionheuristic
`interface` | `ConstructionHeuristicSolverPhase` A `ConstructionHeuristicSolverPhase` is a `SolverPhase` which uses a construction heuristic algorithm, such as first fit, best fit decreasing, cheapest insertion, ...

Classes in org.optaplanner.core.impl.constructionheuristic that implement SolverPhase
`class` | `DefaultConstructionHeuristicSolverPhase` Default implementation of `ConstructionHeuristicSolverPhase`.

Uses of SolverPhase in org.optaplanner.core.impl.constructionheuristic.greedyFit

Subinterfaces of SolverPhase in org.optaplanner.core.impl.constructionheuristic.greedyFit
`interface` | `GreedyFitSolverPhase` A GreedyFitSolverPhase is a `SolverPhase` which uses the greedy algorithm, which is a construction heuristic.

Classes in org.optaplanner.core.impl.constructionheuristic.greedyFit that implement SolverPhase
`class` | `DefaultGreedyFitSolverPhase` Default implementation of `GreedyFitSolverPhase`.

Uses of SolverPhase in org.optaplanner.core.impl.localsearch

Subinterfaces of SolverPhase in org.optaplanner.core.impl.localsearch
`interface` | `LocalSearchSolverPhase` A `LocalSearchSolverPhase` is a `SolverPhase` which uses a local search algorithm, such as tabu search, simulated annealing, ...

Classes in org.optaplanner.core.impl.localsearch that implement SolverPhase
`class` | `DefaultLocalSearchSolverPhase` Default implementation of `LocalSearchSolverPhase`.

Uses of SolverPhase in org.optaplanner.core.impl.phase

Classes in org.optaplanner.core.impl.phase that implement SolverPhase
`class` | `AbstractSolverPhase`

Uses of SolverPhase in org.optaplanner.core.impl.phase.custom

Subinterfaces of SolverPhase in org.optaplanner.core.impl.phase.custom
`interface` | `CustomSolverPhase` A `CustomSolverPhase` is a `SolverPhase` which uses the brute force algorithm

Classes in org.optaplanner.core.impl.phase.custom that implement SolverPhase
`class` | `DefaultCustomSolverPhase` Default implementation of `CustomSolverPhase`.

Uses of SolverPhase in org.optaplanner.core.impl.solver

Fields in org.optaplanner.core.impl.solver with type parameters of type SolverPhase
`protected List<SolverPhase>` | `DefaultSolver.solverPhaseList`

Methods in org.optaplanner.core.impl.solver that return types with arguments of type SolverPhase
`List<SolverPhase>` | `DefaultSolver.getSolverPhaseList()`

Method parameters in org.optaplanner.core.impl.solver with type arguments of type SolverPhase
`void` | `DefaultSolver.setSolverPhaseList(List<SolverPhase> solverPhaseList)`

Overview | Package | Class | Use | Tree | Deprecated | Index | Help
| OptaPlanner distribution 6.0.0.Beta5
PREV NEXT | FRAMES NO FRAMES

Copyright © 2006-2013 JBoss by Red Hat. All Rights Reserved.