net.sf.cpsolver.studentsct.heuristics.selection
Class ResectionIncompleteStudentsSelection
java.lang.Object
net.sf.cpsolver.studentsct.heuristics.selection.BranchBoundSelection
net.sf.cpsolver.studentsct.heuristics.selection.ResectionIncompleteStudentsSelection
- All Implemented Interfaces:
- NeighbourSelection<Request,Enrollment>
public class ResectionIncompleteStudentsSelection
- extends BranchBoundSelection
Resection incomplete studends. An extension of BranchBoundSelection,
where only students that are not complete (Student.isComplete() is
false) and that are sectioned somewhere (Student.nrAssignedRequests()
is greater then zero) are resectioned.
- Version:
- StudentSct 1.2 (Student Sectioning)
Copyright (C) 2007 - 2010 Tomas Muller
muller@unitime.org
http://muller.unitime.org
This library is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as
published by the Free Software Foundation; either version 3 of the
License, or (at your option) any later version.
This library is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not see
http://www.gnu.org/licenses/.
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
ResectionIncompleteStudentsSelection
public ResectionIncompleteStudentsSelection(DataProperties properties)
init
public void init(Solver<Request,Enrollment> solver)
- Description copied from interface:
NeighbourSelection
- Criterion initialization
- Specified by:
init in interface NeighbourSelection<Request,Enrollment>- Overrides:
init in class BranchBoundSelection
selectNeighbour
public Neighbour<Request,Enrollment> selectNeighbour(Solution<Request,Enrollment> solution)
- Select neighbour. All students with an incomplete and non-empty schedule
are taken, one by one in a random order. For each student a branch &
bound search is employed.
- Specified by:
selectNeighbour in interface NeighbourSelection<Request,Enrollment>- Overrides:
selectNeighbour in class BranchBoundSelection
- Parameters:
solution - given solution
- Returns:
- a neighbour assignment
Copyright © 2013 UniTime LLC. All Rights Reserved.