Spatial microassignment of travel demand with activity trip chains

Ahmed F. Abdelghany, Hani S. Mahmassani, Yi-Chang Chiu

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

As activity-based approaches gain acceptance for travel demand analysis and forecasting in practice, the unit of analysis in transportation planning models needs to shift from a one-way trip to an activity schedule with associated trip chains. A spatial network assignment process and its application to an actual network are described; the process can be used in conjunction with activity-based travel demand forecasting procedures as well as for traffic operational studies. Two simulation-based dynamic spatial microassignment procedures for travel demand with activity trip chains are presented. The first represents a one-step simulation-assignment procedure in which assignment of trips is based on prevailing travel time. The second is an iterative simulation-assignment procedure in which a user equilibrium solution is obtained. The models are illustrated through various experiments conducted using an actual network (in Fort Worth, Texas) to examine network performance under different activity and trip-chaining scenarios. Different demand levels with different trip chain patterns are considered and compared for an actual transportation network. In addition, a case is made for dynamic microassignment of activity trip chains by contrasting it with current practice and illustrating the pitfalls of inappropriately recognizing trip chains using current-practice assignment. In particular, two different procedures are considered and compared for selected test scenarios with the dynamic assignment models presented. The first procedure corresponds to the case in which the activity and trip-chaining behavior is completely ignored, and only the final destination in the chain is considered. The second procedure treats the links of the chains separately as independent trips, without appropriate linkage between them.

Original languageEnglish (US)
Pages (from-to)36-46
Number of pages11
JournalTransportation Research Record
Issue number1777
StatePublished - 2001
Externally publishedYes

Fingerprint

Travel time
Network performance
Planning
Experiments

ASJC Scopus subject areas

  • Civil and Structural Engineering

Cite this

Spatial microassignment of travel demand with activity trip chains. / Abdelghany, Ahmed F.; Mahmassani, Hani S.; Chiu, Yi-Chang.

In: Transportation Research Record, No. 1777, 2001, p. 36-46.

Research output: Contribution to journalArticle

Abdelghany, Ahmed F. ; Mahmassani, Hani S. ; Chiu, Yi-Chang. / Spatial microassignment of travel demand with activity trip chains. In: Transportation Research Record. 2001 ; No. 1777. pp. 36-46.
@article{75348cbe7a404d35a58dd820c705fe01,
title = "Spatial microassignment of travel demand with activity trip chains",
abstract = "As activity-based approaches gain acceptance for travel demand analysis and forecasting in practice, the unit of analysis in transportation planning models needs to shift from a one-way trip to an activity schedule with associated trip chains. A spatial network assignment process and its application to an actual network are described; the process can be used in conjunction with activity-based travel demand forecasting procedures as well as for traffic operational studies. Two simulation-based dynamic spatial microassignment procedures for travel demand with activity trip chains are presented. The first represents a one-step simulation-assignment procedure in which assignment of trips is based on prevailing travel time. The second is an iterative simulation-assignment procedure in which a user equilibrium solution is obtained. The models are illustrated through various experiments conducted using an actual network (in Fort Worth, Texas) to examine network performance under different activity and trip-chaining scenarios. Different demand levels with different trip chain patterns are considered and compared for an actual transportation network. In addition, a case is made for dynamic microassignment of activity trip chains by contrasting it with current practice and illustrating the pitfalls of inappropriately recognizing trip chains using current-practice assignment. In particular, two different procedures are considered and compared for selected test scenarios with the dynamic assignment models presented. The first procedure corresponds to the case in which the activity and trip-chaining behavior is completely ignored, and only the final destination in the chain is considered. The second procedure treats the links of the chains separately as independent trips, without appropriate linkage between them.",
author = "Abdelghany, {Ahmed F.} and Mahmassani, {Hani S.} and Yi-Chang Chiu",
year = "2001",
language = "English (US)",
pages = "36--46",
journal = "Transportation Research Record",
issn = "0361-1981",
publisher = "US National Research Council",
number = "1777",

}

TY - JOUR

T1 - Spatial microassignment of travel demand with activity trip chains

AU - Abdelghany, Ahmed F.

AU - Mahmassani, Hani S.

AU - Chiu, Yi-Chang

PY - 2001

Y1 - 2001

N2 - As activity-based approaches gain acceptance for travel demand analysis and forecasting in practice, the unit of analysis in transportation planning models needs to shift from a one-way trip to an activity schedule with associated trip chains. A spatial network assignment process and its application to an actual network are described; the process can be used in conjunction with activity-based travel demand forecasting procedures as well as for traffic operational studies. Two simulation-based dynamic spatial microassignment procedures for travel demand with activity trip chains are presented. The first represents a one-step simulation-assignment procedure in which assignment of trips is based on prevailing travel time. The second is an iterative simulation-assignment procedure in which a user equilibrium solution is obtained. The models are illustrated through various experiments conducted using an actual network (in Fort Worth, Texas) to examine network performance under different activity and trip-chaining scenarios. Different demand levels with different trip chain patterns are considered and compared for an actual transportation network. In addition, a case is made for dynamic microassignment of activity trip chains by contrasting it with current practice and illustrating the pitfalls of inappropriately recognizing trip chains using current-practice assignment. In particular, two different procedures are considered and compared for selected test scenarios with the dynamic assignment models presented. The first procedure corresponds to the case in which the activity and trip-chaining behavior is completely ignored, and only the final destination in the chain is considered. The second procedure treats the links of the chains separately as independent trips, without appropriate linkage between them.

AB - As activity-based approaches gain acceptance for travel demand analysis and forecasting in practice, the unit of analysis in transportation planning models needs to shift from a one-way trip to an activity schedule with associated trip chains. A spatial network assignment process and its application to an actual network are described; the process can be used in conjunction with activity-based travel demand forecasting procedures as well as for traffic operational studies. Two simulation-based dynamic spatial microassignment procedures for travel demand with activity trip chains are presented. The first represents a one-step simulation-assignment procedure in which assignment of trips is based on prevailing travel time. The second is an iterative simulation-assignment procedure in which a user equilibrium solution is obtained. The models are illustrated through various experiments conducted using an actual network (in Fort Worth, Texas) to examine network performance under different activity and trip-chaining scenarios. Different demand levels with different trip chain patterns are considered and compared for an actual transportation network. In addition, a case is made for dynamic microassignment of activity trip chains by contrasting it with current practice and illustrating the pitfalls of inappropriately recognizing trip chains using current-practice assignment. In particular, two different procedures are considered and compared for selected test scenarios with the dynamic assignment models presented. The first procedure corresponds to the case in which the activity and trip-chaining behavior is completely ignored, and only the final destination in the chain is considered. The second procedure treats the links of the chains separately as independent trips, without appropriate linkage between them.

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

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

M3 - Article

AN - SCOPUS:0035725953

SP - 36

EP - 46

JO - Transportation Research Record

JF - Transportation Research Record

SN - 0361-1981

IS - 1777

ER -