Package | Description |
---|---|
org.cpsolver.coursett.heuristics |
University Course Timetabling: Heuristics.
|
org.cpsolver.exam.heuristics |
Examination Timetabling: Solution Heuristics.
|
org.cpsolver.ifs.algorithms |
IFS Neighbourhood Search Algorithms
|
org.cpsolver.ifs.heuristics |
IFS Heuristics (value and variable selection criteria)
|
Modifier and Type | Class and Description |
---|---|
class |
FixCompleteSolutionNeighbourSelection
University course timetabling neighbour selection.
|
Modifier and Type | Class and Description |
---|---|
class |
ExamConstruction
Initial solution construction heuristics.
|
class |
ExamGreatDeluge
Deprecated.
|
class |
ExamHillClimbing
Deprecated.
|
class |
ExamNeighbourSelection
Examination timetabling neighbour selection.
|
class |
ExamSimulatedAnnealing
Deprecated.
|
class |
ExamTabuSearch
Tabu search algorithm.
|
Modifier and Type | Class and Description |
---|---|
class |
GreatDeluge<V extends Variable<V,T>,T extends Value<V,T>>
Great deluge.
|
class |
HillClimber<V extends Variable<V,T>,T extends Value<V,T>>
Hill climber.
|
class |
MetaHeuristicSearch<V extends Variable<V,T>,T extends Value<V,T>>
Meta-heuristic search neighbor selection.
|
class |
NeighbourSearch<V extends Variable<V,T>,T extends Value<V,T>>
Base class for the search techniques like hill climber, great deluge, or simulated annealing.
|
class |
ParallelConstruction<V extends Variable<V,T>,T extends Value<V,T>>
A simple neighbourhood selection extension suitable for the
ParallelSolver
during the construction phase. |
class |
SimpleSearch<V extends Variable<V,T>,T extends Value<V,T>>
Simple search neighbour selection.
|
class |
SimulatedAnnealing<V extends Variable<V,T>,T extends Value<V,T>>
Simulated annealing.
|
class |
StepCountingHillClimber<V extends Variable<V,T>,T extends Value<V,T>>
Step counting hill climber.
|
Modifier and Type | Class and Description |
---|---|
class |
MaxIdleNeighbourSelection<V extends Variable<V,T>,T extends Value<V,T>>
Simple extension of a provided
NeighbourSelection that halts the construction
heuristic or the IFS search when the underlying heuristic is unable to improve the
number of assigned variables. |