org.drools.planner.examples.nurserostering.solver.move.factory.ShiftAssignmentSequenceSwitchLength3MoveFactory Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of drools-planner-examples Show documentation
Show all versions of drools-planner-examples Show documentation
Drools Planner optimizes automated planning by combining metaheuristic search algorithms with rule
engine powered score calculation. This is the drools-planner-examples module which contains examples on how to use
Drools Planner.
/*
* Copyright 2010 JBoss Inc
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.drools.planner.examples.nurserostering.solver.move.factory;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.ListIterator;
import java.util.Map;
import org.drools.planner.core.move.CompositeMove;
import org.drools.planner.core.move.Move;
import org.drools.planner.core.move.factory.AbstractMoveFactory;
import org.drools.planner.core.solution.Solution;
import org.drools.planner.examples.nurserostering.domain.ShiftAssignment;
import org.drools.planner.examples.nurserostering.domain.Employee;
import org.drools.planner.examples.nurserostering.domain.NurseRoster;
import org.drools.planner.examples.nurserostering.domain.solver.EmployeeWorkSequence;
import org.drools.planner.examples.nurserostering.solver.move.EmployeeChangeMove;
public class ShiftAssignmentSequenceSwitchLength3MoveFactory extends AbstractMoveFactory {
public List createMoveList(Solution solution) {
NurseRoster nurseRoster = (NurseRoster) solution;
List employeeList = nurseRoster.getEmployeeList();
// This code assumes the shiftAssignmentList is sorted
List shiftAssignmentList = nurseRoster.getShiftAssignmentList();
// Hash the assignments per employee
Map> employeeToAssignmentSequenceListMap
= new HashMap>(employeeList.size());
int assignmentSequenceCapacity = nurseRoster.getShiftDateList().size() + 1 / 2;
for (Employee employee : employeeList) {
employeeToAssignmentSequenceListMap.put(employee,
new ArrayList(assignmentSequenceCapacity));
}
for (ShiftAssignment shiftAssignment : shiftAssignmentList) {
Employee employee = shiftAssignment.getEmployee();
List assignmentSequenceList = employeeToAssignmentSequenceListMap.get(employee);
if (assignmentSequenceList.isEmpty()) {
AssignmentSequence assignmentSequence = new AssignmentSequence(shiftAssignment);
assignmentSequenceList.add(assignmentSequence);
} else {
AssignmentSequence lastAssignmentSequence = assignmentSequenceList // getLast()
.get(assignmentSequenceList.size() - 1);
if (lastAssignmentSequence.belongsHere(shiftAssignment)) {
lastAssignmentSequence.add(shiftAssignment);
} else {
AssignmentSequence assignmentSequence = new AssignmentSequence(shiftAssignment);
assignmentSequenceList.add(assignmentSequence);
}
}
}
// The create the move list
List moveList = new ArrayList();
// For every 2 distinct employees
for (ListIterator leftEmployeeIt = employeeList.listIterator(); leftEmployeeIt.hasNext();) {
Employee leftEmployee = leftEmployeeIt.next();
List leftAssignmentSequenceList
= employeeToAssignmentSequenceListMap.get(leftEmployee);
for (ListIterator rightEmployeeIt = employeeList.listIterator(leftEmployeeIt.nextIndex());
rightEmployeeIt.hasNext();) {
Employee rightEmployee = rightEmployeeIt.next();
List rightAssignmentSequenceList
= employeeToAssignmentSequenceListMap.get(rightEmployee);
final int SWITCH_LENGTH = 3;
for (AssignmentSequence leftAssignmentSequence : leftAssignmentSequenceList) {
List leftShiftAssignmentList = leftAssignmentSequence.getShiftAssignmentList();
for (int leftIndex = 0; leftIndex <= leftShiftAssignmentList.size() - SWITCH_LENGTH; leftIndex++) {
for (AssignmentSequence rightAssignmentSequence : rightAssignmentSequenceList) {
List rightShiftAssignmentList = rightAssignmentSequence.getShiftAssignmentList();
for (int rightIndex = 0; rightIndex <= rightShiftAssignmentList.size() - SWITCH_LENGTH; rightIndex++) {
List subMoveList = new ArrayList(SWITCH_LENGTH * 2);
for (ShiftAssignment leftShiftAssignment : leftShiftAssignmentList
.subList(leftIndex, leftIndex + SWITCH_LENGTH)) {
subMoveList.add(new EmployeeChangeMove(leftShiftAssignment, rightEmployee));
}
for (ShiftAssignment rightShiftAssignment : rightShiftAssignmentList
.subList(rightIndex, rightIndex + SWITCH_LENGTH)) {
subMoveList.add(new EmployeeChangeMove(rightShiftAssignment, leftEmployee));
}
moveList.add(new CompositeMove(subMoveList));
}
}
}
}
}
}
return moveList;
}
/**
* TODO DRY with {@link EmployeeWorkSequence}
*/
private static class AssignmentSequence {
private List shiftAssignmentList;
private int firstDayIndex;
private int lastDayIndex;
private AssignmentSequence(ShiftAssignment shiftAssignment) {
shiftAssignmentList = new ArrayList();
shiftAssignmentList.add(shiftAssignment);
firstDayIndex = shiftAssignment.getShiftDateDayIndex();
lastDayIndex = firstDayIndex;
}
public List getShiftAssignmentList() {
return shiftAssignmentList;
}
public int getFirstDayIndex() {
return firstDayIndex;
}
public int getLastDayIndex() {
return lastDayIndex;
}
private void add(ShiftAssignment shiftAssignment) {
shiftAssignmentList.add(shiftAssignment);
int dayIndex = shiftAssignment.getShiftDateDayIndex();
if (dayIndex < lastDayIndex) {
throw new IllegalStateException("The shiftAssignmentList is expected to be sorted by shiftDate.");
}
lastDayIndex = dayIndex;
}
private boolean belongsHere(ShiftAssignment shiftAssignment) {
return shiftAssignment.getShiftDateDayIndex() <= (lastDayIndex + 1);
}
}
}