No Transfers Required: Integrating Last Mile with Public Transit Using
Opti-Mile
- URL: http://arxiv.org/abs/2306.15943v2
- Date: Tue, 28 Nov 2023 13:26:35 GMT
- Title: No Transfers Required: Integrating Last Mile with Public Transit Using
Opti-Mile
- Authors: Raashid Altaf, Pravesh Biyani
- Abstract summary: We propose opti-mile," a novel trip planning approach that combines last-mile services with public transit such that no transfers are required.
We demonstrate that opti-mile trips lead to a 10% reduction in distance travelled for 18% increase in price compared to traditional shortest paths.
- Score: 3.073046540587735
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Public transit is a popular mode of transit due to its affordability, despite
the inconveniences due to the necessity of transfers required to reach most
areas. For example, in the bus and metro network of New Delhi, only 30% of
stops can be directly accessed from any starting point, thus requiring
transfers for most commutes. Additionally, last-mile services like rickshaws,
tuk-tuks or shuttles are commonly used as feeders to the nearest public transit
access points, which further adds to the complexity and inefficiency of a
journey. Ultimately, users often face a tradeoff between coverage and transfers
to reach their destination, regardless of the mode of transit or the use of
last-mile services. To address the problem of limited accessibility and
inefficiency due to transfers in public transit systems, we propose
``opti-mile," a novel trip planning approach that combines last-mile services
with public transit such that no transfers are required. Opti-mile allows users
to customise trip parameters such as maximum walking distance, and acceptable
fare range. We analyse the transit network of New Delhi, evaluating the
efficiency, feasibility and advantages of opti-mile for optimal multi-modal
trips between randomly selected source-destination pairs. We demonstrate that
opti-mile trips lead to a 10% reduction in distance travelled for 18% increase
in price compared to traditional shortest paths. We also show that opti-mile
trips provide better coverage of the city than public transit, without a
significant fare increase.
Related papers
- Optimal Ground Station Selection for Low-Earth Orbiting Satellites [36.896695278624776]
This paper presents a solution to the problem of optimal ground station selection for low-Earth orbiting (LEO) space missions.
It enables mission operators to precisely design their ground segment performance and costs.
arXiv Detail & Related papers (2024-10-04T22:48:50Z) - Mahalanobis Distance-based Multi-view Optimal Transport for Multi-view Crowd Localization [50.69184586442379]
We propose a novel Mahalanobis distance-based multi-view optimal transport loss specifically designed for multi-view crowd localization.
Experiments demonstrate the advantage of the proposed method over density map-based or common Euclidean distance-based optimal transport loss.
arXiv Detail & Related papers (2024-09-03T09:10:51Z) - Fair collaborative vehicle routing: A deep multi-agent reinforcement
learning approach [49.00137468773683]
Collaborative vehicle routing occurs when carriers collaborate through sharing their transportation requests and performing transportation requests on behalf of each other.
Traditional game theoretic solution concepts are expensive to calculate as the characteristic function scales exponentially with the number of agents.
We propose to model this problem as a coalitional bargaining game solved using deep multi-agent reinforcement learning.
arXiv Detail & Related papers (2023-10-26T15:42:29Z) - Sustainability Analysis Framework for On-Demand Public Transit Systems [5.172508424953869]
There is an increased interest from transit agencies to replace fixed-route transit services with on-demand public transits (ODT)
We provide a comprehensive framework for assessing the sustainability of ODT systems from the perspective of overall efficiency, environmental footprint, and social equity and inclusion.
The proposed framework is illustrated by applying it to the Town of Innisfil, Ontario, where an ODT system has been implemented since 2017.
arXiv Detail & Related papers (2023-03-10T16:09:51Z) - Equity Scores for Public Transit Lines from Open-Data and Accessibility
Measures [0.3058685580689604]
Current transit suffers from an evident inequity: the level of service of transit in suburbs is much less satisfying than in city centers.
To achieve sustainability goals and reduce car-dependency, transit should be (re)designed around equity.
arXiv Detail & Related papers (2022-09-30T22:58:11Z) - Incentivizing Routing Choices for Safe and Efficient Transportation in
the Face of the COVID-19 Pandemic [14.943238230772264]
We propose to use financial incentives to set the tradeoff between risk of infection and congestion to achieve safe and efficient transportation networks.
For our framework to be useful in various cities and times of the day without much designer effort, we also propose a data-driven approach to learn human preferences about transport options.
arXiv Detail & Related papers (2020-12-28T13:52:06Z) - FlexPool: A Distributed Model-Free Deep Reinforcement Learning Algorithm
for Joint Passengers & Goods Transportation [36.989179280016586]
This paper considers combining passenger transportation with goods delivery to improve vehicle-based transportation.
We propose FlexPool, a distributed model-free deep reinforcement learning algorithm that jointly serves passengers & goods workloads.
We show that FlexPool achieves 30% higher fleet utilization and 35% higher fuel efficiency in comparison to model-free approaches.
arXiv Detail & Related papers (2020-07-27T17:25:58Z) - Polestar: An Intelligent, Efficient and National-Wide Public
Transportation Routing Engine [43.09401975244128]
We present Polestar, a data-driven engine for intelligent and efficient public transportation routing.
Specifically, we first propose a novel Public Transportation Graph (PTG) to model public transportation system in terms of various travel costs.
We then introduce a general route search algorithm coupled with an efficient station binding method for efficient route candidate generation.
Experiments on two real-world data sets demonstrate the advantages of Polestar in terms of both efficiency and effectiveness.
arXiv Detail & Related papers (2020-07-11T05:14:52Z) - Equitable and Optimal Transport with Multiple Agents [48.17429789586127]
We introduce an extension of the Optimal Transport problem when multiple costs are involved.
We aim to share equally between agents the work of transporting one distribution to another.
Another point of view is when the goal is to partition equitably goods between agents according to their heterogeneous preferences.
arXiv Detail & Related papers (2020-06-12T15:15:41Z) - Minimizing Energy Use of Mixed-Fleet Public Transit for Fixed-Route
Service [7.2775693810940565]
We present an integer program for optimal assignment and scheduling, and we propose meta-heuristic algorithms for larger networks.
For Chattanooga, the proposed algorithms can save $145,635 in energy costs and 576.7 metric tons of CO2 emission annually.
arXiv Detail & Related papers (2020-04-10T17:45:14Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.