public void TestOneShiftNonViolatedBackward() { // create the problem and make sure 0->1->2->3->4 is the solution. var objective = new TSPTWFeasibleObjective(); var problem = TSPTWHelper.CreateTSPTW(0, 0, 5, 10); problem.Times[0][3] = 1; problem.Times[3][1] = 1; problem.Windows[1] = new TimeWindow() { Min = 1, Max = 3 }; // create a route with one shift. var route = new Optimization.Tours.Tour(new int[] { 0, 1, 2, 3, 4 }, 0); // apply the 1-shift local search, it should find the customer to replocate. var localSearch = new Local1Shift <TSPTWFeasibleObjective>(); var delta = 0.0f; Assert.IsTrue(localSearch.MoveNonViolatedBackward(problem, objective, route, out delta)); // shifts 3 after 0. // test result. Assert.AreEqual(7, delta); Assert.AreEqual(new int[] { 0, 3, 1, 2, 4 }, route.ToArray()); // create a feasible route. route = new Optimization.Tours.Tour(new int[] { 0, 2, 4, 1, 3 }, 0); // apply the 1-shift local search, it should find the customer to replocate. Assert.IsFalse(localSearch.MoveNonViolatedBackward(problem, objective, route, out delta)); }
public void TestFixedViolatedUnmovableCustomerValidBackward() { // create the problem and make sure 0->1->2->3->4 is the solution. var objective = new TSPTWFeasibleObjective(); var problem = TSPTWHelper.CreateTSPTW(0, 4, 5, 10); problem.Times[0][1] = 2; problem.Times[1][2] = 2; problem.Times[2][3] = 2; problem.Times[3][4] = 2; problem.Times[4][0] = 2; problem.Windows[4] = new TimeWindow() { Min = 7, Max = 9 }; // create a route with one shift. var route = new Optimization.Tours.Tour(new int[] { 0, 1, 3, 2, 4 }, 0); // apply the 1-shift local search, it should find the customer to replocate. var localSearch = new Local1Shift <TSPTWFeasibleObjective>(); var delta = 0.0f; Assert.IsTrue(localSearch.MoveNonViolatedBackward(problem, objective, route, out delta)); // shifts 2 after 1 // test result. Assert.AreEqual(23, delta); Assert.AreEqual(new int[] { 0, 1, 2, 3, 4 }, route.ToArray()); }