Package jsprit.core.problem.solution

Examples of jsprit.core.problem.solution.VehicleRoutingProblemSolution

93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
    Collection<VehicleRoutingProblemSolution> solutions = vra.searchSolutions();
   
    /*
     * Retrieve best solution.
     */
    VehicleRoutingProblemSolution solution = new SelectBest().selectSolution(solutions);
   
    /*
     * print solution
     */
    SolutionPrinter.print(solution);
   
    /*
     * Plot solution.
     */
//    SolutionPlotter.plotSolutionAsPNG(vrp, solution, "output/pd_solomon_r101_solution.png","pd_r101");
//    Plotter plotter = new Plotter(vrp, solution);
//    plotter.setLabel(Label.SIZE);
//    plotter.plot("output/vrpwbh_christophides_vrpnc1_solution.png","vrpwbh_vrpnc1");

        SolutionAnalyser analyser = new SolutionAnalyser(vrp, solution, new SolutionAnalyser.DistanceCalculator() {

            @Override
            public double getDistance(String fromLocationId, String toLocationId) {
                return vrp.getTransportCosts().getTransportCost(fromLocationId,toLocationId,0.,null,null);
            }

        });

        for(VehicleRoute route : solution.getRoutes()){
            System.out.println("------");
            System.out.println("vehicleId: " + route.getVehicle().getId());
            System.out.println("vehicleCapacity: " + route.getVehicle().getType().getCapacityDimensions() + " maxLoad: " + analyser.getMaxLoad(route));
            System.out.println("totalDistance: " + analyser.getDistance(route));
            System.out.println("waitingTime: " + analyser.getWaitingTime(route));
View Full Code Here
116
117
118
119
120
121
122
123
124
125
126
    Collection<VehicleRoutingProblemSolution> solutions = algorithm.searchSolutions();
   
    /*
     * get the best
     */
    VehicleRoutingProblemSolution bestSolution = Solutions.bestOf(solutions);
   
    new VrpXMLWriter(problem, solutions).write("output/problem-with-solution.xml");
   
    SolutionPrinter.print(problem, bestSolution, SolutionPrinter.Print.VERBOSE);
   
View Full Code Here
313
314
315
316
317
318
319
320
321
322
323
        VehicleRoutingProblem.Builder vrpBuilder_ = VehicleRoutingProblem.Builder.newInstance();
        new VrpJsonReader(vrpBuilder_).read("output/vpr.json");
        VehicleRoutingProblem vrp_ = vrpBuilder_.build();

        VehicleRoutingAlgorithm vra = new GreedySchrimpfFactory().createAlgorithm(vrp_);
        VehicleRoutingProblemSolution solutions = Solutions.bestOf(vra.searchSolutions());

        new VrpJsonWriter(vrp,solutions,new SolutionAnalyser.DistanceCalculator() {

            @Override
            public double getDistance(String fromLocationId, String toLocationId) {
View Full Code Here
35
36
37
38
39
40
41
42
43
44
45
public class SelectBestTest {
 
  @Test
  public void whenHaving2Solutions_selectBest(){
    VehicleRoutingProblemSolution sol1 = mock(VehicleRoutingProblemSolution.class);
    VehicleRoutingProblemSolution sol2 = mock(VehicleRoutingProblemSolution.class);
    when(sol1.getCost()).thenReturn(1.0);
    when(sol2.getCost()).thenReturn(2.0);
    assertThat(new SelectBest().selectSolution(Arrays.asList(sol1,sol2)), is(sol1));
  }
View Full Code Here
44
45
46
47
48
49
50
51
52
    assertThat(new SelectBest().selectSolution(Arrays.asList(sol1,sol2)), is(sol1));
  }
 
  @Test
  public void whenHavingOnly1Solutions_selectThisOne(){
    VehicleRoutingProblemSolution sol1 = mock(VehicleRoutingProblemSolution.class);
    when(sol1.getCost()).thenReturn(1.0);
    assertThat(new SelectBest().selectSolution(Arrays.asList(sol1)), is(sol1));
  }
View Full Code Here
97
98
99
100
101
102
103
104
105
106
107
        VehicleRoutingAlgorithm vra = new VehicleRoutingAlgorithm(vrp, strategyManager);
        vra.addListener(stateManager);
        vra.addListener(new RemoveEmptyVehicles(fleetManager));

        VehicleRoutingProblemSolution iniSolution = new InsertionInitialSolutionFactory(bestInsertion, solutionCostCalculator).createSolution(vrp);
        vra.addInitialSolution(iniSolution);

        vra.setNuOfIterations(3);
    Collection<VehicleRoutingProblemSolution> solutions = vra.searchSolutions();
    assertTrue(!solutions.isEmpty());
View Full Code Here
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
public class SelectRandomlyTest {
 
  @Test
  public void whenHaving2Solutions_selectSecond(){
    VehicleRoutingProblemSolution sol1 = mock(VehicleRoutingProblemSolution.class);
    VehicleRoutingProblemSolution sol2 = mock(VehicleRoutingProblemSolution.class);
 
    when(sol1.getCost()).thenReturn(1.0);
    when(sol2.getCost()).thenReturn(2.0);
   
    Random random = mock(Random.class);
    when(random.nextInt(2)).thenReturn(1);

    SelectRandomly selectRandomly = new SelectRandomly();
View Full Code Here
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
  }
 
  @Test
  public void whenHaving2Solutions_selectFirst(){
   
    VehicleRoutingProblemSolution sol1 = mock(VehicleRoutingProblemSolution.class);
    VehicleRoutingProblemSolution sol2 = mock(VehicleRoutingProblemSolution.class);
   
    when(sol1.getCost()).thenReturn(1.0);
    when(sol2.getCost()).thenReturn(2.0);
   
    Random random = mock(Random.class);
    when(random.nextInt(2)).thenReturn(0);

    SelectRandomly selectRandomly = new SelectRandomly();
View Full Code Here
28
29
30
31
32
33
34
35
36
        VehicleRoutingProblem vrp = builder.build();
        VehicleRoutingAlgorithm algorithm = new GreedySchrimpfFactory().createAlgorithm(vrp);
        algorithm.setMaxIterations(10);
        Collection<VehicleRoutingProblemSolution> solutions = algorithm.searchSolutions();

        VehicleRoutingProblemSolution solution = Solutions.bestOf(solutions);
        assertTrue(!solution.getUnassignedJobs().contains(job1));
        assertTrue(solution.getUnassignedJobs().contains(job2));
    }
View Full Code Here
47
48
49
50
51
52
53
54
55
        VehicleRoutingProblem vrp = builder.build();
        VehicleRoutingAlgorithm algorithm = new GreedySchrimpfFactory().createAlgorithm(vrp);
        algorithm.setMaxIterations(10);
        Collection<VehicleRoutingProblemSolution> solutions = algorithm.searchSolutions();

        VehicleRoutingProblemSolution solution = Solutions.bestOf(solutions);
        assertTrue(!solution.getUnassignedJobs().contains(job1));
        assertTrue(solution.getUnassignedJobs().contains(job2));
    }
View Full Code Here
TOP

Related Classes of jsprit.core.problem.solution.VehicleRoutingProblemSolution

  • jsprit.analysis.toolbox.ConcurrentBenchmarker
  • jsprit.core.algorithm.acceptor.AcceptNewRemoveWorstTest
  • jsprit.core.algorithm.acceptor.ExperimentalSchrimpfAcceptance
  • jsprit.core.algorithm.acceptor.GreedyAcceptance
  • jsprit.core.algorithm.acceptor.GreedyAcceptance_minVehFirst
  • jsprit.core.algorithm.acceptor.SchrimpfAcceptance
  • jsprit.core.algorithm.BuildCVRPAlgoFromScratch_IT
  • jsprit.core.algorithm.BuildPDVRPAlgoFromScratch_IT
  • jsprit.core.algorithm.BuildPDVRPWithShipmentsAlgoFromScratch_IT
  • jsprit.core.algorithm.ExternalInitialSolutionIsInValidTest
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.