Optimal routing of multimodal mobility systems with ride‐sharing

Yu, Xiao; Miao, Huimin; Bayram, Armagan; Yu, Meigui; Chen, Xi

doi:10.1111/itor.12870

Cited by 10 publications

(5 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In a recent study, [53] consider the combination of the ride-sharing and public transportation services and formulate a mixed integer programming model for the multimodal transportation planning problem. They propose a heuristic approach (i.e., angle-based clustering algorithm) and compare its efficiency with the exact solution for different settings.…”

Section: Clustering Methodsmentioning

confidence: 99%

Space-time clustering-based method to optimize shareability in real-time ride-sharing

et al. 2022

View full text Add to dashboard Cite

Real-time ride-sharing has become popular in recent years. However, the underlying optimization problem for this service is highly complex. One of the most critical challenges when solving the problem is solution quality and computation time, especially in large-scale problems where the number of received requests is huge. In this paper, we rely on an exact solving method to ensure the quality of the solution, while using AI-based techniques to limit the number of requests that we feed to the solver. More precisely, we propose a clustering method based on a new shareability function to put the most shareable trips inside separate clusters. Previous studies only consider Spatio-temporal dependencies to do clustering on the mobility service requests, which is not efficient in finding the shareable trips. Here, we define the shareability function to consider all the different sharing states for each pair of trips. Each cluster is then managed with a proposed heuristic framework in order to solve the matching problem inside each cluster. As the method favors sharing, we present the number of sharing constraints to allow the service to choose the number of shared trips. To validate our proposal, we employ the proposed method on the network of Lyon city in France, with half-million requests in the morning peak from 6 to 10 AM. The results demonstrate that the algorithm can provide high-quality solutions in a short time for large-scale problems. The proposed clustering method can also be used for different mobility service problems such as car-sharing, bike-sharing, etc.

show abstract

Section: Clustering Methodsmentioning

confidence: 99%

Space-time clustering-based method to optimize shareability in real-time ride-sharing

et al. 2022

View full text Add to dashboard Cite

show abstract

“…They combine a discrete-event simulation and a response surface methodology to optimise the train schedule with limited simulation runs. Yu et al (2021) study routing optimisation in a multimodal context for passengers. They propose a mixed integer programming model and a heuristic to find optimal routing with a combined use of ride sharing and public transport.…”

Section: Transportation Service Optimisation Through Passenger-orient...mentioning

confidence: 99%

“…Yu et al. (2021) study routing optimisation in a multimodal context for passengers. They propose a mixed integer programming model and a heuristic to find optimal routing with a combined use of ride sharing and public transport.…”

Section: Literature Reviewmentioning

confidence: 99%

An ILP approach for tactical flight rescheduling during airport access mode disruptions

Scozzaro,

Mancel,

Delahaye

et al. 2023

Int Trans Operational Res

View full text Add to dashboard Cite

Airport access mode disruptions, such as a subway shutdown, threaten the whole passenger door‐to‐door journey. When such a disruptive event occurs, knowledge of passengers' delays would help the airport operation centre to decide if a departure flight should be delayed. This paper proposes a tactical flight rescheduling at an airport to minimise the number of stranded passengers while considering operational constraints. An integer linear programming formulation of the problem is presented. Constraints such as terminal capacities, maximal runway throughput, minimum turnaround time or minimum transfer time for connecting passengers are considered. An exact and heuristic resolution is proposed and compared to a study case around Paris‐Charles de Gaulle airport. The new schedule satisfies the operational constraints and reduces up to 60% of the number of stranded passengers with moderate deviation from the initial planning.

show abstract

“…An Angle-based Clustering (AC) algorithm is proposed in [115] to solve both small and large settings of the integrated ridesharing and public transportation system by considering time constraints. The AC algorithm is developed based on three main stages.…”

Section: Heuristic and Metaheuristic Algorithms In Multi-modal Problemsmentioning

confidence: 99%

Shared Mobility Problems: A Systematic Review on Types, Variants, Characteristics, and Solution Approaches

et al. 2021

View full text Add to dashboard Cite

The Shared Mobility Problems (SMP) with the rideshare concept based on sharing a vehicle are fast becoming a trend in many urban cities around the world. Examples of these problems are like ridesharing, carpooling, taxisharing, buspooling, vanpooling, and multi-modal ridesharing. This is the new way to access transportation services by those who are propelling the sharing economy, where access rather than ownership is the new norm. This paper provides a systematic review of SMP using the PRISMA (Preferred Reporting Items for Systematic Reviews and Meta-Analysis) method. A total of 110 papers from the last decade are selected from 12 abstracts and citation databases to be reviewed and classified. This is done based on the problem types, variants, characteristics, and solution approaches. The current trends and analysis of the survey findings are also summarised. From this systematic review, it is observed that both the time window and multi-objective problems are popular among the researchers, while the minimisation of the total cost is the main concern in the literature of the SMP. Both static and dynamic cases of the SMP are the most researched where heuristic and metaheuristic approaches are widely adopted by the researchers in the literature. Finally, challenges and suggestions for future work are discussed and highlighted.

show abstract

Optimal routing of multimodal mobility systems with ride‐sharing

Cited by 10 publications

References 31 publications

Space-time clustering-based method to optimize shareability in real-time ride-sharing

Space-time clustering-based method to optimize shareability in real-time ride-sharing

An ILP approach for tactical flight rescheduling during airport access mode disruptions

Shared Mobility Problems: A Systematic Review on Types, Variants, Characteristics, and Solution Approaches

Contact Info

Product

Resources

About