Mode choice and ride-pooling simulation: A comparison of mobiTopp, Fleetpy, and MATSim

On-demand ride-pooling systems have gained a lot of attraction in the past years as they promise to reduce traffic and vehicle fleets compared to private vehicles. Transport simulations show that automation of vehicles and resulting fare reductions enable large-scale ride-pooling systems to have a high potential to drastically change urban transportation. For a realistic simulation of the new transport mode it is essential to model the interplay of ride-pooling demand and supply. Hence, these simulations should incorporate (1) a mode choice model to measure demand levels and (2) a dynamic model of the on-demand ride-pooling system to measure the service level and fleet performance. We compare two different simulation frameworks that both incorporate both aspects and compare their results with an identical input. It is shown that both systems are capable of generating realistic results and assessing mode choice and ride-pooling schemes. Commonalities and differences are identified and discussed

Dynamic carpooling in urban areas: design and experimentation with a multi-objective route matching algorithm

This paper focuses on dynamic carpooling services in urban areas to address the needs of mobility in real-time by proposing a two-fold contribution: a solution with novel features with respect to the current state-of-the-art, which is named CLACSOON and is available on the market; the analysis of the carpooling services performance in the urban area of the city of Cagliari through emulations. Two new features characterize the proposed solution: partial ridesharing, according to which the riders can walk to reach the driver along his/her route when driving to the destination; the possibility to share the ride when the driver has already started the ride by modeling the mobility to reach the driver destination. To analyze which features of the population bring better performance to changing the characteristics of the users, we also conducted emulations. When compared with current solutions, CLACSOON allows for achieving a decrease in the waiting time of around 55% and an increase in the driver and passenger success rates of around 4% and 10%, respectively. Additionally, the proposed features allowed for having an increase in the reduction of the CO2 emission by more than 10% with respect to the traditional carpooling service

Implementation of connection scan algorithm in tourism intermodal transportation journey planner: a case study

Accessibility to tourist destinations is an important component in a tourism system, especially for natural tourist destinations located in suburban areas. Good linkage of travel information and physical connections with local transportation services for intercity travel can facilitate more people to travel and promote national tourism destinations. This research takes the popular national tourism destinations and their public transportation service in Taiwan as a research object due to the unavailability of integrated public transport information service. Free Independent Travelers (FIT) demand is growing. This research aims to integrate intermodal public transportation information to support FIT by proposing a seamless way journey planner. In this scenario, the journey planner requires timetable data as input. The Connection Scan Algorithm is used to find the earliest arrival time routes at their destinations. This journey planner is built in PHP language and can complement the official tourism travel information website by Tourism Bureau, MOTC. Hence, the FIT could get the quickest routes to reach the destinations without compiling the public transportation information provided independently

Real-Time Traffic Assignment Using Fast Queries in Customizable Contraction Hierarchies

Given an urban road network and a set of origin-destination (OD) pairs, the traffic assignment problem asks for the traffic flow on each road segment. A common solution employs a feasible-direction method, where the direction-finding step requires many shortest-path computations. In this paper, we significantly accelerate the computation of flow patterns, enabling interactive transportation and urban planning applications. We achieve this by revisiting and carefully engineering known speedup techniques for shortest paths, and combining them with customizable contraction hierarchies. In particular, our accelerated elimination tree search is more than an order of magnitude faster for local queries than the original algorithm, and our centralized search speeds up batched point-to-point shortest paths by a factor of up to 6. These optimizations are independent of traffic assignment and can be generally used for (batched) point-to-point queries. In contrast to prior work, our evaluation uses real-world data for all parts of the problem. On a metropolitan area encompassing more than 2.7 million inhabitants, we reduce the flow-pattern computation for a typical two-hour morning peak from 76.5 to 10.5 seconds on one core, and 4.3 seconds on four cores. This represents a speedup of 18 over the state of the art, and three orders of magnitude over the Dijkstra-based baseline