skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

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

Abstract

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.

Authors:
; ; ; ;
Publication Date:
Research Org.:
Argonne National Lab. (ANL), Argonne, IL (United States)
Sponsoring Org.:
U.S. Department of Transportation - Federal Transit Administration
OSTI Identifier:
1493589
DOE Contract Number:  
AC02-06CH11357
Resource Type:
Conference
Resource Relation:
Conference: 97th Annual Meeting of the Transportation Research Board, 01/07/18 - 01/11/18, Washington, DC, US
Country of Publication:
United States
Language:
English

Citation Formats

Verbas, Omer, Auld, Joshua, Ley, Hubert, Weimer, Randy, and Driscoll, Shon. A Time-Dependent Intermodal A* Algorithm: Methodology and Implementation on a Large-Scale Network. United States: N. p., 2018. Web. doi:10.1177/0361198118796402.
Verbas, Omer, Auld, Joshua, Ley, Hubert, Weimer, Randy, & Driscoll, Shon. A Time-Dependent Intermodal A* Algorithm: Methodology and Implementation on a Large-Scale Network. United States. doi:10.1177/0361198118796402.
Verbas, Omer, Auld, Joshua, Ley, Hubert, Weimer, Randy, and Driscoll, Shon. Thu . "A Time-Dependent Intermodal A* Algorithm: Methodology and Implementation on a Large-Scale Network". United States. doi:10.1177/0361198118796402.
@article{osti_1493589,
title = {A Time-Dependent Intermodal A* Algorithm: Methodology and Implementation on a Large-Scale Network},
author = {Verbas, Omer and Auld, Joshua and Ley, Hubert and Weimer, Randy and Driscoll, Shon},
abstractNote = {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.},
doi = {10.1177/0361198118796402},
journal = {},
number = ,
volume = ,
place = {United States},
year = {2018},
month = {10}
}

Conference:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share:

Works referenced in this record:

Schedule-based transit assignment model with vehicle capacity and seat availability
journal, December 2011

  • Hamdouch, Younes; Ho, H. W.; Sumalee, Agachai
  • Transportation Research Part B: Methodological, Vol. 45, Issue 10
  • DOI: 10.1016/j.trb.2011.07.010

The shortest route through a network with time-dependent internodal transit times
journal, June 1966


Equilibrium traffic assignment for large scale transit networks
journal, November 1988


A note on two problems in connexion with graphs
journal, December 1959


Common-Lines and Passenger Assignment in Congested Transit Networks
journal, August 2001


Timetable-Based Transit Assignment Using Branch and Bound Techniques
journal, January 2001

  • Friedrich, Markus; Hofsaess, Ingmar; Wekeck, Steffen
  • Transportation Research Record: Journal of the Transportation Research Board, Vol. 1752, Issue 1
  • DOI: 10.3141/1752-14

A bi-criterion dynamic user equilibrium traffic assignment model and solution algorithm for evaluating dynamic road pricing strategies
journal, August 2008

  • Lu, Chung-Cheng; Mahmassani, Hani S.; Zhou, Xuesong
  • Transportation Research Part C: Emerging Technologies, Vol. 16, Issue 4
  • DOI: 10.1016/j.trc.2007.08.002

On a routing problem
journal, January 1958

  • Bellman, Richard
  • Quarterly of Applied Mathematics, Vol. 16, Issue 1
  • DOI: 10.1090/qam/102435

Zonal Route Design for Transit Corridors
journal, February 1986


POLARIS: Agent-based modeling framework development and implementation for integrated travel demand and network and operations simulations
journal, March 2016

  • Auld, Joshua; Hope, Michael; Ley, Hubert
  • Transportation Research Part C: Emerging Technologies, Vol. 64
  • DOI: 10.1016/j.trc.2015.07.017

Finding Least Cost Hyperpaths in Multimodal Transit Networks: Methodology, Algorithm, and Large-Scale Application
journal, January 2015

  • Verbas, İ. Ömer; Mahmassani, Hani S.
  • Transportation Research Record: Journal of the Transportation Research Board, Vol. 2497, Issue 1
  • DOI: 10.3141/2497-10

Dynamic Trip Assignment-Simulation Model for Intermodal Transportation Networks
journal, January 2001

  • Abdelghany, Khaled F.; Mahmassani, Hani S.
  • Transportation Research Record: Journal of the Transportation Research Board, Vol. 1771, Issue 1
  • DOI: 10.3141/1771-07

Congestion Pricing for Schedule-Based Transit Networks
journal, August 2010

  • Hamdouch, Younes; Lawphongpanich, Siriphong
  • Transportation Science, Vol. 44, Issue 3
  • DOI: 10.1287/trsc.1090.0312

A Modeling Framework for Bus Rapid Transit Operations Evaluation and Service Planning
journal, December 2007

  • Abdelghany, Khaled F.; Mahmassani, Hani S.; Abdelghany, Ahmed F.
  • Transportation Planning and Technology, Vol. 30, Issue 6
  • DOI: 10.1080/03081060701698219

Modeling User Responses to Pricing: Simultaneous Route and Departure Time Network Equilibrium with Heterogeneous Users
journal, January 2008

  • Lu, Chung-Cheng; Mahmassani, Hani S.
  • Transportation Research Record: Journal of the Transportation Research Board, Vol. 2085, Issue 1
  • DOI: 10.3141/2085-14

Dynamic Pricing with Heterogeneous Users: Gap-Driven Solution Approach for Bicriterion Dynamic User Equilibrium Problem
journal, January 2009

  • Lu, Chung-Cheng; Mahmassani, Hani S.
  • Transportation Research Record: Journal of the Transportation Research Board, Vol. 2090, Issue 1
  • DOI: 10.3141/2090-09

Trip-Based Path Algorithms Using the Transit Network Hierarchy
journal, July 2014

  • Khani, Alireza; Hickman, Mark; Noh, Hyunsoo
  • Networks and Spatial Economics, Vol. 15, Issue 3
  • DOI: 10.1007/s11067-014-9249-3

Alternating Deadheading in Bus Route Operations
journal, February 1985


Common Bus Lines
journal, May 1975

  • Chriqui, Claude; Robillard, Pierre
  • Transportation Science, Vol. 9, Issue 2
  • DOI: 10.1287/trsc.9.2.115

A New Polynomially Bounded Shortest Path Algorithm
journal, February 1985

  • Glover, F.; Klingman, D.; Phillips, N.
  • Operations Research, Vol. 33, Issue 1
  • DOI: 10.1287/opre.33.1.65

An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays
journal, September 2000


Schedule-based transit assignment model with travel strategies and capacity constraints
journal, August 2008

  • Hamdouch, Younes; Lawphongpanich, Siriphong
  • Transportation Research Part B: Methodological, Vol. 42, Issue 7-8
  • DOI: 10.1016/j.trb.2007.11.005

Frequency-based transit assignment considering seat capacities
journal, February 2011

  • Schmöcker, Jan-Dirk; Fonzone, Achille; Shimamoto, Hiroshi
  • Transportation Research Part B: Methodological, Vol. 45, Issue 2
  • DOI: 10.1016/j.trb.2010.07.002

A note on least time path computation considering delays and prohibitions for intersection movements
journal, October 1996

  • Ziliaskopoulos, Athanasios K.; Mahmassani, Hani S.
  • Transportation Research Part B: Methodological, Vol. 30, Issue 5
  • DOI: 10.1016/0191-2615(96)00001-X

A quasi-dynamic capacity constrained frequency-based transit assignment model
journal, December 2008

  • Schmöcker, Jan-Dirk; Bell, Michael G. H.; Kurauchi, Fumitaka
  • Transportation Research Part B: Methodological, Vol. 42, Issue 10
  • DOI: 10.1016/j.trb.2008.02.001

Modeling heterogeneous network user route and departure time responses to dynamic pricing
journal, April 2011

  • Lu, Chung-Cheng; Mahmassani, Hani S.
  • Transportation Research Part C: Emerging Technologies, Vol. 19, Issue 2
  • DOI: 10.1016/j.trc.2010.05.017

Optimal strategies: A new assignment model for transit networks
journal, April 1989


Transit Assignment for Congested Public Transport Systems: An Equilibrium Model
journal, May 1993

  • de Cea, Joaquín; Fernández, Enrique
  • Transportation Science, Vol. 27, Issue 2
  • DOI: 10.1287/trsc.27.2.133

Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks
journal, March 2002

  • Chabini, I.
  • IEEE Transactions on Intelligent Transportation Systems, Vol. 3, Issue 1
  • DOI: 10.1109/6979.994796

Hyperpaths in Network Based on Transit Schedules
journal, January 2012

  • Noh, Hyunsoo; Hickman, Mark; Khani, Alireza
  • Transportation Research Record: Journal of the Transportation Research Board, Vol. 2284, Issue 1
  • DOI: 10.3141/2284-04

A Formal Basis for the Heuristic Determination of Minimum Cost Paths
journal, January 1968

  • Hart, Peter; Nilsson, Nils; Raphael, Bertram
  • IEEE Transactions on Systems Science and Cybernetics, Vol. 4, Issue 2
  • DOI: 10.1109/TSSC.1968.300136