English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Due to limited transit network coverage and infrequent service, suburbancommuters often face the transit first mile/last mile (FMLM) problem. To dealwith this, they either drive to a park-and-ride location to take transit, usecarpooling, or drive directly to their destination to avoid inconvenience.Ridesharing, an emerging mode of transportation, can solve the transit firstmile/last mile problem. In this setup, a driver can drive a ride-seeker to atransit station, from where the rider can take transit to her respectivedestination. The problem requires solving a ridesharing matching problem withthe routing of riders in a multimodal transportation network. We develop atransit-based ridesharing matching algorithm to solve this problem. The methodleverages the schedule-based transit shortest path to generate feasible matchesand then solves a matching optimization program to find an optimal matchbetween riders and drivers. The proposed method not only assigns an optimaldriver to the rider but also assigns an optimal transit stop and a transitvehicle trip departing from that stop for the rest of the rider's itinerary. Wealso introduce the application of space-time prism (STP) (the geographical areawhich can be reached by a traveler given the time constraints) in the contextof ridesharing to reduce the computational time by reducing the network search.An algorithm to solve this problem dynamically using a rolling horizon approachis also presented. We use simulated data obtained from the activity-basedtravel demand model of Twin Cities, MN to show that the transit-basedridesharing can solve the FMLM problem and save a significant number ofvehicle-hours spent in the system.

An algorithm for integrating peer-to-peer ridesharing and schedule-based transit system for first mile/last mile access