trans/graphhopper-jsprit
1
0
Fork 0
mirror of https://github.com/graphhopper/jsprit.git synced 2020-01-24 07:45:05 +01:00
Code Issues Releases Wiki Activity

added tests

Browse source
This commit is contained in:
oblonski 2014-02-25 22:10:35 +01:00
parent 286617f827
commit 3932e04d82
1 changed files with 65 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

68
jsprit-core/src/test/java/jsprit/core/algorithm/acceptor/SchrimpfAcceptanceTest.java
View file

@ -1,11 +1,13 @@
package jsprit.core.algorithm.acceptor; package jsprit.core.algorithm.acceptor;
import jsprit.core.problem.VehicleRoutingProblem;
import jsprit.core.problem.solution.VehicleRoutingProblemSolution; import jsprit.core.problem.solution.VehicleRoutingProblemSolution;
import org.junit.Before; import org.junit.Before;
import org.junit.Test; import org.junit.Test;
import java.util.ArrayList; import java.util.ArrayList;
import java.util.Collection; import java.util.Collection;
import java.util.Collections;
import static org.junit.Assert.assertFalse; import static org.junit.Assert.assertFalse;
import static org.junit.Assert.assertTrue; import static org.junit.Assert.assertTrue;
@ -50,7 +52,11 @@ public class SchrimpfAcceptanceTest {
@Test @Test
public void respectsTheNonZeroThreshold_usingWorstCostSolution() { public void respectsTheNonZeroThreshold_usingWorstCostSolution() {
schrimpfAcceptance.setInitialThreshold(0.5); schrimpfAcceptance.setInitialThreshold(0.5);
assertFalse("Worst cost solution (2.1 > 2.0) should not be accepted", schrimpfAcceptance.acceptSolution(memory, createSolutionWithCost(2.1))); /*
* it should be accepted since 2.1 < 2.0 + 0.5 (2.0 is the best solution found so far and 0.5 the ini threshold
* since the threshold of 0.5 allows new solutions to be <0.5 worse than the current best solution
*/
assertTrue("Worst cost solution (2.1 > 2.0) should be accepted", schrimpfAcceptance.acceptSolution(memory, createSolutionWithCost(2.1)));
} }
@Test @Test
@ -62,12 +68,68 @@ public class SchrimpfAcceptanceTest {
@Test @Test
public void respectsTheNonZeroThreshold_usingBetterButBelowTheThresholdCostSolution() { public void respectsTheNonZeroThreshold_usingBetterButBelowTheThresholdCostSolution() {
schrimpfAcceptance.setInitialThreshold(0.5); schrimpfAcceptance.setInitialThreshold(0.5);
assertFalse("Better cost solution (1.9 < 2.0) should not be accepted since the better cost is still below the threshold", schrimpfAcceptance.acceptSolution(memory, createSolutionWithCost(1.9))); //new solution also be in between 2.0 and 2.5, but it is even better than 2.0 --> thus true
assertTrue("Better cost solution (1.9 < 2.0) should not be accepted since the better cost is still below the threshold", schrimpfAcceptance.acceptSolution(memory, createSolutionWithCost(1.9)));
} }
@Test @Test
public void respectsTheNonZeroThreshold_usingSameCostSolution() { public void respectsTheNonZeroThreshold_usingSameCostSolution() {
schrimpfAcceptance.setInitialThreshold(0.5); schrimpfAcceptance.setInitialThreshold(0.5);
assertFalse("Same cost solution (2.0 == 2.0) should not be accepted", schrimpfAcceptance.acceptSolution(memory, createSolutionWithCost(2.0))); assertTrue("Same cost solution (2.0 == 2.0) should not be accepted", schrimpfAcceptance.acceptSolution(memory, createSolutionWithCost(2.0)));
} }
@Test
public void whenIniThresholdIsSetAndCurrentIterationIs0_itShouldJustAcceptSolution(){
schrimpfAcceptance.setInitialThreshold(0.5);
schrimpfAcceptance.informIterationStarts(0, mock(VehicleRoutingProblem.class), Collections.<VehicleRoutingProblemSolution>emptyList());
boolean accepted = schrimpfAcceptance.acceptSolution(memory, createSolutionWithCost(2.499999));
assertTrue(accepted);
}
@Test
public void whenIniThresholdIsSetAndCurrentIterationIs500_itShouldJustAcceptSolution(){
//1000 is the default totalNuOfIterations
schrimpfAcceptance.setInitialThreshold(0.5);
schrimpfAcceptance.informIterationStarts(500, mock(VehicleRoutingProblem.class), Collections.<VehicleRoutingProblemSolution>emptyList());
//according to the acceptance-function, it should just accept every solution less than 2.0 + 0.15749013123
//threshold(1000) = 0.15749013123
boolean accepted = schrimpfAcceptance.acceptSolution(memory, createSolutionWithCost(2.15748));
assertTrue(accepted);
}
@Test
public void whenIniThresholdIsSetAndCurrentIterationIs500_itShouldJustNotAcceptSolution(){
//1000 is the default totalNuOfIterations
schrimpfAcceptance.setInitialThreshold(0.5);
schrimpfAcceptance.informIterationStarts(500, mock(VehicleRoutingProblem.class), Collections.<VehicleRoutingProblemSolution>emptyList());
//according to the acceptance-function, it should just accept every solution less than 2.0 + 0.15749013123
//threshold(1000) = 0.15749013123
boolean accepted = schrimpfAcceptance.acceptSolution(memory, createSolutionWithCost(2.1575));
assertFalse(accepted);
}
@Test
public void whenIniThresholdIsSetAndCurrentIterationIs1000_itShouldJustAcceptSolution(){
//1000 is the default totalNuOfIterations
schrimpfAcceptance.setInitialThreshold(0.5);
schrimpfAcceptance.informIterationStarts(1000, mock(VehicleRoutingProblem.class), Collections.<VehicleRoutingProblemSolution>emptyList());
//according to the acceptance-function, it should just accept every solution less than 2.0 + 0.04960628287
//threshold(1000)= 0.04960628287
boolean accepted = schrimpfAcceptance.acceptSolution(memory, createSolutionWithCost(2.0496));
assertTrue(accepted);
}
@Test
public void whenIniThresholdIsSetAndCurrentIterationIs1000_itShouldJustNotAcceptSolution(){
//1000 is the default totalNuOfIterations
schrimpfAcceptance.setInitialThreshold(0.5);
schrimpfAcceptance.informIterationStarts(1000, mock(VehicleRoutingProblem.class), Collections.<VehicleRoutingProblemSolution>emptyList());
//according to the acceptance-function, it should just accept every solution less than 2.0 + 0.04960628287
//threshold(1000)=0.04960628287
boolean accepted = schrimpfAcceptance.acceptSolution(memory, createSolutionWithCost(2.0497));
assertFalse(accepted);
}
} }