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)
JournalTransportation Research Part C: Emerging Technologies
DOIs
StateAccepted/In press - 2017

Fingerprint

Mathematical programming
programming
Linear programming
Decision making
Scheduling
interaction
Household
scheduling
travel
road
traffic
paradigm
decision making
Costs
trend
costs
time
Travellers
Transportation networks
Interaction

Keywords

  • Activity-based scheduling
  • Dynamic traffic assignment
  • Household activity pattern problem
  • Ride-sharing optimization
  • Space-time-state network

ASJC Scopus subject areas

  • Automotive Engineering
  • Transportation
  • Computer Science Applications
  • Management Science and Operations Research

Cite this

@article{453762a1afde43758d98759d412c7e8d,
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 scheduling, Dynamic traffic assignment, Household activity pattern problem, Ride-sharing optimization, Space-time-state network",
author = "Jiangtao Liu and Kang, {Jee Eun} and Xuesong Zhou and Ram Pendyala",
year = "2017",
doi = "10.1016/j.trc.2017.09.006",
language = "English (US)",
journal = "Transportation Research Part C: Emerging Technologies",
issn = "0968-090X",
publisher = "Elsevier Limited",

}

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 scheduling

KW - Dynamic traffic assignment

KW - Household activity pattern problem

KW - Ride-sharing optimization

KW - Space-time-state network

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

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

U2 - 10.1016/j.trc.2017.09.006

DO - 10.1016/j.trc.2017.09.006

M3 - Article

JO - Transportation Research Part C: Emerging Technologies

JF - Transportation Research Part C: Emerging Technologies

SN - 0968-090X

ER -