A learning-based transportation oriented simulation system
This paper describes the conceptual development, operatonalization and empirical testing of : A Learning-based Transportation Oriented Simulation System. This activity-based model of activity-travel behavior is derived from theories of choice heuristics that consumers apply when making decisions in complex environments. The model, one of the most comprehensive of its kind, predicts which activities are conducted when, where, for how long, with whom, and the transport mode involved. In addition, various situational, temporal, spatial, spatial-temporal and institutional constraints are incorporated in the model. The decision tree is proposed as a formalism to represent an exhaustive set of mutually exclusive rules for each decision step in the model. A CHAID decision tree induction method is used to derive decision trees from activity diary data. The case study conducted to develop and test the model indicates that performance of the model is very satisfactory. We conclude therefore that the methodology proposed in this article is useful to develop computational process models of activity-travel choice behavior.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 38 (2004)
Issue (Month): 7 (August)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- T GÃ¤rling & T KalÃ©n & J Romanus & M Selart & B Vilhelmson, 1998.
"Computer Simulation of Household Activity Scheduling,"
Environment and Planning A,
SAGE Publishing, vol. 30(4), pages 665-679, April.
- T Gärling & T Kalén & J Romanus & M Selart & B Vilhelmson, 1998. "Computer simulation of household activity scheduling," Environment and Planning A, Pion Ltd, London, vol. 30(4), pages 665-679, April.
- Tommy Gärling & Robert Gillholm & William Montgomery, 1999. "The role of anticipated time pressure in activity scheduling," Transportation, Springer, vol. 26(2), pages 173-191, May.
- Golledge, Reginald G. & Kwan, Mei-Po & Garling, Tommy, 1994. "Computational-Process Modelling of Household Travel Decisions Using a Geographical Information System," University of California Transportation Center, Working Papers qt4kk8w93s, University of California Transportation Center.
When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:38:y:2004:i:7:p:613-633. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.