../vignettes/accessibility.Rmd
accessibility.Rmd../vignettes/detailed_itineraries.Rmd
detailed_itineraries.RmdIn this example below, we want to know some alternative routes
between a single origin/destination pair. To get multiple route
alternatives, we need to set shortest_path = FALSE.
Note that in the example below we set
+suboptimal_minutes = 8. In this case, r5r will
+consider sub-optimal routes that arrive up to 10 minutes after the
+arrival of the optimal route.
# set inputs
origins <- poi[10,]
diff --git a/articles/faq.html b/articles/faq.html
index 6933ef16..08e3c200 100644
--- a/articles/faq.html
+++ b/articles/faq.html
@@ -111,7 +111,7 @@
FAQ - Frequently Asked Questions
- 2023-11-24
+ 2023-11-25
Source: ../vignettes/faq.Rmd
faq.Rmd
diff --git a/articles/fare_structure.html b/articles/fare_structure.html
index ba0dc4e0..4fb8930a 100644
--- a/articles/fare_structure.html
+++ b/articles/fare_structure.html
@@ -111,7 +111,7 @@
Accounting for monetary costs
- 2023-11-24
+ 2023-11-25
Source: ../vignettes/fare_structure.Rmd
fare_structure.Rmd
diff --git a/articles/isochrones.html b/articles/isochrones.html
index 7ae979f6..ce72114f 100644
--- a/articles/isochrones.html
+++ b/articles/isochrones.html
@@ -111,7 +111,7 @@
Isochrones
- 2023-11-24
+ 2023-11-25
Source: ../vignettes/isochrones.Rmd
isochrones.Rmd
diff --git a/articles/isochrones_files/figure-html/unnamed-chunk-6-1.png b/articles/isochrones_files/figure-html/unnamed-chunk-6-1.png
index eb24b46e..5b83a63c 100644
Binary files a/articles/isochrones_files/figure-html/unnamed-chunk-6-1.png and b/articles/isochrones_files/figure-html/unnamed-chunk-6-1.png differ
diff --git a/articles/pareto_frontier.html b/articles/pareto_frontier.html
index 6984b05e..1207d49b 100644
--- a/articles/pareto_frontier.html
+++ b/articles/pareto_frontier.html
@@ -112,7 +112,7 @@
Trade-offs between travel time and monetary
cost
- 2023-11-24
+ 2023-11-25
Source: ../vignettes/pareto_frontier.Rmd
pareto_frontier.Rmd
diff --git a/articles/r5r.html b/articles/r5r.html
index 41b74d21..f46b4bff 100644
--- a/articles/r5r.html
+++ b/articles/r5r.html
@@ -114,7 +114,7 @@ Intro to r5r: Rapid Realistic Routing with R5 in
Rafael H. M.
Pereira, Marcus Saraiva, Daniel Herszenhut, Carlos Kaue Braga
- 2023-11-24
+ 2023-11-25
Source: ../vignettes/r5r.Rmd
r5r.Rmd
@@ -341,12 +341,12 @@ Data
points <- points[ sampled_rows, ]
head(points)
#> id lon lat population schools jobs healthcare
-#> 1: 89a90129d77ffff -51.19362 -30.02586 1318 0 206 0
-#> 2: 89a90e9269bffff -51.19262 -30.00097 269 0 311 0
-#> 3: 89a9012806bffff -51.18902 -30.06232 1194 0 181 0
-#> 4: 89a901284c7ffff -51.19334 -30.09384 362 0 0 0
-#> 5: 89a9012a343ffff -51.20867 -30.09669 0 0 0 0
-#> 6: 89a90128633ffff -51.18054 -30.07830 0 0 0 0
+#> 1: 89a9012b13bffff -51.17823 -30.09652 97 0 18 0
+#> 2: 89a90128107ffff -51.21922 -30.05697 1550 0 56 0
+#> 3: 89a90129963ffff -51.18975 -30.00537 456 0 388 0
+#> 4: 89a90129d7bffff -51.18756 -30.02638 1970 1 637 0
+#> 5: 89a9012ae6bffff -51.23225 -30.07804 159 0 30 1
+#> 6: 89a9012806bffff -51.18902 -30.06232 1194 0 181 0
4.1 Building routable transport network with
@@ -388,12 +388,12 @@ 4.2 Accessibility analysis )
head(access)
#> id opportunity percentile cutoff accessibility
-#> 1: 89a90129d77ffff schools 50 60 30
-#> 2: 89a90129d77ffff healthcare 50 60 23
-#> 3: 89a90e9269bffff schools 50 60 26
-#> 4: 89a90e9269bffff healthcare 50 60 23
-#> 5: 89a9012806bffff schools 50 60 35
-#> 6: 89a9012806bffff healthcare 50 60 25
+#> 1: 89a9012b13bffff schools 50 60 16
+#> 2: 89a9012b13bffff healthcare 50 60 18
+#> 3: 89a90128107ffff schools 50 60 32
+#> 4: 89a90128107ffff healthcare 50 60 31
+#> 5: 89a90129963ffff schools 50 60 34
+#> 6: 89a90129963ffff healthcare 50 60 26../vignettes/time_window.Rmd
time_window.Rmdps. Please keep in mind that the time_window only
-affects the results when the GTFS feeds contain a
-frequencies.txt table.
ps. Please keep in mind that the Monte Carlo draws in
+time_window only affects the results when the GTFS feeds
+contain a frequencies.txt table.
time_window.
@@ -255,14 +255,14 @@ time_windo
cutoffs = 45,
departure_datetime = departure_datetime,
progress = FALSE,
- time_window = 30,
+ time_window = 60,
percentiles = c(10, 20, 50, 70, 80)
)
head(acc, n = 10)
#> id opportunity percentile cutoff accessibility
#> 1: 89a8100c603ffff schools 10 45 13
-#> 2: 89a8100c603ffff schools 20 45 11
+#> 2: 89a8100c603ffff schools 20 45 13
#> 3: 89a8100c603ffff schools 50 45 6
#> 4: 89a8100c603ffff schools 70 45 6
#> 5: 89a8100c603ffff schools 80 45 6
@@ -316,7 +316,7 @@ 3.3 Travel time matrix with
max_trip_duration = max_trip_duration,
departure_datetime = departure_datetime,
progress = TRUE,
- time_window = 20,
+ time_window = 60,
percentiles = c(10, 20, 50, 70, 80)
)
@@ -388,16 +388,45 @@ 3.4 Expanded travel time
#> 9: 89a8100c603ffff 89a8100c28bffff 14:01:00 4 4491-10
#> 10: 89a8100c603ffff 89a8100c28bffff 14:01:00 5 4491-10
#> total_time
-#> 1: 53.8
-#> 2: 37.3
-#> 3: 38.1
-#> 4: 42.2
-#> 5: 34.7
-#> 6: 45.8
-#> 7: 43.6
-#> 8: 37.2
-#> 9: 40.5
-#> 10: 43.8
time_window.
+In the detailed_itineraries() function, the number of
+Monte Carlo draws per minute is hardcoded to 1. This means that the
+function simulates only one departure per minute within the
+time_window. So if you set a time_window of 10
+minutes, it would simulate 10 departures, one in each minute. This is
+largely because the time_window behaves slightly
+differently here.
See, functions like travel_time_matrix() or
+accessibility(), for example, return estimates of travel
+times or accessibility. In these cases, when we use the
+time_window parameter, these functions output selected
+percentiles of those values generated based on the distribution of all
+estimates that result from the multiple trip simulations.
The detailed_itineraries(), on the other hand, does not
+return travel times or accessibility estimates. It returns alternatives
+of trip journeys. In this case, when we use the time_window
+parameter, the function will return the optimal trip itinerary found
+within the time window. It can also return the optimal route along with
+multiple sub-optimal journey alternatives found within the time window
+if the the user sets shortest_path = FALSE.
obs. Mind you that detailed_itineraries()
+cannot be computed for public transport trips if the the network uses a
+frequencies-based GTFS feed. In these cases, we suggest using
+gtfstools::frequencies_to_stop_times() to create a suitable
+feed.
../vignettes/travel_time_matrix.Rmd
travel_time_matrix.Rmdmax_bike_time to make it clear that in bicycle-only trips, whenever max_bike_time differs from max_trip_duration, the lowest value is considered. Closes #353
Bug Fixes - Fixed bug that prevented the using the output_dirparameter in the detailed_itineraries(all_to_all = TRUE) function. Closes #327 with a contribution (PR #354) from Luyu Liu.
suboptimal_minutes in the detailed_itineraries() function.detailed_itineraries() function.Bug Fixes - Fixed bug that prevented the using the output_dir parameter in the detailed_itineraries(all_to_all = TRUE) function. Closes #327 with a contribution (PR #354) from Luyu Liu. - Fixed bug that prevented detailed_itineraries from working with frequency-based GTFS feeds. It should ONLY work with frequency-based GTFS feeds.
New contributors to r5r - Luyu Liu
A number. The difference in minutes that each non-optimal RAPTOR branch can have from the optimal branch without being -disregarded by the routing algorithm. This argument emulates the real-life -behaviour that makes people want to take a path that is technically not -optimal (in terms of travel time, for example) for some practical reasons -(e.g. mode preference, safety, etc). In practice, the higher this value, -the more itineraries will be returned in the final result.
suboptimal_minutes = 10, the routing algorithm will consider sub-optimal
+routes that arrive up to 10 minutes after the arrival of the optimal one.
+This argument emulates the real-life behaviour that makes people want to
+take a path that is technically not optimal in terms of travel time, for
+example, for some practical reasons (e.g. mode preference, safety, etc).
+In practice, the higher this value, the more itineraries will be returned
+in the final result.