arXiv subjects

Seyed Mehdi Meshkani

Publications and source records attributed to Seyed Mehdi Meshkani.

5 recordsLinked to original sources

arXiv2022

Distributed Ride-Matching for Shared Ridehailing Service with Intelligent City Infrastructure

High computational time is one of the most important operational issues in centralized dynamic shared ridehailing services. To resolve this issue, we propose a distributed ride-matching system that is based on vehicle to infrastructure (V2I) and infrastructure to infrastructure (I2I) communication. The application on downtown Toronto road network demonstrated that the distributed system resulted in a speed-up of 125 times in terms of computational time and showed high scalability. Moreover, the service rate in the proposed system improved by 7% compared to the centralized. However, the centralized system showed 29% and 17% improvement in wait time and detour time, respectively.

cs.DC↗

arXiv2021

A generalized ride-matching approach for sustainable shared mobility

On-demand shared mobility is a promising and sustainable transportation approach that can mitigate vehicle externalities, such as traffic congestion and emission. On-demand shared mobility systems require matching of one (one-to-one) or multiple riders (many-to-one) to a vehicle based on real-time information. We propose a novel Graph-based Many-to-One ride-Matching (GMOMatch) algorithm for the dynamic many-to-one matching problem in the presence of traffic congestion. GMOMatch, which is an iterative two-step method, provides high service quality and is efficient in terms of computational complexity. It starts with a one-to-one matching in Step 1 and is followed by solving a maximum weight matching problem in Step 2 to combine the travel requests. To evaluate the performance, it is compared with a ride-matching algorithm developed by Simonetto et al. (2019). Both algorithms are implemented in a micro-traffic simulator to assess their performance and their impact on traffic congestion in Downtown, Toronto road network. In comparison to the Simonetto, GMOMatch improved the service rate, vehicle kilometer traveled and traffic travel time by 32%, 16.07%, and 4%, respectively. The sensitivity analysis indicated that utilizing vehicles with a capacity of 10 can achieve 25% service rate improvement compared to a capacity of 4.

eess.SY↗

arXiv2021

Demand for shared mobility to complement public transportation: Human driven and autonomous vehicles

Recent advances in communication technologies and automated vehicles have opened doors for alternative mobility systems (taxis, carpool, demand-responsive services, peer-to-peer ridesharing, and car sharing, shared autonomous vehicles/shuttles). These new mobility services have gathered interest from researchers, public and private sectors as potential solutions to address last-mile problem--especially in low density areas where implementation of high frequency buses is not feasible. In this study we investigate the effects of ride-sharing service on travel demand and welfare, as it complements public transportation under different scenarios. Two types of management and vehicle types are considered: crowdsourced human driven vehicles (HDV) (e.g. Uber, Lyft) and centrally operated shared autonomous vehicles (SAV). The influence of fare discount on demand and mode shift is also investigated. A case study of Oakville road network in Ontario, Canada is conducted using real data. The results reveal that ride-sharing having the potential of increasing ridership by 76 per cent and decreasing wait time by 47 per cent under centrally operated shared autonomous vehicles with 50 per cent fare discount for sharing.

eess.SY↗

arXiv2021

Demand for shared mobility to replace private mobility using connected and automated vehicles

We examine how introduction of Shared Connected and Automated vehicles (SCAVs) as a new mobility mode could affect travel demand, welfare, as well as traffic congestion in the network. To do so, we adapt an agent-based day-to-day adjustment process and develop a central dispatching system, which is implemented on an in-house traffic microsimulator. We consider a two-sided market in which demand and SCAV fleet size change endogenously. For dispatching SCAV fleet size, we take changing traffic conditions into account. There are two available transport modes: private Connected Automated Vehicles (CAVs) and SCAVs. The designed system is applied on downtown Toronto network using real data. The results show that demand of SCAVs goes up by 43 per cent over seven study days from 670 trips on the first day to 959 trips on the seventh day. Whereas, there is a 10 per cent reduction in private CAV demand from 2807 trips to 2518 trips during the same duration. Moreover, total travel time of the network goes down by seven per cent indicating that traffic congestion was reduced in the network.

eess.SY↗

arXiv2020

Multimodal Autonomous Last Mile Delivery System Design and Application

With the rapid increase in congestion, alternative solutions are needed to efficiently use the capacity of our existing networks. This paper focuses on exploring the emerging autonomous technologies for on-demand food delivery in congested urban cities. Three different last mile food delivery systems are proposed in this study employing aerial and ground autonomous vehicles technologies. The three proposed systems are: robot delivery system, drone delivery system and a hybrid delivery system. In the hybrid system the concept of hub-and-spoke network is explored in order to consolidate orders and reach more destinations in less time. To investigate the performance of the three proposed delivery systems, they are applied to the city of Mississauga network, in an in-house agent-based simulation in MATLAB. 18 Scenarios are tested differing in terms of demand and fleet size. The results show that the hybrid robot-drone delivery system performs the best with a fleet side of 25 robots and 15 drones and with an average preparation and delivery time less than the individual robot and drone system by 48% and 42% respectively.

cs.CY↗