Uses of Class
net.sf.cpsolver.ifs.model.Neighbour

Packages that use Neighbour
net.sf.cpsolver.coursett.heuristics University Course Timetabling: Heuristics. 
net.sf.cpsolver.exam.heuristics Examination Timetabling: Solution Heuristics. 
net.sf.cpsolver.exam.neighbours Examination Timetabling: Various Neighbourhoods. 
net.sf.cpsolver.exam.split This package contains an an experimental criterion that allows an exam to be split into two if it decreases the number of student conflicts. 
net.sf.cpsolver.ifs.dbt Dynamic backtracking extension of IFS solver 
net.sf.cpsolver.ifs.heuristics IFS Heuristics (value and variable selection criteria) 
net.sf.cpsolver.ifs.model IFS Model (description of a problem) 
net.sf.cpsolver.ifs.solver IFS Solver 
net.sf.cpsolver.studentsct.heuristics Student Sectioning: Heuristics. 
net.sf.cpsolver.studentsct.heuristics.selection Student Sectioning: Various Neighbour Selection Criteria. 
 

Uses of Neighbour in net.sf.cpsolver.coursett.heuristics
 

Subclasses of Neighbour in net.sf.cpsolver.coursett.heuristics
 class NeighbourSelectionWithSuggestions.SuggestionNeighbour
           
 

Methods in net.sf.cpsolver.coursett.heuristics that return Neighbour
 Neighbour<Lecture,Placement> NeighbourSelectionWithSuggestions.selectNeighbour(Solution<Lecture,Placement> solution)
           
 Neighbour<Lecture,Placement> NeighbourSelectionWithSuggestions.selectNeighbourWithSuggestions(Solution<Lecture,Placement> solution, Lecture lecture, int depth)
           
 

Uses of Neighbour in net.sf.cpsolver.exam.heuristics
 

Methods in net.sf.cpsolver.exam.heuristics that return Neighbour
 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 Exam.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 Neighbour
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
 

Uses of Neighbour in net.sf.cpsolver.exam.neighbours
 

Subclasses of Neighbour in net.sf.cpsolver.exam.neighbours
 class ExamRoomSwapNeighbour
          Swap a room between two assigned exams.
 class ExamSimpleNeighbour
          Extension of SimpleNeighbour.
 

Methods in net.sf.cpsolver.exam.neighbours that return Neighbour
 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 Exam.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 Exam.getPeriodPlacements()), select rooms using Exam.findRoomsRandom(ExamPeriodPlacement)
 Neighbour<Exam,ExamPlacement> ExamRandomMove.selectNeighbour(Solution<Exam,ExamPlacement> solution)
          Select an exam randomly, select an available period randomly (from Exam.getPeriodPlacements()), select rooms using Exam.findBestAvailableRooms(ExamPeriodPlacement).
 Neighbour<Exam,ExamPlacement> ExamPeriodSwapMove.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 Exam.findBestAvailableRooms(ExamPeriodPlacement) if not (exam is unassigned, a room is not available or used).
 

Uses of Neighbour in net.sf.cpsolver.exam.split
 

Subclasses of Neighbour in net.sf.cpsolver.exam.split
protected  class ExamSplitMoves.ExamMergeNeighbour
          Merge two exams that have been split before back into one.
protected  class ExamSplitMoves.ExamShuffleNeighbour
          Shuffle students between the parent exam and all of its children.
protected  class ExamSplitMoves.ExamSplitNeighbour
          Split an exam into two
 

Methods in net.sf.cpsolver.exam.split that return Neighbour
 Neighbour<Exam,ExamPlacement> ExamSplitMoves.selectNeighbour(Solution<Exam,ExamPlacement> solution)
          Select a split (split an exam into two), a merge (merge two split exams back together) or shuffle operation (move students between two exams that has been split before).
 

Uses of Neighbour in net.sf.cpsolver.ifs.dbt
 

Methods in net.sf.cpsolver.ifs.dbt with parameters of type Neighbour
 boolean DbtPropagation.neighbourSelected(long iteration, Neighbour<V,T> neighbour)
           
 

Uses of Neighbour in net.sf.cpsolver.ifs.heuristics
 

Subclasses of Neighbour in net.sf.cpsolver.ifs.heuristics
 class BacktrackNeighbourSelection.BackTrackNeighbour
          Backtracking neighbour
 

Methods in net.sf.cpsolver.ifs.heuristics that return Neighbour
 Neighbour<V,T> StandardNeighbourSelection.selectNeighbour(Solution<V,T> solution)
          Select neighbour.
 Neighbour<V,T> RoundRobinNeighbourSelection.selectNeighbour(Solution<V,T> solution)
          Select neighbour.
 Neighbour<V,T> NeighbourSelection.selectNeighbour(Solution<V,T> solution)
          select a neighbour of a given solution
 Neighbour<V,T> BacktrackNeighbourSelection.selectNeighbour(Solution<V,T> solution)
          Select neighbour.
 Neighbour<V,T> BacktrackNeighbourSelection.selectNeighbour(Solution<V,T> solution, V variable)
          Select neighbour -- starts from the provided variable.
 

Uses of Neighbour in net.sf.cpsolver.ifs.model
 

Subclasses of Neighbour in net.sf.cpsolver.ifs.model
 class LazyNeighbour<V extends Variable<V,T>,T extends Value<V,T>>
          Lazy neigbour (a change of the overall solution value is unknown before the neighbour is assigned, it is possible to undo the neighbour instead).
 class LazySwap<V extends Variable<V,T>,T extends Value<V,T>>
          Lazy swap of two variables.
 class SimpleNeighbour<V extends Variable<V,T>,T extends Value<V,T>>
          A neighbour consisting of a change (either assignment or unassignment) of a single variable.
 

Uses of Neighbour in net.sf.cpsolver.ifs.solver
 

Methods in net.sf.cpsolver.ifs.solver with parameters of type Neighbour
 boolean SolverListener.neighbourSelected(long iteration, Neighbour<V,T> neighbour)
          A neighbour was selected
 

Uses of Neighbour in net.sf.cpsolver.studentsct.heuristics
 

Methods in net.sf.cpsolver.studentsct.heuristics that return Neighbour
 Neighbour<Request,Enrollment> TwoPhaseStudentSctNeighbourSelection.RestoreDummyStudents.selectNeighbour(Solution<Request,Enrollment> solution)
          Return all (removed) dummy students into the problem
 

Uses of Neighbour in net.sf.cpsolver.studentsct.heuristics.selection
 

Subclasses of Neighbour in net.sf.cpsolver.studentsct.heuristics.selection
static class BranchBoundSelection.BranchBoundNeighbour
          Branch & bound neighbour -- a schedule of a student
 class PriorityConstructionSelection.ConstructionNeighbour
          Takes BranchBoundSelection.BranchBoundNeighbour but only assign the given number of assignments, corresponding to the number of cycles.
static class RandomUnassignmentSelection.UnassignStudentNeighbour
          Unassignment of all requests of a student
static class SwapStudentSelection.SwapStudentNeighbour
          Neighbour that contains the swap
 

Methods in net.sf.cpsolver.studentsct.heuristics.selection that return Neighbour
 Neighbour<Request,Enrollment> PriorityConstructionSelection.branchAndBound(Solution<Request,Enrollment> solution)
          Find best solution for the next student using BranchBoundSelection.
 Neighbour<Request,Enrollment> SwapStudentSelection.selectNeighbour(Solution<Request,Enrollment> solution)
          For each student that does not have a complete schedule, try to find a request and a student that can be moved out of an enrollment so that the selected student can be assigned to the selected request.
 Neighbour<Request,Enrollment> StandardSelection.selectNeighbour(Solution<Request,Enrollment> solution)
          Employ the provided VariableSelection and ValueSelection and return the selected value as SimpleNeighbour.
 Neighbour<Request,Enrollment> RndUnProblStudSelection.selectNeighbour(Solution<Request,Enrollment> solution)
          With the given probabilty, a problematic student is randomly selected to be unassigned.
 Neighbour<Request,Enrollment> ResectionUnassignedStudentsSelection.selectNeighbour(Solution<Request,Enrollment> solution)
          Select neighbour.
 Neighbour<Request,Enrollment> ResectionIncompleteStudentsSelection.selectNeighbour(Solution<Request,Enrollment> solution)
          Select neighbour.
 Neighbour<Request,Enrollment> RandomUnassignmentSelection.selectNeighbour(Solution<Request,Enrollment> solution)
          With the given probabilty, a student is randomly selected to be unassigned.
 Neighbour<Request,Enrollment> PriorityConstructionSelection.selectNeighbour(Solution<Request,Enrollment> solution)
          Select neighbor.
 Neighbour<Request,Enrollment> BranchBoundSelection.selectNeighbour(Solution<Request,Enrollment> solution)
          Select neighbour.
 Neighbour<Request,Enrollment> BacktrackSelection.selectNeighbour(Solution<Request,Enrollment> solution)
           
 



Copyright © 2014 UniTime LLC. All Rights Reserved.