Package jsprit.core.problem.solution

Examples of jsprit.core.problem.solution.VehicleRoutingProblemSolution

84
85
86
87
88
89
90
91
92
93
94
    Collection<VehicleRoutingProblemSolution> solutions = vra.searchSolutions();
   
    /*
     * Retrieve best solution.
     */
    VehicleRoutingProblemSolution solution = new SelectBest().selectSolution(solutions);
   
    /*
     * print solution
     */
    SolutionPrinter.print(solution);
 
View Full Code Here
74
75
76
77
78
79
80
81
82
83
84
    Collection<VehicleRoutingProblemSolution> solutions = vra.searchSolutions();
   
    /*
     * Retrieve best solution.
     */
    VehicleRoutingProblemSolution solution = new SelectBest().selectSolution(solutions);


    /*
     * print solution
     */
 
View Full Code Here
177
178
179
180
181
182
183
184
185
186
187
    Collection<VehicleRoutingProblemSolution> solutions = algorithm.searchSolutions();
   
    /*
     * get the best
     */
    VehicleRoutingProblemSolution bestSolution = Solutions.bestOf(solutions);
   
    /*
     * write out problem and solution to xml-file
     */
//    new VrpXMLWriter(problem, solutions).write("output/shipment-problem-with-solution.xml");
View Full Code Here
76
77
78
79
80
81
82
83
84
85
86
    Collection<VehicleRoutingProblemSolution> solutions = vra.searchSolutions();
   
    /*
     * Retrieve best solution.
     */
    VehicleRoutingProblemSolution solution = new SelectBest().selectSolution(solutions);
   
    /*
     * print solution
     */
    SolutionPrinter.print(solution);
 
View Full Code Here
94
95
96
97
98
99
100
101
102
103
104
    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
119
120
121
122
123
124
125
126
127
128
129
    VehicleRoutingProblem vrp = vrpBuilder.build();
   
    VehicleRoutingAlgorithm vra = VehicleRoutingAlgorithms.readAndCreateAlgorithm(vrp, "input/algorithmConfigWithSchrimpfAcceptance.xml");
    Collection<VehicleRoutingProblemSolution> solutions = vra.searchSolutions();
   
    VehicleRoutingProblemSolution best = Solutions.bestOf(solutions);
   
    SolutionPrinter.print(vrp, best, SolutionPrinter.Print.VERBOSE);
   
    new GraphStreamViewer(vrp, best).setRenderDelay(100).display();
   
View Full Code Here
22
23
24
25
26
27
28
29
30
31
32
33

public class Solutions {
 
  public static VehicleRoutingProblemSolution bestOf(Collection<VehicleRoutingProblemSolution> solutions){
    VehicleRoutingProblemSolution best = null;
    for(VehicleRoutingProblemSolution s : solutions){
      if(best == null) best = s;
      else if(s.getCost() < best.getCost()) best = s;
    }
    return best;
  }
View Full Code Here
51
52
53
54
55
56
57
58
59
60
61
  public VehicleRoutingProblemSolution createSolution(final VehicleRoutingProblem vrp) {
    logger.info("create initial solution.");
    List<VehicleRoute> vehicleRoutes = new ArrayList<VehicleRoute>();
    vehicleRoutes.addAll(vrp.getInitialVehicleRoutes());
    Collection<Job> badJobs = insertion.insertJobs(vehicleRoutes, getUnassignedJobs(vrp));
    VehicleRoutingProblemSolution solution = new VehicleRoutingProblemSolution(vehicleRoutes, badJobs, Double.MAX_VALUE);
    double costs = solutionCostsCalculator.getCosts(solution);
    solution.setCost(costs);
    logger.info("creation done");
    return solution;
  }
View Full Code Here
151
152
153
154
155
156
157
158
159
160
161
162
    for(int run=0;run<runs;run++){
      VehicleRoutingAlgorithm vra = createAlgorithm(p);
      StopWatch stopwatch = new StopWatch();
      vra.getAlgorithmListeners().addListener(stopwatch,Priority.HIGH);
      Collection<VehicleRoutingProblemSolution> solutions = vra.searchSolutions();
      VehicleRoutingProblemSolution best = Solutions.bestOf(solutions);
      vehicles[run] = best.getRoutes().size();
      results[run] = cost.getCost(best);
      times[run] = stopwatch.getCompTimeInSeconds();
    }
   
    return new BenchmarkResult(p, runs, results, times, vehicles);
View Full Code Here
92
93
94
95
96
97
98
99
100
101
102
    Collection<VehicleRoutingProblemSolution> solutions = algorithm.searchSolutions();
   
    /*
     * get the best
     */
    VehicleRoutingProblemSolution bestSolution = Solutions.bestOf(solutions);
   
    /*
     * write out problem and solution to xml-file
     */
    new VrpXMLWriter(problem, solutions).write("output/shipment-problem-with-solution.xml");
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.