Capacitated transit service network design with boundedly rational agents

Jiangtao Liu, Xuesong Zhou

Research output: Contribution to journalArticle

35 Citations (Scopus)

Abstract

This paper proposes a new alternative modeling framework to systemically account for boundedly rational decision rules of travelers in a dynamic transit service network with tight capacity constraints. Within a time-discretized space-time network, the time-dependent transit services are characterized by traveling arcs and waiting arcs with constant travel times. Instead of using traditional flow-based formulations, an agent-based integer linear formulation is proposed to represent boundedly rational decisions under strictly imposed capacity constraints, due to vehicle carrying capacity and station storage capacity. Focusing on a viable and limited sets of space-time path alternatives, the proposed single-level optimization model can be effectively decomposed to a time-dependent routing sub-problem for individual agents and a knapsack sub-problem for service arc selections through the Lagrangian decomposition. In addition, several practically important modeling issues are discussed, such as dynamic and personalized transit pricing, passenger inflow control as part of network restraint strategies, and penalty for early/late arrival. Finally, numerical experiments are performed to demonstrate the methodology and computational efficiency of our proposed model and algorithm.

Original languageEnglish (US)
Pages (from-to)225-250
Number of pages26
JournalTransportation Research Part B: Methodological
Volume93
DOIs
StatePublished - Nov 1 2016

Fingerprint

Travel time
Computational efficiency
Decomposition
Costs
Experiments
optimization model
time
Network design
pricing
penalty
travel
efficiency
experiment
methodology
Capacity constraints
Modeling
Travellers
Carrying capacity
Service selection
Numerical experiment

Keywords

  • Agent-based model
  • Boundedly rational agents
  • Dynamic transit service network design
  • Tight capacity constraint

ASJC Scopus subject areas

  • Transportation
  • Management Science and Operations Research

Cite this

Capacitated transit service network design with boundedly rational agents. / Liu, Jiangtao; Zhou, Xuesong.

In: Transportation Research Part B: Methodological, Vol. 93, 01.11.2016, p. 225-250.

Research output: Contribution to journalArticle

@article{a3ecba58680543ae941458d6e9851490,
title = "Capacitated transit service network design with boundedly rational agents",
abstract = "This paper proposes a new alternative modeling framework to systemically account for boundedly rational decision rules of travelers in a dynamic transit service network with tight capacity constraints. Within a time-discretized space-time network, the time-dependent transit services are characterized by traveling arcs and waiting arcs with constant travel times. Instead of using traditional flow-based formulations, an agent-based integer linear formulation is proposed to represent boundedly rational decisions under strictly imposed capacity constraints, due to vehicle carrying capacity and station storage capacity. Focusing on a viable and limited sets of space-time path alternatives, the proposed single-level optimization model can be effectively decomposed to a time-dependent routing sub-problem for individual agents and a knapsack sub-problem for service arc selections through the Lagrangian decomposition. In addition, several practically important modeling issues are discussed, such as dynamic and personalized transit pricing, passenger inflow control as part of network restraint strategies, and penalty for early/late arrival. Finally, numerical experiments are performed to demonstrate the methodology and computational efficiency of our proposed model and algorithm.",
keywords = "Agent-based model, Boundedly rational agents, Dynamic transit service network design, Tight capacity constraint",
author = "Jiangtao Liu and Xuesong Zhou",
year = "2016",
month = "11",
day = "1",
doi = "10.1016/j.trb.2016.07.015",
language = "English (US)",
volume = "93",
pages = "225--250",
journal = "Transportation Research, Series B: Methodological",
issn = "0191-2615",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - Capacitated transit service network design with boundedly rational agents

AU - Liu, Jiangtao

AU - Zhou, Xuesong

PY - 2016/11/1

Y1 - 2016/11/1

N2 - This paper proposes a new alternative modeling framework to systemically account for boundedly rational decision rules of travelers in a dynamic transit service network with tight capacity constraints. Within a time-discretized space-time network, the time-dependent transit services are characterized by traveling arcs and waiting arcs with constant travel times. Instead of using traditional flow-based formulations, an agent-based integer linear formulation is proposed to represent boundedly rational decisions under strictly imposed capacity constraints, due to vehicle carrying capacity and station storage capacity. Focusing on a viable and limited sets of space-time path alternatives, the proposed single-level optimization model can be effectively decomposed to a time-dependent routing sub-problem for individual agents and a knapsack sub-problem for service arc selections through the Lagrangian decomposition. In addition, several practically important modeling issues are discussed, such as dynamic and personalized transit pricing, passenger inflow control as part of network restraint strategies, and penalty for early/late arrival. Finally, numerical experiments are performed to demonstrate the methodology and computational efficiency of our proposed model and algorithm.

AB - This paper proposes a new alternative modeling framework to systemically account for boundedly rational decision rules of travelers in a dynamic transit service network with tight capacity constraints. Within a time-discretized space-time network, the time-dependent transit services are characterized by traveling arcs and waiting arcs with constant travel times. Instead of using traditional flow-based formulations, an agent-based integer linear formulation is proposed to represent boundedly rational decisions under strictly imposed capacity constraints, due to vehicle carrying capacity and station storage capacity. Focusing on a viable and limited sets of space-time path alternatives, the proposed single-level optimization model can be effectively decomposed to a time-dependent routing sub-problem for individual agents and a knapsack sub-problem for service arc selections through the Lagrangian decomposition. In addition, several practically important modeling issues are discussed, such as dynamic and personalized transit pricing, passenger inflow control as part of network restraint strategies, and penalty for early/late arrival. Finally, numerical experiments are performed to demonstrate the methodology and computational efficiency of our proposed model and algorithm.

KW - Agent-based model

KW - Boundedly rational agents

KW - Dynamic transit service network design

KW - Tight capacity constraint

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

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

U2 - 10.1016/j.trb.2016.07.015

DO - 10.1016/j.trb.2016.07.015

M3 - Article

AN - SCOPUS:84980051706

VL - 93

SP - 225

EP - 250

JO - Transportation Research, Series B: Methodological

JF - Transportation Research, Series B: Methodological

SN - 0191-2615

ER -