A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Filters
Optimal Online Dispatch for High-Capacity Shared Autonomous Mobility-on-Demand Systems
2021
2021 IEEE International Conference on Robotics and Automation (ICRA)
Preserved Fulltext
This paper presents a novel optimal schedule pool (OSP) assignment approach to optimally dispatch high-capacity ride-sharing vehicles in real time, including: (1) an incremental search algorithm that can ...
efficiently compute the exact lowestcost schedule of a ride-sharing trip with a reduced search space; (2) an iterative online re-optimization strategy to dynamically alter the assignment policy for new ...
IV-A). 2) Combine the optimal schedule search algorithm with the feasible trip search algorithm of [5] to generate all possible ride-sharing trips for each vehicle, along with the optimal schedule for ...
doi:10.1109/icra48506.2021.9561281
fatcat:jjo7d74ffzbf3nj4q5zjzyvqny
On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment
2017
Proceedings of the National Academy of Sciences of the United States of America
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This framework is general and can be used for many real-time multivehicle, multitask assignment problems. ride-sharing | human mobility | vehicle routing | smart cities | intelligent transportation systems ...
We present a more general mathematical model for real-time high-capacity ride-sharing that (i) scales to large numbers of passengers and trips and (ii) dynamically generates optimal routes with respect ...
We observe that a vehicle capacity of two is sufficient for ride-sharing when a small trip delay of 2 min is imposed. ...
doi:10.1073/pnas.1611675114
pmid:28049820
pmcid:PMC5255617
fatcat:shtyuotdpjhubf3nu6nujrr6ly
Space-time clustering-based method to optimize shareability in real-time ride-sharing
2022
PLoS ONE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Real-time ride-sharing has become popular in recent years. However, the underlying optimization problem for this service is highly complex. ...
Here, we define the shareability function to consider all the different sharing states for each pair of trips. ...
Matching algorithm for dynamic ride-sharing The matching algorithm aims to identify the travelers who can share their trips and assign them to a vehicle. ...
doi:10.1371/journal.pone.0262499
pmid:35030222
pmcid:PMC8759693
fatcat:vi7epzhewrgidgzlvjpdsx3pfi
Exact matching of attractive shared rides (ExMAS) for system-wide strategic evaluations
2020
Transportation Research Part B: Methodological
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We propose an exact, replicable and demand-, rather than supply-driven algorithm for matching trips into shared rides. ...
We apply the proposed algorithm in a series of experiments for the case of Amsterdam, where we perform a system-wide analysis of the ride-sharing performance in terms of both algorithm computations of ...
Table 4 Trip composition for different maximum vehicle capacities. Results of assigning 30 0 0 trips to rides optimal for travellers and vehicles with key indicators. ...
doi:10.1016/j.trb.2020.06.006
fatcat:k2izahte7vcarerlqomhxlkcyq
Can dynamic ride-sharing reduce traffic congestion?
2021
Transportation Research Part B: Methodological
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. ...
Likewise, for request 5 and vehicle d. Then for the remaining not-assigned trips, the main algorithm finds the best routes and assigns them to the vehicles in the nearest depots. ...
The assignment algorithm function.
Fig. 4 . 4 Fig. 4. Dynamic assignment.
Fig. 5 . 5 Fig. 5. Trip situations. ...
doi:10.1016/j.trb.2021.01.004
fatcat:udk6a5mt2vcstdpzquu3gfw7dm
Heuristics for Customer-focused Ride-pooling Assignment
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
By leveraging customer data, connected vehicles, and efficient assignment algorithms, ride-pooling can be a critical instrument to address driver shortages and mitigate the negative externalities of ride-hailing ...
In contrast, this paper examines heuristic methods for real-time ride-pooling assignments that are highly scalable and easily computable. ...
Regarding the conventional single-ride vehicle assignment (i.e., each vehicle is matched with one trip request), (16) revealed that a simple greedy assignment algorithm, in which requests are matched ...
arXiv:2107.11318v1
fatcat:meklaa2h4fgpzaeb7wcytpczxu
How Many Passengers Can We Serve with Ride-sharing?
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Existing literature did not consider ride-sharing with multi-request grouped in one trip. ...
Ride-sharing can reduce traffic congestion and thus reduce gas emissions and save travel time. ...
With ride-sharing, the driver involved in a trip can get more revenues without driving longer distance and passengers sharing a ride should pay less for this ride as they share their ride with others. ...
arXiv:1901.07906v1
fatcat:xrk7togna5fyzetezuuckal67y
Assignment and Pricing of Shared Rides in Ride-Sourcing using Combinatorial Double Auctions
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Our proposed algorithm could be used as a fast and reliable assignment and pricing mechanism of ride-sharing requests to vehicles during peak travel times. ...
To resolve this, we formulate a new shared-ride assignment and pricing algorithm using combinatorial double auctions. ...
an assignment duration interval ∆ of thirty seconds for the entire Manhattan shared ride market. ...
arXiv:1909.08608v2
fatcat:xxqd3djyl5byfknpqk3c73wsnm
A Dynamic Tree Algorithm for Peer-to-Peer Ride-sharing Matching
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
An efficient matching algorithm is essential to the success of a ride-sharing system. ...
Results show that the spatial distribution of ride-sharing participants influences the algorithm performance. ...
The original vehicle trips of matched ride-sharing passenger and driver are combined into ride-sharing vehicle
trips, i.e. their original vehicle trips are removed from the origin-destination matrix. ...
arXiv:2105.13078v1
fatcat:3cy3aiizofetxaherdpxwbpstq
Simulation and Analysis of a Demand Responsive, Automated Transit System
1975
Journal of Aircraft
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Upon finding and assigning a vehicle for the trip, a board time is assigned to the trip, based upon the expected vehicle arrival time. ...
It is interesting to notice that a great many shared rides are obtained using the shared ride algorithms in this simulation. ...
doi:10.2514/3.59871
fatcat:rnorcwlwqfcvxgrwsmuguou4ci
Highly scalable trip grouping for large-scale collective transportation systems
2008
Proceedings of the 11th international conference on Extending database technology Advances in database technology - EDBT '08
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In order to reduce traffic, recent work has proposed methods for vehicle sharing, for example for sharing cabs by grouping "closeby" cab requests and thus minimizing transportation cost and utilizing cab ...
However, the methods published so far do not scale to large data volumes, which is necessary to facilitate large-scale collective transportation systems, e.g., ride-sharing systems for large cities. ...
Assign remaining trip requests to their own (single person) "vehicle-shares". ...
doi:10.1145/1353343.1353425
dblp:conf/edbt/GidofalviPRZ08
fatcat:644jrkp4xncwbivlgxjo3ynge4
Highly scalable trip grouping for large-scale collective transportation systems
2008
Proceedings of the 11th international conference on Extending database technology Advances in database technology - EDBT '08
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In order to reduce traffic, recent work has proposed methods for vehicle sharing, for example for sharing cabs by grouping "closeby" cab requests and thus minimizing transportation cost and utilizing cab ...
However, the methods published so far do not scale to large data volumes, which is necessary to facilitate large-scale collective transportation systems, e.g., ride-sharing systems for large cities. ...
Assign remaining trip requests to their own (single person) "vehicle-shares". ...
doi:10.1145/1352431.1352513
fatcat:5ubzs6d4crbipd225j4zq62lrm
Efficient Algorithms for Stochastic Ridepooling Assignment with Mixed Fleets
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Ride-pooling, which accommodates multiple passenger requests in a single trip, has the potential to significantly increase fleet utilization in shared mobility platforms. ...
Two approximation algorithms for mid-capacity and high-capacity vehicles are proposed in this paper; The respective approximation ratios are 1/p^2 and e-1/(2e+o(1)) p ln p, where p is the maximum vehicle ...
Max-Min Online Algorithm for High-Capacity SRAMF The LSLPR algorithm is capable of assigning rides in shared mobility applications with midsize vehicles. ...
arXiv:2108.08651v2
fatcat:7t4tcoqrpzdn3aozuqsbuhlbgq
Human Satisfaction as the Ultimate Goal in Ridesharing
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
That is, we developed a practical algorithm for assigning passengers to vehicles, which outperforms assignment algorithms that are optimal, but use a simpler satisfaction model. ...
We argue that user satisfaction should be the main objective when trying to find the best assignment of passengers to vehicles and the determination of their routes. ...
The average satisfaction for a private trip was 5.01 and a shared ride was 4.41. ...
arXiv:1807.00376v1
fatcat:cpad7xw3zvbv7lsm4cqufzmw7e
Predictive routing for autonomous mobility-on-demand systems with ride-sharing
2017
2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Ride-sharing, or carpooling, systems with autonomous vehicles will provide efficient and reliable urban mobility on demand. ...
This method consists of three steps, namely pruning of feasible trips, assignment of trips to vehicles and rebalancing of idle vehicles. ...
Predictive Routing for Autonomous Mobility-on-Demand Systems with Ride-Sharing Javier Alonso-Mora * , † , Alex Wallar * and Daniela Rus * Abstract-Ride-sharing, or carpooling, systems with autonomous vehicles ...
doi:10.1109/iros.2017.8206203
dblp:conf/iros/Alonso-MoraWR17
fatcat:etrjy5wckvhcvbiblhluxahvty
« Previous
Showing results 1 — 15 out of 4,240 results