Examples of RuinAndRecreateModule

Examples of jsprit.core.algorithm.module.RuinAndRecreateModule

910
911
912
913
914
915
916
917
918
919
920
        insertion = createInsertionStrategy(insertionConfigs.get(0), vrp, vehicleFleetManager, routeStates, prioListeners, executorService, nuOfThreads, constraintManager, addDefaultCostCalculators);
        algorithmListeners.addAll(prioListeners);
      }
      final InsertionStrategy final_insertion = insertion;
   
      RuinAndRecreateModule rrModule =  new RuinAndRecreateModule("ruin_and_recreate", final_insertion, ruin);
      return rrModule;
    }
    throw new NullPointerException("no module found with moduleName=" + moduleName +
        "\n\tcheck config whether the correct names are used" +
        "\n\tcurrently there are following modules available: " +
View Full Code Here

Examples of jsprit.core.algorithm.module.RuinAndRecreateModule

163
164
165
166
167
168
169
170
171
172
173
174
175
176
     * here: the VariablePlusFixed.... comes out of the box and it does what its name suggests
     */
    SolutionCostCalculator solutionCostCalculator = new VariablePlusFixedSolutionCostCalculatorFactory(stateManager).createCalculator();
   
    SearchStrategy firstStrategy = new SearchStrategy(new SelectBest(), new GreedyAcceptance(1), solutionCostCalculator);
    firstStrategy.addModule(new RuinAndRecreateModule("randomRuinAndBestInsertion", iStrategy, randomRuin));
   
    SearchStrategy secondStrategy = new SearchStrategy(new SelectBest(), new GreedyAcceptance(1), solutionCostCalculator);
    secondStrategy.addModule(new RuinAndRecreateModule("radialRuinAndBestInsertion", iStrategy, radialRuin));
   
    /*
     * put both strategies together, each with the prob of 0.5 to be selected
     */
    SearchStrategyManager searchStrategyManager = new SearchStrategyManager();
View Full Code Here

Examples of jsprit.core.algorithm.module.RuinAndRecreateModule

82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
                return costs;
            }
        };

        SearchStrategy randomStrategy = new SearchStrategy(new SelectBest(), new GreedyAcceptance(1), solutionCostCalculator);
        RuinAndRecreateModule randomModule = new RuinAndRecreateModule("randomRuin_bestInsertion", bestInsertion, random);
        randomStrategy.addModule(randomModule);

        SearchStrategy radialStrategy = new SearchStrategy(new SelectBest(), new GreedyAcceptance(1), solutionCostCalculator);
        RuinAndRecreateModule radialModule = new RuinAndRecreateModule("radialRuin_bestInsertion", bestInsertion, radial);
        radialStrategy.addModule(radialModule);

        SearchStrategyManager strategyManager = new SearchStrategyManager();
        strategyManager.addStrategy(radialStrategy, 0.5);
        strategyManager.addStrategy(randomStrategy, 0.5);
View Full Code Here

Examples of jsprit.core.algorithm.module.RuinAndRecreateModule

86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
        return costs;
      }
    };
   
    SearchStrategy randomStrategy = new SearchStrategy(new SelectBest(), new GreedyAcceptance(1), solutionCostCalculator);
    RuinAndRecreateModule randomModule = new RuinAndRecreateModule("randomRuin_bestInsertion", bestInsertion, random);
    randomStrategy.addModule(randomModule);
   
    SearchStrategy radialStrategy = new SearchStrategy(new SelectBest(), new GreedyAcceptance(1), solutionCostCalculator);
    RuinAndRecreateModule radialModule = new RuinAndRecreateModule("radialRuin_bestInsertion", bestInsertion, radial);
    radialStrategy.addModule(radialModule);
   
    SearchStrategyManager strategyManager = new SearchStrategyManager();
    strategyManager.addStrategy(radialStrategy, 0.5);
    strategyManager.addStrategy(randomStrategy, 0.5);
View Full Code Here

Examples of jsprit.core.algorithm.module.RuinAndRecreateModule

88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
          return costs;
        }
      };
     
      SearchStrategy randomStrategy = new SearchStrategy(new SelectBest(), new GreedyAcceptance(1), solutionCostCalculator);
      RuinAndRecreateModule randomModule = new RuinAndRecreateModule("randomRuin_bestInsertion", bestInsertion, random);
      randomStrategy.addModule(randomModule);
     
      SearchStrategy radialStrategy = new SearchStrategy(new SelectBest(), new GreedyAcceptance(1), solutionCostCalculator);
      RuinAndRecreateModule radialModule = new RuinAndRecreateModule("radialRuin_bestInsertion", bestInsertion, radial);
      radialStrategy.addModule(radialModule);
     
      SearchStrategyManager strategyManager = new SearchStrategyManager();
      strategyManager.addStrategy(radialStrategy, 0.5);
      strategyManager.addStrategy(randomStrategy, 0.5);
View Full Code Here

Examples of jsprit.core.algorithm.module.RuinAndRecreateModule

164
165
166
167
168
169
170
171
172
173
174
175
176
177
     * here: the VariablePlusFixed.... comes out of the box and it does what its name suggests
     */
    SolutionCostCalculator solutionCostCalculator = new VariablePlusFixedSolutionCostCalculatorFactory(stateManager).createCalculator();
   
    SearchStrategy firstStrategy = new SearchStrategy(new SelectBest(), new GreedyAcceptance(1), solutionCostCalculator);
    firstStrategy.addModule(new RuinAndRecreateModule("randomRuinAndBestInsertion", iStrategy, randomRuin));
   
    SearchStrategy secondStrategy = new SearchStrategy(new SelectBest(), new GreedyAcceptance(1), solutionCostCalculator);
    secondStrategy.addModule(new RuinAndRecreateModule("radialRuinAndBestInsertion", iStrategy, radialRuin));
   
    /*
     * put both strategies together, each with the prob of 0.5 to be selected
     */
    SearchStrategyManager searchStrategyManager = new SearchStrategyManager();
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.