|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Exam | |
---|---|
net.sf.cpsolver.exam | Examination Timetabling Solver. |
net.sf.cpsolver.exam.heuristics | Examination Timetabling: Solution Heuristics. |
net.sf.cpsolver.exam.model | Examination Timetabling: Model. |
net.sf.cpsolver.exam.neighbours | Examination Timetabling: Various Neighbourhoods. |
net.sf.cpsolver.exam.reports | Examination Timetabling: Reports. |
Uses of Exam in net.sf.cpsolver.exam |
---|
Constructor parameters in net.sf.cpsolver.exam with type arguments of type Exam | |
---|---|
Test.ShutdownHook(Solver<Exam,ExamPlacement> solver)
|
Uses of Exam in net.sf.cpsolver.exam.heuristics |
---|
Methods in net.sf.cpsolver.exam.heuristics that return Exam | |
---|---|
Exam |
ExamUnassignedVariableSelection.selectVariable(Solution<Exam,ExamPlacement> solution)
Variable selection |
Methods in net.sf.cpsolver.exam.heuristics that return types with arguments of type Exam | |
---|---|
Neighbour<Exam,ExamPlacement> |
ExamConstruction.checkLocalOptimality(ExamModel model)
Find a new assignment of one of the assigned exams that improves the time cost ExamPlacement.getTimeCost() and for which there is a set of
available rooms findBestAvailableRooms(ExamPeriodPlacement) . |
Neighbour<Exam,ExamPlacement> |
ExamSimulatedAnnealing.genMove(Solution<Exam,ExamPlacement> solution)
Generate neighbour -- select neighbourhood randomly, select neighbour |
Neighbour<Exam,ExamPlacement> |
ExamGreatDeluge.genMove(Solution<Exam,ExamPlacement> solution)
Generate neighbour -- select neighbourhood randomly, select neighbour |
Neighbour<Exam,ExamPlacement> |
ExamTabuSearch.selectNeighbour(Solution<Exam,ExamPlacement> solution)
Neighbor selection |
Neighbour<Exam,ExamPlacement> |
ExamSimulatedAnnealing.selectNeighbour(Solution<Exam,ExamPlacement> solution)
Select neighbour -- generate a move ExamSimulatedAnnealing.genMove(Solution) until an acceptable
neighbour is found
ExamSimulatedAnnealing.accept(Solution, Neighbour) , keep
increasing iteration ExamSimulatedAnnealing.incIter(Solution) . |
Neighbour<Exam,ExamPlacement> |
ExamNeighbourSelection.selectNeighbour(Solution<Exam,ExamPlacement> solution)
Neighbour selection. |
Neighbour<Exam,ExamPlacement> |
ExamHillClimbing.selectNeighbour(Solution<Exam,ExamPlacement> solution)
Select one of the given neighbourhoods randomly, select neighbour, return it if its value is below or equal to zero (continue with the next selection otherwise). |
Neighbour<Exam,ExamPlacement> |
ExamGreatDeluge.selectNeighbour(Solution<Exam,ExamPlacement> solution)
A neighbour is generated randomly untill an acceptable one is found. |
Neighbour<Exam,ExamPlacement> |
ExamConstruction.selectNeighbour(Solution<Exam,ExamPlacement> solution)
Select a neighbour. |
Neighbour<Exam,ExamPlacement> |
ExamColoringConstruction.selectNeighbour(Solution<Exam,ExamPlacement> solution)
|
Methods in net.sf.cpsolver.exam.heuristics with parameters of type Exam | |
---|---|
ExamPlacement |
ExamTabuSearch.selectValue(Solution<Exam,ExamPlacement> solution,
Exam exam)
Value selection |
Method parameters in net.sf.cpsolver.exam.heuristics with type arguments of type Exam | |
---|---|
protected boolean |
ExamSimulatedAnnealing.accept(Solution<Exam,ExamPlacement> solution,
Neighbour<Exam,ExamPlacement> neighbour)
True if the given neighboir is to be be accepted |
protected boolean |
ExamSimulatedAnnealing.accept(Solution<Exam,ExamPlacement> solution,
Neighbour<Exam,ExamPlacement> neighbour)
True if the given neighboir is to be be accepted |
protected boolean |
ExamGreatDeluge.accept(Solution<Exam,ExamPlacement> solution,
Neighbour<Exam,ExamPlacement> neighbour)
Accept neighbour |
protected boolean |
ExamGreatDeluge.accept(Solution<Exam,ExamPlacement> solution,
Neighbour<Exam,ExamPlacement> neighbour)
Accept neighbour |
void |
ExamSimulatedAnnealing.bestCleared(Solution<Exam,ExamPlacement> solution)
|
void |
ExamHillClimbing.bestCleared(Solution<Exam,ExamPlacement> solution)
|
void |
ExamGreatDeluge.bestCleared(Solution<Exam,ExamPlacement> solution)
|
void |
ExamSimulatedAnnealing.bestRestored(Solution<Exam,ExamPlacement> solution)
|
void |
ExamHillClimbing.bestRestored(Solution<Exam,ExamPlacement> solution)
|
void |
ExamGreatDeluge.bestRestored(Solution<Exam,ExamPlacement> solution)
|
void |
ExamSimulatedAnnealing.bestSaved(Solution<Exam,ExamPlacement> solution)
Memorize the iteration when the last best solution was found. |
void |
ExamHillClimbing.bestSaved(Solution<Exam,ExamPlacement> solution)
Memorize the iteration when the last best solution was found. |
void |
ExamGreatDeluge.bestSaved(Solution<Exam,ExamPlacement> solution)
Update last improving iteration count |
boolean |
ExamNeighbourSelection.canContinue(Solution<Exam,ExamPlacement> currentSolution)
Termination condition (i.e., has final phase finished) |
protected void |
ExamSimulatedAnnealing.cool(Solution<Exam,ExamPlacement> solution)
Cool temperature |
Neighbour<Exam,ExamPlacement> |
ExamSimulatedAnnealing.genMove(Solution<Exam,ExamPlacement> solution)
Generate neighbour -- select neighbourhood randomly, select neighbour |
Neighbour<Exam,ExamPlacement> |
ExamGreatDeluge.genMove(Solution<Exam,ExamPlacement> solution)
Generate neighbour -- select neighbourhood randomly, select neighbour |
void |
ExamSimulatedAnnealing.getInfo(Solution<Exam,ExamPlacement> solution,
Map<String,String> info)
|
void |
ExamHillClimbing.getInfo(Solution<Exam,ExamPlacement> solution,
Map<String,String> info)
|
void |
ExamGreatDeluge.getInfo(Solution<Exam,ExamPlacement> solution,
Map<String,String> info)
|
void |
ExamSimulatedAnnealing.getInfo(Solution<Exam,ExamPlacement> solution,
Map<String,String> info,
Collection<Exam> variables)
|
void |
ExamSimulatedAnnealing.getInfo(Solution<Exam,ExamPlacement> solution,
Map<String,String> info,
Collection<Exam> variables)
|
void |
ExamHillClimbing.getInfo(Solution<Exam,ExamPlacement> solution,
Map<String,String> info,
Collection<Exam> variables)
|
void |
ExamHillClimbing.getInfo(Solution<Exam,ExamPlacement> solution,
Map<String,String> info,
Collection<Exam> variables)
|
void |
ExamGreatDeluge.getInfo(Solution<Exam,ExamPlacement> solution,
Map<String,String> info,
Collection<Exam> variables)
|
void |
ExamGreatDeluge.getInfo(Solution<Exam,ExamPlacement> solution,
Map<String,String> info,
Collection<Exam> variables)
|
protected void |
ExamSimulatedAnnealing.incIter(Solution<Exam,ExamPlacement> solution)
Increment iteration counter, cool/reheat/restoreBest if necessary |
protected void |
ExamGreatDeluge.incIter(Solution<Exam,ExamPlacement> solution)
Increment iteration count, update bound |
protected void |
ExamGreatDeluge.info(Solution<Exam,ExamPlacement> solution)
Print some information |
void |
ExamUnassignedVariableSelection.init(Solver<Exam,ExamPlacement> solver)
Initialization |
void |
ExamTabuSearch.init(Solver<Exam,ExamPlacement> solver)
Initialization |
void |
ExamSimulatedAnnealing.init(Solver<Exam,ExamPlacement> solver)
Initialization |
void |
ExamNeighbourSelection.init(Solver<Exam,ExamPlacement> solver)
Initialization |
void |
ExamHillClimbing.init(Solver<Exam,ExamPlacement> solver)
Initialization |
void |
ExamGreatDeluge.init(Solver<Exam,ExamPlacement> solver)
Initialization |
void |
ExamConstruction.init(Solver<Exam,ExamPlacement> solver)
Initialization |
void |
ExamColoringConstruction.init(Solver<Exam,ExamPlacement> solver)
|
protected void |
ExamSimulatedAnnealing.reheat(Solution<Exam,ExamPlacement> solution)
Reheat temperature |
protected void |
ExamSimulatedAnnealing.restoreBest(Solution<Exam,ExamPlacement> solution)
restore best ever found solution |
Neighbour<Exam,ExamPlacement> |
ExamTabuSearch.selectNeighbour(Solution<Exam,ExamPlacement> solution)
Neighbor selection |
Neighbour<Exam,ExamPlacement> |
ExamSimulatedAnnealing.selectNeighbour(Solution<Exam,ExamPlacement> solution)
Select neighbour -- generate a move ExamSimulatedAnnealing.genMove(Solution) until an acceptable
neighbour is found
ExamSimulatedAnnealing.accept(Solution, Neighbour) , keep
increasing iteration ExamSimulatedAnnealing.incIter(Solution) . |
Neighbour<Exam,ExamPlacement> |
ExamNeighbourSelection.selectNeighbour(Solution<Exam,ExamPlacement> solution)
Neighbour selection. |
Neighbour<Exam,ExamPlacement> |
ExamHillClimbing.selectNeighbour(Solution<Exam,ExamPlacement> solution)
Select one of the given neighbourhoods randomly, select neighbour, return it if its value is below or equal to zero (continue with the next selection otherwise). |
Neighbour<Exam,ExamPlacement> |
ExamGreatDeluge.selectNeighbour(Solution<Exam,ExamPlacement> solution)
A neighbour is generated randomly untill an acceptable one is found. |
Neighbour<Exam,ExamPlacement> |
ExamConstruction.selectNeighbour(Solution<Exam,ExamPlacement> solution)
Select a neighbour. |
Neighbour<Exam,ExamPlacement> |
ExamColoringConstruction.selectNeighbour(Solution<Exam,ExamPlacement> solution)
|
ExamPlacement |
ExamTabuSearch.selectValue(Solution<Exam,ExamPlacement> solution,
Exam exam)
Value selection |
Exam |
ExamUnassignedVariableSelection.selectVariable(Solution<Exam,ExamPlacement> solution)
Variable selection |
void |
ExamSimulatedAnnealing.solutionUpdated(Solution<Exam,ExamPlacement> solution)
|
void |
ExamHillClimbing.solutionUpdated(Solution<Exam,ExamPlacement> solution)
|
void |
ExamGreatDeluge.solutionUpdated(Solution<Exam,ExamPlacement> solution)
|
Uses of Exam in net.sf.cpsolver.exam.model |
---|
Methods in net.sf.cpsolver.exam.model that return Exam | |
---|---|
Exam |
ExamOwner.getExam()
An exam for this course/section |
Methods in net.sf.cpsolver.exam.model that return types with arguments of type Exam | |
---|---|
Set<Exam> |
ExamStudent.getExams(ExamPeriod period)
Exam(s) enrolled by the student that are scheduled in the given period |
Set<Exam> |
ExamInstructor.getExams(ExamPeriod period)
Exam(s) enrolled by the instructor that are scheduled in the given period |
Set<Exam> |
ExamStudent.getExamsADay(ExamPeriod period)
Exam(s) enrolled by the student that are scheduled in the given day |
Set<Exam> |
ExamInstructor.getExamsADay(ExamPeriod period)
Exam(s) enrolled by the instructor that are scheduled in the given day |
Set<Exam> |
ExamStudent.getExamsADay(int day)
Exam(s) enrolled by the student that are scheduled in the given day |
Set<Exam> |
ExamInstructor.getExamsADay(int day)
Exam(s) enrolled by the instructor that are scheduled in the given day |
Map<Exam,List<ExamStudent>> |
Exam.getJointEnrollments()
Joint enrollments |
HashSet<Exam> |
Exam.getStudentConflicts(ExamPeriod period)
List of exams that are assigned to the given period and share one or more students with this exam (that does not have direct conflicts allowed, see ExamStudent.canConflict(Exam, Exam) ). |
Methods in net.sf.cpsolver.exam.model with parameters of type Exam | |
---|---|
boolean |
ExamStudent.canConflict(Exam ex1,
Exam ex2)
True if the given two exams can have a direct student conflict with this student, i.e., they can be placed at the same period. |
int |
Exam.compareTo(Exam o)
An exam with more correlated exams is preferred ( nrStudentCorrelatedExams() ). |
Method parameters in net.sf.cpsolver.exam.model with type arguments of type Exam | |
---|---|
void |
Exam.addContstraint(Constraint<Exam,ExamPlacement> constraint)
Adds a constraint. |
int |
ExamStudent.compareTo(Constraint<Exam,ExamPlacement> o)
Compare two students (by student ids) |
int |
ExamRoom.compareTo(Constraint<Exam,ExamPlacement> o)
Compare two rooms (by unique id) |
void |
Exam.removeContstraint(Constraint<Exam,ExamPlacement> constraint)
Removes a constraint. |
Constructors in net.sf.cpsolver.exam.model with parameters of type Exam | |
---|---|
ExamOwner(Exam exam,
long id,
String name)
Constructor. |
|
ExamPlacement(Exam exam,
ExamPeriodPlacement periodPlacement,
Set<ExamRoomPlacement> roomPlacements)
Constructor |
Uses of Exam in net.sf.cpsolver.exam.neighbours |
---|
Methods in net.sf.cpsolver.exam.neighbours that return types with arguments of type Exam | |
---|---|
Neighbour<Exam,ExamPlacement> |
ExamTimeMove.selectNeighbour(Solution<Exam,ExamPlacement> solution)
Select an exam randomly, select an available period randomly (if it is not assigned), use rooms if possible, select rooms using findBestAvailableRooms(ExamPeriodPlacement) if not (exam is unassigned, a room is not available or used). |
Neighbour<Exam,ExamPlacement> |
ExamRoomMove.selectNeighbour(Solution<Exam,ExamPlacement> solution)
Select an exam randomly, select an available period randomly (if it is not assigned, from getPeriodPlacements() ), select rooms
using findRoomsRandom(ExamPeriodPlacement) |
Neighbour<Exam,ExamPlacement> |
ExamRandomMove.selectNeighbour(Solution<Exam,ExamPlacement> solution)
Select an exam randomly, select an available period randomly (from getPeriodPlacements() ), select rooms using
findBestAvailableRooms(ExamPeriodPlacement) . |
Method parameters in net.sf.cpsolver.exam.neighbours with type arguments of type Exam | |
---|---|
void |
ExamTimeMove.init(Solver<Exam,ExamPlacement> solver)
Initialization |
void |
ExamRoomMove.init(Solver<Exam,ExamPlacement> solver)
Initialization |
void |
ExamRandomMove.init(Solver<Exam,ExamPlacement> solver)
Initialization |
Neighbour<Exam,ExamPlacement> |
ExamTimeMove.selectNeighbour(Solution<Exam,ExamPlacement> solution)
Select an exam randomly, select an available period randomly (if it is not assigned), use rooms if possible, select rooms using findBestAvailableRooms(ExamPeriodPlacement) if not (exam is unassigned, a room is not available or used). |
Neighbour<Exam,ExamPlacement> |
ExamRoomMove.selectNeighbour(Solution<Exam,ExamPlacement> solution)
Select an exam randomly, select an available period randomly (if it is not assigned, from getPeriodPlacements() ), select rooms
using findRoomsRandom(ExamPeriodPlacement) |
Neighbour<Exam,ExamPlacement> |
ExamRandomMove.selectNeighbour(Solution<Exam,ExamPlacement> solution)
Select an exam randomly, select an available period randomly (from getPeriodPlacements() ), select rooms using
findBestAvailableRooms(ExamPeriodPlacement) . |
Uses of Exam in net.sf.cpsolver.exam.reports |
---|
Constructors in net.sf.cpsolver.exam.reports with parameters of type Exam | |
---|---|
ExamRoomComparator(Exam exam,
boolean asc)
Constructor |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |