Examples of jsprit.core.algorithm.VehicleRoutingAlgorithm.searchSolutions()

Class jsprit.core.algorithm.VehicleRoutingAlgorithm

Examples of jsprit.core.algorithm.VehicleRoutingAlgorithm.searchSolutions()

jsprit.core.algorithm.VehicleRoutingAlgorithm.searchSolutions()
Runs the vehicle routing algorithm and returns a number of generated solutions.
The algorithm runs as long as it is specified in nuOfIterations and prematureBreak. In each iteration it selects a searchStrategy according to searchStrategyManager and runs the strategy to improve solutions.
Note that clients are allowed to observe/listen the algorithm. See {@link VehicleRoutingAlgorithmListener} and its according listeners. @return Collection the solutions @see {@link SearchStrategyManager}, {@link VehicleRoutingAlgorithmListener}, {@link AlgorithmStartsListener}, {@link AlgorithmEndsListener}, {@link IterationStartsListener}, {@link IterationEndsListener}

    VehicleRoutingAlgorithm algorithm = new SchrimpfFactory().createAlgorithm(problem);
    
    /*
     * and search a solution
     */
    Collection<VehicleRoutingProblemSolution> solutions = algorithm.searchSolutions();
    
    /*
     * get the best 
     */
    VehicleRoutingProblemSolution bestSolution = Solutions.bestOf(solutions);

View Full Code Here

    
    //build problem
    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);

View Full Code Here

    
    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();
    }

View Full Code Here


  private void runAlgorithm(BenchmarkInstance p, Algorithm algorithm, int run) {
    System.out.println("[algorithm=" + algorithm.name + "][instance="+p.name+"][run="+run+"][status=start]");
    VehicleRoutingAlgorithm vra = algorithm.factory.createAlgorithm(p.vrp);
    informCalculationStarts(p, algorithm.name, vra, run);
    Collection<VehicleRoutingProblemSolution> solutions = vra.searchSolutions();
    System.out.println("[algorithm=" + algorithm.name + "][instance="+p.name+"][run="+run+"][status=finished]");
    informCalculationsEnds(p, algorithm.name, vra, run, solutions);
  }


  private void informCalculationStarts(BenchmarkInstance p, String name, VehicleRoutingAlgorithm vra, int run) {

View Full Code Here

    
    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

     */
    VehicleRoutingAlgorithm vra = VehicleRoutingAlgorithms.readAndCreateAlgorithm(vrp, "input/algorithmConfig.xml");
    vra.setMaxIterations(10000);
        vra.getAlgorithmListeners().addListener(new StopWatch(),Priority.HIGH);
//    vra.getAlgorithmListeners().addListener(new AlgorithmSearchProgressChartListener("output/progress.png"));
    Collection<VehicleRoutingProblemSolution> solutions = vra.searchSolutions();
    
    SolutionPrinter.print(vrp, Solutions.bestOf(solutions), jsprit.core.reporting.SolutionPrinter.Print.VERBOSE);


    new Plotter(vrp, Solutions.bestOf(solutions)).plot("output/p08_solution.png", "p08");

View Full Code Here

    VehicleRoutingAlgorithm algorithm = new SchrimpfFactory().createAlgorithm(problem);
    
    /*
     * and search a solution
     */
    Collection<VehicleRoutingProblemSolution> solutions = algorithm.searchSolutions();
    
    /*
     * get the best 
     */
    VehicleRoutingProblemSolution bestSolution = Solutions.bestOf(solutions);

View Full Code Here

    VehicleRoutingProblem vrp = VehicleRoutingProblem.Builder.newInstance().setFleetSize(FleetSize.INFINITE).setRoutingCost(costMatrix)
        .addVehicle(vehicle).addJob(s1).addJob(s2).addJob(s3).build();
    
    VehicleRoutingAlgorithm vra = VehicleRoutingAlgorithms.readAndCreateAlgorithm(vrp, "input/fastAlgo.xml");
    
    Collection<VehicleRoutingProblemSolution> solutions = vra.searchSolutions();
    
    SolutionPrinter.print(Solutions.bestOf(solutions));
    
    new Plotter(vrp, Solutions.bestOf(solutions)).plot("output/yo.png", "po");

View Full Code Here

    VehicleRoutingAlgorithm algorithm = vraBuilder.build();
    
    /*
     * and search a solution
     */
    Collection<VehicleRoutingProblemSolution> solutions = algorithm.searchSolutions();
    
    /*
     * get the best 
     */
    VehicleRoutingProblemSolution bestSolution = Solutions.bestOf(solutions);

View Full Code Here

    /*
     * Solve the problem.
     * 
     *
     */
    Collection<VehicleRoutingProblemSolution> solutions = vra.searchSolutions();
    
    /*
     * Retrieve best solution.
     */
    VehicleRoutingProblemSolution solution = new SelectBest().selectSolution(solutions);

View Full Code Here

0 1 2 3 4 5

TOP

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.