Package jsprit.core.problem.solution

Examples of jsprit.core.problem.solution.VehicleRoutingProblemSolution

119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
   * @return discoveredSolution
     * @throws java.lang.IllegalStateException if selector cannot select any solution
     */
  @SuppressWarnings("UnusedParameters")
    public DiscoveredSolution run(VehicleRoutingProblem vrp, Collection<VehicleRoutingProblemSolution> solutions){
    VehicleRoutingProblemSolution solution = solutionSelector.selectSolution(solutions);
    if(solution == null) throw new IllegalStateException(getErrMsg());
    VehicleRoutingProblemSolution lastSolution = VehicleRoutingProblemSolution.copyOf(solution);
    for(SearchStrategyModule module : searchStrategyModules){
            lastSolution = module.runAndGetSolution(lastSolution);
    }
    double costs = solutionCostCalculator.getCosts(lastSolution);
    lastSolution.setCost(costs);
    boolean solutionAccepted = solutionAcceptor.acceptSolution(solutions, lastSolution);
    return new DiscoveredSolution(lastSolution, solutionAccepted, getName());
  }
View Full Code Here
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
    boolean solutionAccepted = false;
    if (solutions.size() < solutionMemory) {
      solutions.add(newSolution);
      solutionAccepted = true;
    } else {
      VehicleRoutingProblemSolution worst = null;
      double threshold = getThreshold(currentIteration);
      for(VehicleRoutingProblemSolution solutionInMemory : solutions){
        if(worst == null) worst = solutionInMemory;
        else if(solutionInMemory.getCost() > worst.getCost()) worst = solutionInMemory;
      }
            if(worst == null){
                solutions.add(newSolution);
                solutionAccepted = true;
            }
      else if(newSolution.getCost() < worst.getCost() + threshold){
        solutions.remove(worst);
        solutions.add(newSolution);
        solutionAccepted = true;
      }
    }
View Full Code Here
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
    boolean solutionAccepted = false;
    if (solutions.size() < solutionMemory) {
      solutions.add(newSolution);
      solutionAccepted = true;
    } else {
      VehicleRoutingProblemSolution worst = null;
      double threshold = getThreshold(currentIteration);
      for(VehicleRoutingProblemSolution solutionInMemory : solutions){
        if(worst == null) worst = solutionInMemory;
        else if(solutionInMemory.getCost() > worst.getCost()) worst = solutionInMemory;
      }
      if(newSolution.getRoutes().size() < worst.getRoutes().size()){
        solutions.remove(worst);
        solutions.add(newSolution);
        solutionAccepted = true;
      }
      else if(newSolution.getRoutes().size() == worst.getRoutes().size() && newSolution.getCost() < worst.getCost() + threshold){
        solutions.remove(worst);
        solutions.add(newSolution);
        solutionAccepted = true;
      }
    }
View Full Code Here
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
    boolean solutionAccepted = false;
    if (solutions.size() < solutionMemory) {
      solutions.add(newSolution);
      solutionAccepted = true;
    } else {
      VehicleRoutingProblemSolution worstSolution = null;
      for (VehicleRoutingProblemSolution s : solutions) {
        if (worstSolution == null) worstSolution = s;
        else if (s.getCost() > worstSolution.getCost()) worstSolution = s;
      }
      if(newSolution.getCost() < worstSolution.getCost()){
        solutions.remove(worstSolution);
        solutions.add(newSolution);
        solutionAccepted = true;
      }
    }
View Full Code Here
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
    boolean solutionAccepted = false;
    if (solutions.size() < solutionMemory) {
      solutions.add(newSolution);
      solutionAccepted = true;
    } else {
      VehicleRoutingProblemSolution worstSolution = null;
      for (VehicleRoutingProblemSolution s : solutions) {
        if (worstSolution == null) worstSolution = s;
        else if (s.getRoutes().size() > worstSolution.getRoutes().size()) worstSolution = s;
      }
      if(newSolution.getRoutes().size() < worstSolution.getRoutes().size()){
        solutions.remove(worstSolution);
        solutions.add(newSolution);
        solutionAccepted = true;
      }
      else if(newSolution.getRoutes().size() == worstSolution.getRoutes().size() && newSolution.getCost() < worstSolution.getCost()){
        solutions.remove(worstSolution);
        solutions.add(newSolution);
        solutionAccepted = true;
      }
    }
View Full Code Here
37
38
39
40
41
42
43
44
45
46
47
  }
 
  @Override
  public VehicleRoutingProblemSolution selectSolution(Collection<VehicleRoutingProblemSolution> solutions) {
    double minCost = Double.MAX_VALUE;
    VehicleRoutingProblemSolution bestSolution = null;
    for(VehicleRoutingProblemSolution sol : solutions){
      if(bestSolution == null){
        bestSolution = sol;
        minCost = sol.getCost();
      }
View Full Code Here
771
772
773
774
775
776
777
778
779
780
781
    return new AlgorithmStartsListener() {

      @Override
      public void informAlgorithmStarts(VehicleRoutingProblem problem, VehicleRoutingAlgorithm algorithm, Collection<VehicleRoutingProblemSolution> solutions) {
        InsertionInitialSolutionFactory insertionInitialSolutionFactory = new InsertionInitialSolutionFactory(finalInsertionStrategy, solutionCostCalculator);
        VehicleRoutingProblemSolution vrpSol = insertionInitialSolutionFactory.createSolution(vrp);
        solutions.add(vrpSol);
      }
    };

View Full Code Here
103
104
105
106
107
108
109
                .addService(s1).addPickup(shipment1).addDelivery(shipment1).addService(s2).build();

        VehicleRoute route2 = VehicleRoute.Builder.newInstance(vehicle).setJobActivityFactory(vrp.getJobActivityFactory())
                .addService(s3).addPickup(shipment2).addDelivery(shipment2).addService(s4).build();

        solution = new VehicleRoutingProblemSolution(Arrays.asList(route1,route2),42);
    }
View Full Code Here
160
161
162
163
164
165
166
                .addDelivery(s2)
                .addPickup(shipment1).addDelivery(shipment1)
                .addPickup(s1)
                .build();

        solution = new VehicleRoutingProblemSolution(Arrays.asList(route),300);
    }
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(vrp,solution, SolutionPrinter.Print.VERBOSE);
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.