Network knowledge and route choice

Models of urban traveler route choice are reviewed in the context of Intelligent Transportation Systems, particularly Advanced Traveler Information S ystems. Existing models suffer from assumptions of perfect information about travel conditions a nd infinite information processing capabilities of drivers. We present evidence that a majority of travelers fail to minimize travel time or distance. We also show that travelers with more network knowledge appear to vary their commute route to respond to changing travel conditions. Coefficient estimates of a model of network knowledge, based on the geographical idea of spatial ability, are presented. To better understand habitual route choice behavior, we examine many possible route generation algorithms. A simulation approach is preferred because it allows for heterogeneity in driver perceptions and it has a quick computational time. Alternative route choice model specifications such as Multinomial Logit, C-Logit, Path Size Logit, Cross-Nested Logit and Logit Kernel Probit are evaluated. The exponential specification of the Path S ize term, using a large parameter value, offers a considerable improvement in fit over MNL, C -Logit and CNL. A hybrid Path Size Logit and Logit Kernel Probit model offers the best overall fit; however, the stability of these estimates requires further examination. The hybrid Path S ize Logit and CNL model provides the next best empirical fit. Random coefficient specifications of MNL, PS L and LK Probit models were also examined.

Department dc:contributor.department

Massachusetts Institute of Technology. Dept. of Civil and Environmental Engineering.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2002

Author dc:creator

• Ramming, Michael Scott

Advisor dc:contributor.advisor

• Moshe Emanuel Ben-Akiva.

• Civil and Environmental Engineering.

Statement dc:rights

• M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/49797

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/49797