Package jsprit.core.algorithm.termination

Examples of jsprit.core.algorithm.termination.IterationWithoutImprovementTermination

658
659
660
661
662
663
664
665
666
667
668
        if(basedOn.equals("iterations")){
            log.info("set prematureBreak based on iterations");
            String iter = config.getString("iterations");
            if(iter == null) throw new IllegalStateException("iterations is missing");
            int iterations = Integer.valueOf(iter);
            return new IterationWithoutImprovementTermination(iterations);
        }
        if(basedOn.equals("time")){
            log.info("set prematureBreak based on time");
            String timeString = config.getString("time");
            if(timeString == null) throw new IllegalStateException("time is missing");
View Full Code Here
695
696
697
698
699
700
701
702
703
704
705
    if(basedOn.equals("iterations")){
      log.info("set prematureBreak based on iterations");
      String iter = config.getString("prematureBreak.iterations");
      if(iter == null) throw new IllegalStateException("prematureBreak.iterations is missing");
      int iterations = Integer.valueOf(iter);
      return new IterationWithoutImprovementTermination(iterations);
    }
    if(basedOn.equals("time")){
      log.info("set prematureBreak based on time");
      String timeString = config.getString("prematureBreak.time");
      if(timeString == null) throw new IllegalStateException("prematureBreak.time is missing");
View Full Code Here
167
168
169
170
171
172
173
174
175
176
177
        constraintManager.addConstraint(geoClusterConstraint);

        vraBuilder.setStateAndConstraintManager(stateManager,constraintManager);
        VehicleRoutingAlgorithm algorithm = vraBuilder.build();

    algorithm.setPrematureAlgorithmTermination(new IterationWithoutImprovementTermination(100));
//    algorithm.setNuOfIterations(30000);
    /*
     * and search a solution
     */
    Collection<VehicleRoutingProblemSolution> solutions = algorithm.searchSolutions();
View Full Code Here
71
72
73
74
75
76
77
78
79
80
     * run both
     */
    vra_withThreshold.searchSolutions();
   
    vra_greedy.searchSolutions(); 
    vra_greedy.setPrematureAlgorithmTermination(new IterationWithoutImprovementTermination(40));
    vra_greedy.searchSolutions();
 
   
  }
View Full Code Here
137
138
139
140
141
142
143
144
145
146
147
    vrpBuilder.setRoutingCost(matrixBuilder.build());
   
    VehicleRoutingProblem vrp = vrpBuilder.build();
   
    VehicleRoutingAlgorithm vra = new GreedySchrimpfFactory().createAlgorithm(vrp);
    vra.setPrematureAlgorithmTermination(new IterationWithoutImprovementTermination(100));
    Collection<VehicleRoutingProblemSolution> solutions = vra.searchSolutions();
   
    SolutionPrinter.print(Solutions.bestOf(solutions));
   
    new VrpXMLWriter(vrp, solutions).write("output/refuseCollectionExampleSolution.xml");
View Full Code Here
198
199
200
201
202
203
204
205
206
    vra.setMaxIterations(1000);
   
    /*
     * optionally define a premature termination criterion (by default: not criterion is set)
     */
    vra.setPrematureAlgorithmTermination(new IterationWithoutImprovementTermination(100));
   
    return vra;
  }
View Full Code Here
173
174
175
176
177
178
179
180
181
182
183
        readDistances(matrixBuilder);

        vrpBuilder.setRoutingCost(matrixBuilder.build());
    VehicleRoutingProblem vrp = vrpBuilder.build();
    VehicleRoutingAlgorithm vra = new SchrimpfFactory().createAlgorithm(vrp);
    vra.setPrematureAlgorithmTermination(new IterationWithoutImprovementTermination(100));
    Collection<VehicleRoutingProblemSolution> solutions = vra.searchSolutions();
   
    SolutionPrinter.print(vrp, Solutions.bestOf(solutions), Print.VERBOSE);
   
    assertEquals(397.0,Solutions.bestOf(solutions).getCost(),40.);
View Full Code Here
217
218
219
220
221
222
223
224
225
226
227
        readDistances(matrixBuilder);

        vrpBuilder.setRoutingCost(matrixBuilder.build());
        VehicleRoutingProblem vrp = vrpBuilder.build();
        VehicleRoutingAlgorithm vra = new SchrimpfFactory().createAlgorithm(vrp);
        vra.setPrematureAlgorithmTermination(new IterationWithoutImprovementTermination(100));
        Collection<VehicleRoutingProblemSolution> solutions = vra.searchSolutions();

        SolutionPrinter.print(vrp, Solutions.bestOf(solutions), Print.VERBOSE);

        assertEquals(397.0,Solutions.bestOf(solutions).getCost(),40.);
View Full Code Here
261
262
263
264
265
266
267
268
269
270
271
        readDistances(matrixBuilder);

        vrpBuilder.setRoutingCost(matrixBuilder.build());
        VehicleRoutingProblem vrp = vrpBuilder.build();
        VehicleRoutingAlgorithm vra = new SchrimpfFactory().createAlgorithm(vrp);
        vra.setPrematureAlgorithmTermination(new IterationWithoutImprovementTermination(100));
        Collection<VehicleRoutingProblemSolution> solutions = vra.searchSolutions();

        SolutionPrinter.print(vrp, Solutions.bestOf(solutions), Print.VERBOSE);

        assertEquals(397.0,Solutions.bestOf(solutions).getCost(),40.);
View Full Code Here
149
150
151
152
153
154
155
156
157
158
159
    }
   
    vrpBuilder.setRoutingCost(matrixBuilder.build());
    VehicleRoutingProblem vrp = vrpBuilder.build();
    VehicleRoutingAlgorithm vra = new GreedySchrimpfFactory().createAlgorithm(vrp);
    vra.setPrematureAlgorithmTermination(new IterationWithoutImprovementTermination(100));
    Collection<VehicleRoutingProblemSolution> solutions = vra.searchSolutions();
   
    SolutionPrinter.print(vrp, Solutions.bestOf(solutions), Print.VERBOSE);
   
    assertEquals(2.*397.+397.,Solutions.bestOf(solutions).getCost(),0.01);
 
View Full Code Here
TOP

Related Classes of jsprit.core.algorithm.termination.IterationWithoutImprovementTermination

  • jsprit.core.algorithm.BuildPDVRPAlgoFromScratch_IT
  • jsprit.core.algorithm.io.VehicleRoutingAlgorithms
  • jsprit.core.algorithm.RefuseCollection_IT
  • jsprit.core.algorithm.RefuseCollectionWithCostsHigherThanTimesAndFiniteFleet_IT
  • jsprit.core.algorithm.RefuseCollectionWithCostsHigherThanTimesAndFiniteFleet_withTimeAndDistanceCosts_IT
  • jsprit.examples.BuildAlgorithmFromScratch
  • jsprit.examples.BuildAlgorithmFromScratchWithHardAndSoftConstraints
  • jsprit.examples.CompareAlgorithmExample
  • jsprit.examples.EnRoutePickupAndDeliveryWithMultipleDepotsAndVehicleAccessConstraintAndSpecifiedVehicleEndLocationsExample
  • jsprit.examples.RefuseCollectionExample
    • 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.