Package | Description |
---|---|
net.sf.cpsolver.exam.heuristics |
Examination Timetabling: Solution Heuristics.
|
net.sf.cpsolver.ifs.algorithms |
IFS Neighbourhood Search Algorithms
|
net.sf.cpsolver.ifs.model |
IFS Model (description of a problem)
|
Modifier and Type | Method and Description |
---|---|
boolean |
ExamGreatDeluge.accept(LazyNeighbour<Exam,ExamPlacement> neighbour,
double value)
Accept lazy neighbour
|
boolean |
ExamHillClimbing.accept(LazyNeighbour<Exam,ExamPlacement> neighbour,
double value)
Accept lazy neighbour
|
boolean |
ExamSimulatedAnnealing.accept(LazyNeighbour<Exam,ExamPlacement> neighbour,
double value)
Accept lazy neighbour
|
Modifier and Type | Method and Description |
---|---|
boolean |
NeighbourSearch.accept(LazyNeighbour<V,T> neighbour,
double value)
Accept lazy neighbour -- calling the acceptance criterion with lazy = true.
|
Modifier and Type | Class and Description |
---|---|
class |
LazySwap<V extends Variable<V,T>,T extends Value<V,T>>
Lazy swap of two variables.
|
Modifier and Type | Method and Description |
---|---|
boolean |
LazyNeighbour.LazyNeighbourAcceptanceCriterion.accept(LazyNeighbour<V,T> neighbour,
double value)
True when the currently assigned neighbour should be accepted (false means
that the change will be undone
|