Loading…
Dynamic Discrete Choice Models for Transportation
Discrete choice models have received widespread acceptance in transport research over the past three decades, being used in travel demand modelling and behavioural analysis; however, their applications have been mainly developed in a static context. There have been several dynamic models in transpor...
Saved in:
Published in: | Transport reviews 2011-07, Vol.31 (4), p.473-494 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Discrete choice models have received widespread acceptance in transport research over the past three decades, being used in travel demand modelling and behavioural analysis; however, their applications have been mainly developed in a static context. There have been several dynamic models in transportation; but these formulations are not based on dynamic optimization principles and do not allow for changes in external factors. With the continuous and rapid changes in modern societies (i.e. introduction of advanced technologies, aggressive marketing strategies and innovative policies) it is more and more recognized by researchers in various disciplines from economics to social science that choice situations take place in a dynamic environment and that strong interdependencies exist among decisions made at different points in time. Dynamic discrete choice models (DDCMs) describe the behaviour of a forward-looking economic agent who chooses between several alternatives repeatedly over time. DDCMs are usually specified as an optimal stopping problem, where agents decide when to make a change in ownership of durable goods or in their behaviour. In this paper, we present the application of the dynamic formulation to short- to medium-term vehicle-holding decisions. |
---|---|
ISSN: | 0144-1647 1464-5327 |
DOI: | 10.1080/01441647.2010.533393 |