Adaptive Park-and-ride Choice on Time-dependent Stochastic Multimodal Transportation Network

2021 ◽  
Author(s):  
Pramesh Kumar ◽  
Alireza Khani
Keyword(s):  
Transportation Network ◽  
Time Dependent ◽  
Multimodal Transportation ◽  
Park And Ride

scholarly journals A new time-dependent shortest path algorithm for multimodal transportation network

2017 ◽  
Vol 109 ◽  
pp. 692-697 ◽  
Author(s):  
Abdelfattah Idri ◽  
Mariyem Oukarfi ◽  
Azedine Boulmakoul ◽  
Karine Zeitouni ◽  
Ali Masri
Keyword(s):  
Shortest Path ◽  
Transportation Network ◽  
Time Dependent ◽  
Shortest Path Algorithm ◽  
Multimodal Transportation ◽  
New Time

Time-Dependent Intermodal A* Algorithm: Methodology and Implementation on a Large-Scale Network

2018 ◽  
Vol 2672 (47) ◽  
pp. 219-230 ◽  
Author(s):  
Ömer Verbas ◽  
Joshua Auld ◽  
Hubert Ley ◽  
Randy Weimer ◽  
Shon Driscoll
Keyword(s):  
Large Scale ◽  
Vehicular Network ◽  
Upper Bounds ◽  
Time Dependent ◽  
Regional Network ◽  
A Algorithm ◽  
Transit Network ◽  
Park And Ride ◽  
Large Scale Network ◽  
Scale Network

This paper proposes a time-dependent intermodal A* (TDIMA*) algorithm. The algorithm works on a multimodal network with transit, walking, and vehicular network links, and finds paths for the three major modes (transit, walking, driving) and any feasible combination thereof (e.g., park-and-ride). Turn penalties on the vehicular network and progressive transfer penalties on the transit network are considered for improved realism. Moreover, upper bounds to prevent excessive waiting and walking are introduced, as well as an upper bound on driving for the park-and-ride (PNR) mode. The algorithm is validated on the large-scale Chicago Regional network using real-world trips against the Google Directions API and the Regional Transit Authority router.

scholarly journals Modeling the Multicommodity Multimodal Routing Problem with Schedule-Based Services and Carbon Dioxide Emission Costs

2015 ◽  
Vol 2015 ◽  
pp. 1-21 ◽  
Author(s):  
Yan Sun ◽  
Maoxiang Lang
Keyword(s):  
Carbon Dioxide ◽  
Carbon Dioxide Emissions ◽  
Transportation Network ◽  
Linearization Method ◽  
Mixed Integer ◽  
Multicommodity Flow ◽  
Routing Problem ◽  
Multimodal Transportation ◽  
Proposed Model ◽  
Freight Routing

We explore a freight routing problem wherein the aim is to assign optimal routes to move commodities through a multimodal transportation network. This problem belongs to the operational level of service network planning. The following formulation characteristics will be comprehensively considered: (1) multicommodity flow routing; (2) a capacitated multimodal transportation network with schedule-based rail services and time-flexible road services; (3) carbon dioxide emissions consideration; and (4) a generalized costs optimum oriented to customer demands. The specific planning of freight routing is thus defined as a capacitated time-sensitive multicommodity multimodal generalized shortest path problem. To solve this problem systematically, we first establish a node-arc-based mixed integer nonlinear programming model that combines the above formulation characteristics in a comprehensive manner. Then, we develop a linearization method to transform the proposed model into a linear one. Finally, a computational experiment from the Chinese inland container export business is presented to demonstrate the feasibility of the model and linearization method. The computational results indicate that implementing the proposed model and linearization method in the mathematical programming software Lingo can effectively solve the large-scale practical multicommodity multimodal transportation routing problem.

Hybrid Simulation to Support Interdependence Modeling of a Multimodal Transportation Network

2019 ◽  
Author(s):  
Tarana Bipasha ◽  
Jose Azucena ◽  
Basem Alkhaleel ◽  
Haitao Liao ◽  
Heather Nachtmann
Keyword(s):  
Transportation Network ◽  
Hybrid Simulation ◽  
Multimodal Transportation
Sign in / Sign up

Export Citation Format

Share Document