Accessibility with time and resource constraints: Computing hyper-prisms for sustainable transportation planning

Monirehalsadat Mahmoudi, Ying Song, Harvey J. Miller, Xuesong Zhou

Research output: Contribution to journalArticle

Abstract

Accessibility is the ease of obtaining desired destinations, activities, or services in an environment. A common accessibility measure in basic and applied transportation science is the space-time prism (STP) and the network-time prisms (NTPs): these are the envelopes of all possible paths between two locations and times in planar space and transportation networks, respectively. STPs and NTPs focus on time as the scarce resource limiting accessibility. However, other resource constraints can constrain space-time accessibility, such as limits or “budgets” for energy, emissions, or monetary expenses. This paper extends NTPs to include other resource constraints in addition to time. Network-based resource hyper-prisms (RHPs) incorporate other resource constraints into NTP, capturing the trade-offs between time and other resources in determining space-time accessibility. We conceptualize RHPs as a constrained optimization problem and develop a forward and backward resource-dependent time-dependent dynamic programming to determine the boundaries of a RHP given time and other resource budgets. We illustrate our approach using the Chicago sketch network (with 933 nodes and 2967 links) for the use case of an individual with an internal combustion engine vehicle and a carbon emission budget and using portions of Washington, D.C. and Baltimore networks (with 12,145 nodes and 30,697 links) for the use case of siting electric vehicle charging stations to maximize regional accessibility.

LanguageEnglish (US)
Pages171-183
Number of pages13
JournalComputers, Environment and Urban Systems
Volume73
DOIs
StatePublished - Jan 1 2019
Externally publishedYes

Fingerprint

transportation planning
accessibility
planning
resource
resources
budget
time
electric vehicle
carbon emission

Keywords

  • Accessibility
  • Dynamic programming
  • Resource hyper-prisms
  • Space-time prisms
  • Sustainable transportation

ASJC Scopus subject areas

  • Geography, Planning and Development
  • Ecological Modeling
  • Environmental Science(all)
  • Urban Studies

Cite this

Accessibility with time and resource constraints : Computing hyper-prisms for sustainable transportation planning. / Mahmoudi, Monirehalsadat; Song, Ying; Miller, Harvey J.; Zhou, Xuesong.

In: Computers, Environment and Urban Systems, Vol. 73, 01.01.2019, p. 171-183.

Research output: Contribution to journalArticle

@article{0b4d35b4f4da4d7c90f182068be3fe43,
title = "Accessibility with time and resource constraints: Computing hyper-prisms for sustainable transportation planning",
abstract = "Accessibility is the ease of obtaining desired destinations, activities, or services in an environment. A common accessibility measure in basic and applied transportation science is the space-time prism (STP) and the network-time prisms (NTPs): these are the envelopes of all possible paths between two locations and times in planar space and transportation networks, respectively. STPs and NTPs focus on time as the scarce resource limiting accessibility. However, other resource constraints can constrain space-time accessibility, such as limits or “budgets” for energy, emissions, or monetary expenses. This paper extends NTPs to include other resource constraints in addition to time. Network-based resource hyper-prisms (RHPs) incorporate other resource constraints into NTP, capturing the trade-offs between time and other resources in determining space-time accessibility. We conceptualize RHPs as a constrained optimization problem and develop a forward and backward resource-dependent time-dependent dynamic programming to determine the boundaries of a RHP given time and other resource budgets. We illustrate our approach using the Chicago sketch network (with 933 nodes and 2967 links) for the use case of an individual with an internal combustion engine vehicle and a carbon emission budget and using portions of Washington, D.C. and Baltimore networks (with 12,145 nodes and 30,697 links) for the use case of siting electric vehicle charging stations to maximize regional accessibility.",
keywords = "Accessibility, Dynamic programming, Resource hyper-prisms, Space-time prisms, Sustainable transportation",
author = "Monirehalsadat Mahmoudi and Ying Song and Miller, {Harvey J.} and Xuesong Zhou",
year = "2019",
month = "1",
day = "1",
doi = "10.1016/j.compenvurbsys.2018.10.002",
language = "English (US)",
volume = "73",
pages = "171--183",
journal = "Computers, Environment and Urban Systems",
issn = "0198-9715",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - Accessibility with time and resource constraints

T2 - Computers, Environment and Urban Systems

AU - Mahmoudi, Monirehalsadat

AU - Song, Ying

AU - Miller, Harvey J.

AU - Zhou, Xuesong

PY - 2019/1/1

Y1 - 2019/1/1

N2 - Accessibility is the ease of obtaining desired destinations, activities, or services in an environment. A common accessibility measure in basic and applied transportation science is the space-time prism (STP) and the network-time prisms (NTPs): these are the envelopes of all possible paths between two locations and times in planar space and transportation networks, respectively. STPs and NTPs focus on time as the scarce resource limiting accessibility. However, other resource constraints can constrain space-time accessibility, such as limits or “budgets” for energy, emissions, or monetary expenses. This paper extends NTPs to include other resource constraints in addition to time. Network-based resource hyper-prisms (RHPs) incorporate other resource constraints into NTP, capturing the trade-offs between time and other resources in determining space-time accessibility. We conceptualize RHPs as a constrained optimization problem and develop a forward and backward resource-dependent time-dependent dynamic programming to determine the boundaries of a RHP given time and other resource budgets. We illustrate our approach using the Chicago sketch network (with 933 nodes and 2967 links) for the use case of an individual with an internal combustion engine vehicle and a carbon emission budget and using portions of Washington, D.C. and Baltimore networks (with 12,145 nodes and 30,697 links) for the use case of siting electric vehicle charging stations to maximize regional accessibility.

AB - Accessibility is the ease of obtaining desired destinations, activities, or services in an environment. A common accessibility measure in basic and applied transportation science is the space-time prism (STP) and the network-time prisms (NTPs): these are the envelopes of all possible paths between two locations and times in planar space and transportation networks, respectively. STPs and NTPs focus on time as the scarce resource limiting accessibility. However, other resource constraints can constrain space-time accessibility, such as limits or “budgets” for energy, emissions, or monetary expenses. This paper extends NTPs to include other resource constraints in addition to time. Network-based resource hyper-prisms (RHPs) incorporate other resource constraints into NTP, capturing the trade-offs between time and other resources in determining space-time accessibility. We conceptualize RHPs as a constrained optimization problem and develop a forward and backward resource-dependent time-dependent dynamic programming to determine the boundaries of a RHP given time and other resource budgets. We illustrate our approach using the Chicago sketch network (with 933 nodes and 2967 links) for the use case of an individual with an internal combustion engine vehicle and a carbon emission budget and using portions of Washington, D.C. and Baltimore networks (with 12,145 nodes and 30,697 links) for the use case of siting electric vehicle charging stations to maximize regional accessibility.

KW - Accessibility

KW - Dynamic programming

KW - Resource hyper-prisms

KW - Space-time prisms

KW - Sustainable transportation

UR - http://www.scopus.com/inward/record.url?scp=85055163999&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85055163999&partnerID=8YFLogxK

U2 - 10.1016/j.compenvurbsys.2018.10.002

DO - 10.1016/j.compenvurbsys.2018.10.002

M3 - Article

VL - 73

SP - 171

EP - 183

JO - Computers, Environment and Urban Systems

JF - Computers, Environment and Urban Systems

SN - 0198-9715

ER -