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

    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

//        algorithm.setPrematureAlgorithmTermination(prematureAlgorithmTermination);
//        algorithm.addListener(prematureAlgorithmTermination);
//    algorithm.addListener(new AlgorithmSearchProgressChartListener("output/progress.png"));


        //search
    Collection<VehicleRoutingProblemSolution> solutions = algorithm.searchSolutions();
    
    //this is just to ensure that solution meet the above constraints
    validateSolution(Solutions.bestOf(solutions), bicycleMessengerProblem, nearestMessengers);


        SolutionPrinter.print(bicycleMessengerProblem, Solutions.bestOf(solutions), SolutionPrinter.Print.VERBOSE);

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.