This repository has been archived by the owner on Nov 11, 2020. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 12
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Main new functionality: multi-dimensional regional analyses
- Loading branch information
Showing
85 changed files
with
33,441 additions
and
826 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
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
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,12 @@ | ||
# In-routing fare support | ||
|
||
Conveyal Analysis supports computing fares within the routing algorithm, which allows the routing algorithm to find not only the fastest path, but all Pareto-optimal tradeoffs between travel time and fare (the cheapest route is always to walk, unless free transit is available, so generally just finding the cheapest route is undesirable). For instance, here are the Pareto-optimal options for travel from Salem, Massachusetts to Copley Square in Boston: | ||
|
||
![Example Pareto surface for travel from Salem to Copley. The fastest option is to take the Newburyport/Rockport line followed by the Green Line. Slightly cheaper and quite a bit longer is to take the Newburyport/Rockport line followed by two buses. Much cheaper is an express bus followed by the green line, and cheapest is a bus to the blue line to the orange line. Each subsequent option takes longer than the last.](fareto.png) | ||
|
||
Finding cheapest paths is implemented in the McRAPTOR (multi-criteria RAPTOR) router, since this is a multi-objective optimization problem. Correctly finding cheapest paths is a challenging problem, due to discounted transfers. It may make sense to take a more expensive and/or slower option at the start of your trip, if it provides a discounted transfer to a service you will take later. However, since the router does not know what transit routes will be ridden in later rides, this presents a challenge. We introduce a "transfer allowance" that tracks these possible discounts; full details are available in [this IJGIS paper](https://files.indicatrix.org/Conway-Stewart-2019-Charlie-Fare-Constraints.pdf). | ||
|
||
Unfortunately, while there is a common data format for transit timetables (GTFS), no such format exists for fares. GTFS does include two different fare specifications (GTFS-fares and GTFS-fares v2), but they are not able to represent complex fare systems. As such, unless and until such a specification becomes available, Conveyal Analysis includes location-specific fare calculators for a number of locations around the world. They have their own documentation: | ||
|
||
- [New York](newyork.html) | ||
- Boston (documentation coming soon) |
Oops, something went wrong.