Genetic Algorithm to Estimate Cumulative Prospect Theory Parameters for Selection of High-Occupancy-Vehicle Lane
- Authors
- Chow, Joseph Y. J.; Lee, Gunwoo; Yang, Inchul
- Issue Date
- Jan-2010
- Publisher
- US National Research Council
- Citation
- Transportation Research Record, v.2157, no.01, pp 71 - 77
- Pages
- 7
- Indexed
- SCI
SCIE
SCOPUS
- Journal Title
- Transportation Research Record
- Volume
- 2157
- Number
- 01
- Start Page
- 71
- End Page
- 77
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/40525
- DOI
- 10.3141/2157-09
- ISSN
- 0361-1981
2169-4052
- Abstract
- Recent literature suggests a need for a more realistic representation of driver behavior. In an effort to integrate prospect theory as a potential descriptive method into traveler behavior, it is important to determine the validity of previous estimated parameters obtained from empirical studies and interviews of people who are not in the same fast-paced, dynamic, travel time disutility setting as real drivers. A genetic algorithm is used to simultaneously estimate the parameters of the cumulated prospect theory (CPT) value and weight functions as well as the coefficients of the random utility model; this procedure leads to estimates that have a higher likelihood value and statistical significance than an equivalent expected utility based logit model or a CPT-based logit model using the empirical values developed earlier. The value function parameters generally conform to conclusions from previous literature. The weight function parameters, however, suggest that drivers in a fast-paced changing environment with multiple subjects for prospect evaluation may become overwhelmed by the certainty effect.
- Files in This Item
-
Go to Link
- Appears in
Collections - COLLEGE OF ENGINEERING SCIENCES > DEPARTMENT OF TRANSPORTATION AND LOGISTICS ENGINEERING > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/40525)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.