Network-oriented Household Activity Pattern Problem for System Optimization

Jiangtao Liu, Jee Eun Kang, Xuesong Zhou, Ram Pendyala

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

The recently emerging trend of self-driving vehicles and information sharing technologies, made available by private technology vendors, starts creating a revolutionary paradigm shift in the coming years for traveler mobility applications. By considering a deterministic traveler decision making framework at the household level in congested transportation networks, this paper aims to address the challenges of how to optimally schedule individuals' daily travel patterns under the complex activity constraints and interactions. We reformulate two special cases of household activity pattern problem (HAPP) through a high-dimensional network construct, and offer a systematic comparison with the classical mathematical programming models proposed by Recker (1995). Furthermore, we consider the tight road capacity constraint as another special case of HAPP to model complex interactions between multiple household activity scheduling decisions, and this attempt offers another household-based framework for linking activity-based model (ABM) and dynamic traffic assignment (DTA) tools. Through embedding temporal and spatial relations among household members, vehicles and mandatory/optional activities in an integrated space-time-state network, we develop two 0-1 integer linear programming models that can seamlessly incorporate constraints for a number of key decisions related to vehicle selection, activity performing and ridesharing patterns under congested networks. The well-structured network models can be directly solved by standard optimization solvers, and further converted to a set of time-dependent state-dependent least cost path-finding problems through Lagrangian relaxation, which permit the use of computationally efficient algorithms on large-scale high-fidelity transportation networks.

Original languageEnglish (US)
Pages (from-to)827-847
Number of pages21
JournalTransportation Research Procedia
Volume23
DOIs
StatePublished - 2017

Fingerprint

Mathematical programming
programming
Linear programming
Decision making
Scheduling
interaction
scheduling
travel
road
traffic
paradigm
decision making
Costs
trend
costs
time

Keywords

  • Activity-based modeling
  • Dynamic traffic assignment
  • Household Activity Pattern Problem
  • Space-time-state network

ASJC Scopus subject areas

  • Transportation

Cite this

Network-oriented Household Activity Pattern Problem for System Optimization. / Liu, Jiangtao; Kang, Jee Eun; Zhou, Xuesong; Pendyala, Ram.

In: Transportation Research Procedia, Vol. 23, 2017, p. 827-847.

Research output: Contribution to journalArticle

@article{8ccad703277c4686b18b6cd27605f1b1,
title = "Network-oriented Household Activity Pattern Problem for System Optimization",
abstract = "The recently emerging trend of self-driving vehicles and information sharing technologies, made available by private technology vendors, starts creating a revolutionary paradigm shift in the coming years for traveler mobility applications. By considering a deterministic traveler decision making framework at the household level in congested transportation networks, this paper aims to address the challenges of how to optimally schedule individuals' daily travel patterns under the complex activity constraints and interactions. We reformulate two special cases of household activity pattern problem (HAPP) through a high-dimensional network construct, and offer a systematic comparison with the classical mathematical programming models proposed by Recker (1995). Furthermore, we consider the tight road capacity constraint as another special case of HAPP to model complex interactions between multiple household activity scheduling decisions, and this attempt offers another household-based framework for linking activity-based model (ABM) and dynamic traffic assignment (DTA) tools. Through embedding temporal and spatial relations among household members, vehicles and mandatory/optional activities in an integrated space-time-state network, we develop two 0-1 integer linear programming models that can seamlessly incorporate constraints for a number of key decisions related to vehicle selection, activity performing and ridesharing patterns under congested networks. The well-structured network models can be directly solved by standard optimization solvers, and further converted to a set of time-dependent state-dependent least cost path-finding problems through Lagrangian relaxation, which permit the use of computationally efficient algorithms on large-scale high-fidelity transportation networks.",
keywords = "Activity-based modeling, Dynamic traffic assignment, Household Activity Pattern Problem, Space-time-state network",
author = "Jiangtao Liu and Kang, {Jee Eun} and Xuesong Zhou and Ram Pendyala",
year = "2017",
doi = "10.1016/j.trpro.2017.05.046",
language = "English (US)",
volume = "23",
pages = "827--847",
journal = "Transportation Research Procedia",
issn = "2352-1457",
publisher = "Elsevier BV",

}

TY - JOUR

T1 - Network-oriented Household Activity Pattern Problem for System Optimization

AU - Liu, Jiangtao

AU - Kang, Jee Eun

AU - Zhou, Xuesong

AU - Pendyala, Ram

PY - 2017

Y1 - 2017

N2 - The recently emerging trend of self-driving vehicles and information sharing technologies, made available by private technology vendors, starts creating a revolutionary paradigm shift in the coming years for traveler mobility applications. By considering a deterministic traveler decision making framework at the household level in congested transportation networks, this paper aims to address the challenges of how to optimally schedule individuals' daily travel patterns under the complex activity constraints and interactions. We reformulate two special cases of household activity pattern problem (HAPP) through a high-dimensional network construct, and offer a systematic comparison with the classical mathematical programming models proposed by Recker (1995). Furthermore, we consider the tight road capacity constraint as another special case of HAPP to model complex interactions between multiple household activity scheduling decisions, and this attempt offers another household-based framework for linking activity-based model (ABM) and dynamic traffic assignment (DTA) tools. Through embedding temporal and spatial relations among household members, vehicles and mandatory/optional activities in an integrated space-time-state network, we develop two 0-1 integer linear programming models that can seamlessly incorporate constraints for a number of key decisions related to vehicle selection, activity performing and ridesharing patterns under congested networks. The well-structured network models can be directly solved by standard optimization solvers, and further converted to a set of time-dependent state-dependent least cost path-finding problems through Lagrangian relaxation, which permit the use of computationally efficient algorithms on large-scale high-fidelity transportation networks.

AB - The recently emerging trend of self-driving vehicles and information sharing technologies, made available by private technology vendors, starts creating a revolutionary paradigm shift in the coming years for traveler mobility applications. By considering a deterministic traveler decision making framework at the household level in congested transportation networks, this paper aims to address the challenges of how to optimally schedule individuals' daily travel patterns under the complex activity constraints and interactions. We reformulate two special cases of household activity pattern problem (HAPP) through a high-dimensional network construct, and offer a systematic comparison with the classical mathematical programming models proposed by Recker (1995). Furthermore, we consider the tight road capacity constraint as another special case of HAPP to model complex interactions between multiple household activity scheduling decisions, and this attempt offers another household-based framework for linking activity-based model (ABM) and dynamic traffic assignment (DTA) tools. Through embedding temporal and spatial relations among household members, vehicles and mandatory/optional activities in an integrated space-time-state network, we develop two 0-1 integer linear programming models that can seamlessly incorporate constraints for a number of key decisions related to vehicle selection, activity performing and ridesharing patterns under congested networks. The well-structured network models can be directly solved by standard optimization solvers, and further converted to a set of time-dependent state-dependent least cost path-finding problems through Lagrangian relaxation, which permit the use of computationally efficient algorithms on large-scale high-fidelity transportation networks.

KW - Activity-based modeling

KW - Dynamic traffic assignment

KW - Household Activity Pattern Problem

KW - Space-time-state network

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

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

U2 - 10.1016/j.trpro.2017.05.046

DO - 10.1016/j.trpro.2017.05.046

M3 - Article

AN - SCOPUS:85020511004

VL - 23

SP - 827

EP - 847

JO - Transportation Research Procedia

JF - Transportation Research Procedia

SN - 2352-1457

ER -