org.matsim.pt.UmlaufInterpolator Class Reference

Public Member Functions
	UmlaufInterpolator (Network network, final ScoringConfigGroup config)
void	addUmlaufStueckToUmlauf (UmlaufStueckI umlaufStueck, Umlauf umlauf)

Private Member Functions
void	insertWenden (Id< Link > fromLinkId, Id< Link > toLinkId, Umlauf umlauf)

Private Attributes
final Network	network
final LeastCostPathCalculator	routingAlgo

Detailed Description

Definition at line 39 of file UmlaufInterpolator.java.

Constructor & Destructor Documentation

UmlaufInterpolator()

org.matsim.pt.UmlaufInterpolator.UmlaufInterpolator	(	Network	network,
		final ScoringConfigGroup	config
	)

Definition at line 44 of file UmlaufInterpolator.java.

References org.matsim.core.router.DijkstraFactory.createPathCalculator(), and org.matsim.pt.UmlaufInterpolator.network.

                                                                                {
        super();
        this.network = network;
        FreespeedTravelTimeAndDisutility travelTimes = new FreespeedTravelTimeAndDisutility(config);
        this.routingAlgo = new DijkstraFactory().createPathCalculator(network, travelTimes, travelTimes);
    }

Here is the call graph for this function:

Member Function Documentation

addUmlaufStueckToUmlauf()

void org.matsim.pt.UmlaufInterpolator.addUmlaufStueckToUmlauf	(	UmlaufStueckI	umlaufStueck,
		Umlauf	umlauf
	)

(also make sure that they are physically connected on the network)

Definition at line 54 of file UmlaufInterpolator.java.

References org.matsim.api.core.v01.Id< T >.equals(), org.matsim.pt.UmlaufStueckI.getCarRoute(), org.matsim.api.core.v01.population.Route.getEndLinkId(), org.matsim.api.core.v01.population.Route.getStartLinkId(), org.matsim.pt.Umlauf.getUmlaufStuecke(), and org.matsim.pt.UmlaufInterpolator.insertWenden().

                                                                                   {
        List<UmlaufStueckI> existingUmlaufStuecke = umlauf.getUmlaufStuecke();

        // check if final link of last umlaufStueck and first link of new umlaufStueck are connected; otherwise compute and insert connecting route:
        if (! existingUmlaufStuecke.isEmpty()) {
            UmlaufStueckI previousUmlaufStueck = existingUmlaufStuecke.get(existingUmlaufStuecke.size() - 1);
            NetworkRoute previousCarRoute = previousUmlaufStueck.getCarRoute();
            Id<Link> fromLinkId = previousCarRoute.getEndLinkId();
            Id<Link> toLinkId = umlaufStueck.getCarRoute().getStartLinkId();
            if (!fromLinkId.equals(toLinkId)) {
                insertWenden(fromLinkId, toLinkId, umlauf);
            }
        }

        existingUmlaufStuecke.add(umlaufStueck);
    }

Here is the call graph for this function:

insertWenden()

void org.matsim.pt.UmlaufInterpolator.insertWenden ( Id< Link >  fromLinkId, Id< Link >  toLinkId, Umlauf  umlauf  )

private

Definition at line 71 of file UmlaufInterpolator.java.

References org.matsim.core.router.util.LeastCostPathCalculator.calcLeastCostPath(), and org.matsim.api.core.v01.network.Network.getLinks().

Referenced by org.matsim.pt.UmlaufInterpolator.addUmlaufStueckToUmlauf().

                                                                                     {
        Node startNode = this.network.getLinks().get(fromLinkId).getToNode();
        Node endNode = this.network.getLinks().get(toLinkId).getFromNode();
        double depTime = 0.0;
        Path wendenPath = routingAlgo.calcLeastCostPath(startNode, endNode, depTime, null, null);
        if (wendenPath == null) {
            throw new RuntimeException("No route found from node "
                                   + startNode.getId() + " to node " + endNode.getId() + ".");
        }
        NetworkRoute route = RouteUtils.createLinkNetworkRouteImpl(fromLinkId, toLinkId);
        route.setLinkIds(fromLinkId, NetworkUtils.getLinkIds(wendenPath.links), toLinkId);
        umlauf.getUmlaufStuecke().add(new Wenden(route));
    }

Here is the call graph for this function:

Member Data Documentation

network

final Network org.matsim.pt.UmlaufInterpolator.network

private

Definition at line 41 of file UmlaufInterpolator.java.

Referenced by org.matsim.pt.UmlaufInterpolator.UmlaufInterpolator().

routingAlgo

final LeastCostPathCalculator org.matsim.pt.UmlaufInterpolator.routingAlgo

private

Definition at line 42 of file UmlaufInterpolator.java.

---

The documentation for this class was generated from the following file:

• pt/UmlaufInterpolator.java