org.drools.planner.examples.examination.solver.move.factory.NeighbourExaminationMoveFactory 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.examination.solver.move.factory;
import java.util.ArrayList;
import java.util.List;
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.examination.domain.Exam;
import org.drools.planner.examples.examination.domain.Examination;
import org.drools.planner.examples.examination.domain.Period;
import org.drools.planner.examples.examination.domain.Room;
import org.drools.planner.examples.examination.solver.move.PeriodChangeMove;
import org.drools.planner.examples.examination.solver.move.RoomChangeMove;
public class NeighbourExaminationMoveFactory extends AbstractMoveFactory {
private static final int PERIOD_JUMP = 2;
private static final int ROOM_JUMP = 2;
public List createMoveList(Solution solution) {
Examination examination = (Examination) solution;
List periodList = examination.getPeriodList();
List roomList = examination.getRoomList();
List moveList = new ArrayList();
for (Exam exam : examination.getExamList()) {
if (exam.isCoincidenceLeader()) {
for (Period period : periodList) {
int distance = calculateShortestDistance(
period.getPeriodIndex(), exam.getPeriod().getPeriodIndex(), periodList.size());
if (distance <= PERIOD_JUMP) {
moveList.add(new PeriodChangeMove(exam, period));
}
}
}
for (Room room : roomList) {
long distance = calculateShortestDistance(
room.getId(), exam.getRoom().getId(), roomList.size());
if (distance <= ROOM_JUMP) {
moveList.add(new RoomChangeMove(exam, room));
}
}
}
return moveList;
}
public int calculateShortestDistance(int a, int b, int size) {
int innerDistance = Math.abs(a - b);
int outerDistance = size - innerDistance;
return Math.min(innerDistance, outerDistance);
}
public long calculateShortestDistance(long a, long b, long size) {
long innerDistance = Math.abs(a - b);
long outerDistance = size - innerDistance;
return Math.min(innerDistance, outerDistance);
}
}