Package jsprit.core.algorithm.acceptor

Examples of jsprit.core.algorithm.acceptor.GreedyAcceptance

162
163
164
165
166
167
168
169
170
171
172
173
174
175
     * but before define how a generated solution is evaluated
     * 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
     */
 
View Full Code Here
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
                }
                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);
View Full Code Here
112
113
114
115
116
117
118
119
120
121
122
    String acceptorId = "acceptorId";
   
    ModKey key = new ModKey(acceptorName,acceptorId);
    AcceptorKey accKey = new AcceptorKey(key);
   
    SolutionAcceptor acceptor = new GreedyAcceptance(1);
   
    typedMap.put(accKey, acceptor);
   
    assertEquals(acceptor,typedMap.get(accKey));
   
View Full Code Here
132
133
134
135
136
137
138
139
140
141
142
    String selectorName = "selector";
    String selectorId = "selectorId";
   
    ModKey key = new ModKey(acceptorName,acceptorId);
    AcceptorKey accKey = new AcceptorKey(key);
    SolutionAcceptor acceptor =  new GreedyAcceptance(1);
   
    SelectorKey selKey = new SelectorKey(new ModKey(selectorName,selectorId));
    SolutionSelector selector = new SelectBest();
   
    typedMap.put(accKey, acceptor);
View Full Code Here
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
    String selectorName = "selector";
    String selectorId = "selectorId";
   
    ModKey key = new ModKey(acceptorName,acceptorId);
    AcceptorKey accKey = new AcceptorKey(key);
    SolutionAcceptor acceptor =  new GreedyAcceptance(1);
   
    SelectorKey selKey = new SelectorKey(new ModKey(selectorName,selectorId));
    SolutionSelector selector = new SelectBest();
   
    AcceptorKey accKey2 = new AcceptorKey(new ModKey(acceptorName2,acceptorId2));
    SolutionAcceptor acceptor2 =  new GreedyAcceptance(1);
   
    typedMap.put(accKey, acceptor);
    typedMap.put(selKey, selector);
    typedMap.put(accKey2, acceptor2);
   
View Full Code Here
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
        }
        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);
View Full Code Here
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
          }
          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);
View Full Code Here
163
164
165
166
167
168
169
170
171
172
173
174
175
176
     * but before define how a generated solution is evaluated
     * 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
     */
 
View Full Code Here
TOP

Related Classes of jsprit.core.algorithm.acceptor.GreedyAcceptance

  • jsprit.core.algorithm.BuildCVRPAlgoFromScratch_IT
  • jsprit.core.algorithm.BuildPDVRPAlgoFromScratch_IT
  • jsprit.core.algorithm.BuildPDVRPWithShipmentsAlgoFromScratch_IT
  • jsprit.core.algorithm.io.TestAlgorithmReader
  • jsprit.core.problem.solution.VehicleRoutingProblemSolution
  • jsprit.examples.BuildAlgorithmFromScratch
  • jsprit.examples.BuildAlgorithmFromScratchWithHardAndSoftConstraints
    • 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.