-
Notifications
You must be signed in to change notification settings - Fork 456
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #3459 from matsim-org/pt-pseudonetwork-looplinks
Revert to old pseudo pt network creator
- Loading branch information
Showing
2 changed files
with
229 additions
and
41 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
153 changes: 153 additions & 0 deletions
153
matsim/src/main/java/org/matsim/pt/utils/CreatePseudoNetworkWithLoopLinks.java
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,153 @@ | ||
| /* *********************************************************************** * | ||
| * project: org.matsim.* | ||
| * CreatePseudoNetwork | ||
| * * | ||
| * *********************************************************************** * | ||
| * * | ||
| * copyright : (C) 2009 by the members listed in the COPYING, * | ||
| * LICENSE and WARRANTY file. * | ||
| * email : info at matsim dot org * | ||
| * * | ||
| * *********************************************************************** * | ||
| * * | ||
| * This program is free software; you can redistribute it and/or modify * | ||
| * it under the terms of the GNU General Public License as published by * | ||
| * the Free Software Foundation; either version 2 of the License, or * | ||
| * (at your option) any later version. * | ||
| * See also COPYING, LICENSE and WARRANTY file * | ||
| * * | ||
| * *********************************************************************** */ | ||
|
|
||
| package org.matsim.pt.utils; | ||
|
|
||
| import com.google.common.annotations.Beta; | ||
| import org.matsim.api.core.v01.Id; | ||
| import org.matsim.api.core.v01.TransportMode; | ||
| import org.matsim.api.core.v01.network.Link; | ||
| import org.matsim.api.core.v01.network.Network; | ||
| import org.matsim.api.core.v01.network.Node; | ||
| import org.matsim.core.population.routes.NetworkRoute; | ||
| import org.matsim.core.population.routes.RouteUtils; | ||
| import org.matsim.core.utils.collections.Tuple; | ||
| import org.matsim.core.utils.geometry.CoordUtils; | ||
| import org.matsim.pt.transitSchedule.api.*; | ||
|
|
||
| import java.util.*; | ||
|
|
||
| /** | ||
| * Builds a network where transit vehicles can drive along and assigns the correct | ||
| * links to the transit stop facilities and routes of transit lines. Each stop facility | ||
| * is assigned to a loop link, located in a node with the same coordinates as the stop. | ||
| * The stop facility ID is used for node and link IDs. | ||
| * | ||
| * @author mrieser, davibicudo | ||
| * | ||
| * @implNote THis functionality might be merged with {@link CreatePseudoNetwork}. | ||
| */ | ||
| @Beta | ||
| public class CreatePseudoNetworkWithLoopLinks { | ||
|
|
||
| private final TransitSchedule schedule; | ||
| private final Network network; | ||
| private final String prefix; | ||
| private final double linkFreeSpeed; | ||
| private final double linkCapacity; | ||
|
|
||
| private final Map<Tuple<Node, Node>, Link> links = new HashMap<>(); | ||
| private final Map<TransitStopFacility, Node> nodes = new HashMap<>(); | ||
|
|
||
| private final Set<String> transitModes = Collections.singleton(TransportMode.pt); | ||
|
|
||
| public CreatePseudoNetworkWithLoopLinks(final TransitSchedule schedule, final Network network, final String networkIdPrefix) { | ||
| this.schedule = schedule; | ||
| this.network = network; | ||
| this.prefix = networkIdPrefix; | ||
| this.linkFreeSpeed = 100.0 / 3.6; | ||
| this.linkCapacity = 100000.0; | ||
| } | ||
|
|
||
| public CreatePseudoNetworkWithLoopLinks(final TransitSchedule schedule, final Network network, final String networkIdPrefix, | ||
| final double linkFreeSpeed, final double linkCapacity) { | ||
| this.schedule = schedule; | ||
| this.network = network; | ||
| this.prefix = networkIdPrefix; | ||
| this.linkFreeSpeed = linkFreeSpeed; | ||
| this.linkCapacity = linkCapacity; | ||
| } | ||
|
|
||
| public void createNetwork() { | ||
|
|
||
| createStopNodesAndLoopLinks(); | ||
|
|
||
| List<Tuple<TransitLine, TransitRoute>> toBeRemoved = new LinkedList<>(); | ||
| for (TransitLine tLine : this.schedule.getTransitLines().values()) { | ||
| for (TransitRoute tRoute : tLine.getRoutes().values()) { | ||
| ArrayList<Id<Link>> routeLinks = new ArrayList<>(); | ||
| TransitRouteStop prevStop = null; | ||
| for (TransitRouteStop stop : tRoute.getStops()) { | ||
| if (prevStop != null) { | ||
| Link link = getNetworkLink(prevStop, stop); | ||
| routeLinks.add(link.getId()); | ||
| } | ||
| prevStop = stop; | ||
| } | ||
|
|
||
| if (!routeLinks.isEmpty()) { | ||
| NetworkRoute route = RouteUtils.createNetworkRoute(routeLinks); | ||
| tRoute.setRoute(route); | ||
| } else { | ||
| System.err.println("Line " + tLine.getId() + " route " + tRoute.getId() + " has less than two stops. Removing this route from schedule."); | ||
| toBeRemoved.add(new Tuple<>(tLine, tRoute)); | ||
| } | ||
| } | ||
| } | ||
|
|
||
| for (Tuple<TransitLine, TransitRoute> remove : toBeRemoved) { | ||
| remove.getFirst().removeRoute(remove.getSecond()); | ||
| } | ||
| } | ||
|
|
||
| private void createStopNodesAndLoopLinks() { | ||
| for (TransitStopFacility stop : this.schedule.getFacilities().values()) { | ||
| Node node = this.network.getFactory().createNode(Id.createNodeId(this.prefix + stop.getId()), stop.getCoord()); | ||
| this.network.addNode(node); | ||
| this.nodes.put(stop, node); | ||
|
|
||
| Link loopLink = this.network.getFactory().createLink(Id.createLinkId (this.prefix + stop.getId()), node, node); | ||
| stop.setLinkId(loopLink.getId()); | ||
| this.network.addLink(loopLink); | ||
| Tuple<Node, Node> connection = new Tuple<>(node, node); | ||
| this.links.put(connection, loopLink); | ||
| } | ||
| } | ||
|
|
||
| private Link getNetworkLink(final TransitRouteStop fromStop, final TransitRouteStop toStop) { | ||
| TransitStopFacility fromFacility = fromStop.getStopFacility(); | ||
| TransitStopFacility toFacility = toStop.getStopFacility(); | ||
|
|
||
| Node fromNode = this.nodes.get(fromFacility); | ||
| Node toNode = this.nodes.get(toFacility); | ||
|
|
||
| Tuple<Node, Node> connection = new Tuple<>(fromNode, toNode); | ||
| Link link = this.links.get(connection); | ||
| return link == null ? createAndAddLink(connection) : link; | ||
| } | ||
|
|
||
| private Link createAndAddLink(Tuple<Node, Node> connection) { | ||
| Node fromNode = connection.getFirst(); | ||
| Node toNode = connection.getSecond(); | ||
| Link link; | ||
| link = this.network.getFactory().createLink(Id.createLinkId(this.prefix + fromNode.getId() + "-" + toNode.getId()), fromNode, | ||
| toNode); | ||
| link.setLength(CoordUtils.calcEuclideanDistance(fromNode.getCoord(), toNode.getCoord())); | ||
|
|
||
| link.setFreespeed(linkFreeSpeed); | ||
| link.setCapacity(linkCapacity); | ||
| link.setNumberOfLanes(1); | ||
| this.network.addLink(link); | ||
| link.setAllowedModes(this.transitModes); | ||
| this.links.put(connection, link); | ||
| return link; | ||
| } | ||
|
|
||
| } |