Examples of TrivialRemainingWeightHeuristic

org.opentripplanner.routing.algorithm.strategies.TrivialRemainingWeightHeuristic
A trivial heuristic that always returns 0, which is always admissible. For use in testing and troubleshooting. @author andrewbyrd

Examples of org.opentripplanner.routing.algorithm.strategies.TrivialRemainingWeightHeuristic


        runState.spt = new MultiShortestPathTree(runState.options);
        //runState.spt = new EarliestArrivalShortestPathTree(options); //MultiShortestPathTree(runState.options);


        runState.heuristic = options.batch ? 
                new TrivialRemainingWeightHeuristic() : runState.rctx.remainingWeightHeuristic; 


        // Since initial states can be multiple, heuristic cannot depend on the initial state.
        runState.heuristic.initialize(runState.options, runState.rctx.origin, runState.rctx.target,
                abortTime);
        if (abortTime < Long.MAX_VALUE  && System.currentTimeMillis() > abortTime) {

View Full Code Here

Examples of org.opentripplanner.routing.algorithm.strategies.TrivialRemainingWeightHeuristic

        origin = opt.arriveBy ? toVertex : fromVertex;
        originBackEdge = opt.arriveBy ? toBackEdge : fromBackEdge;
        target = opt.arriveBy ? fromVertex : toVertex;
        transferTable = graph.getTransferTable();
        if (opt.batch)
            remainingWeightHeuristic = new TrivialRemainingWeightHeuristic();
        else
            remainingWeightHeuristic = heuristicFactory.getInstanceForSearch(opt);


        // If any temporary half-street-edges were created, record the fact that they should
        // only be visible to the routing context we are currently constructing.

View Full Code Here

Examples of org.opentripplanner.routing.algorithm.strategies.TrivialRemainingWeightHeuristic


        LOG.debug("rreq={}", options);
        
        RemainingWeightHeuristic heuristic;
        if (options.disableRemainingWeightHeuristic) {
            heuristic = new TrivialRemainingWeightHeuristic();
        } else if (options.modes.isTransit()) {
            // Only use the BiDi heuristic for transit.
            heuristic = new InterleavedBidirectionalHeuristic(options.rctx.graph);
        } else {
            heuristic = new DefaultRemainingWeightHeuristic();

View Full Code Here

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.