Skip to main content
Intended for healthcare professionals
Restricted access
Research article
First published January 2003

Formulation and Solution Algorithm for Fuzzy Dynamic Traffic Assignment Model

Abstract

An issue that is always important in the development of traffic assignment models is how travelers' perceptions of travel time should be modeled. Because travelers rarely have perfect knowledge of the road network or of the travel conditions, they choose routes on the basis of their perceived travel times. Traditionally, travelers' perceived travel times are treated as random variables, leading to the stochastic traffic assignment problem. However, uncertain factors are also observed in the subjective recognition of travel times by travelers, and these can be illustrated as fuzzy variables. Therefore, a fuzzy dynamic traffic assignment model that takes into account the imprecision and the uncertainties in the route choice process is proposed. By modeling the expressions of perceived travel times as fuzzy variables, this model makes possible the description of a traveler's process of choosing a route that is more accurate and realistic than those from its deterministic or stochastic counter parts. The fuzzy perceived link travel time and fuzzy perceived path travel time are defined, and a fuzzy shortest path algorithm is used to find the group of fuzzy shortest paths and to assign traffic to each of them by using the so-called C-logit method. The results of the proposed model are also compared with those from the stochastic dynamic traffic assignment model, and it is demonstrated that the impact of advanced traveler information systems on the traveler's route choice process can be readily incorporated into the proposed model.

Get full access to this article

View all access and purchase options for this article.

References

1. Akiyama T. Fuzzy User Equilibrium Flow with Information Provision. Proc., International Conference on Modeling and Management in Transportation, Vol. 1, 1999, pp. 263–268.
2. Akiyama T. Extended Traffic Assignment Models with Fuzzy Travel Time Description. Proc., 4th Asian Fuzzy System Symposium, Vol. 1, 2000, pp. 487–592.
3. Henn V. Fuzzy Route Choices Model for Traffic Assignment. Fuzzy Sets and Systems, Vol. 116, 2000, pp. 77–101.
4. Ran B., and Boyce D. E. Modeling Dynamic Transportation Networks. Springer, New York, 1996.
5. Boyce D. E., Ran B., and Li Y. Considering Travelers' Risk-Taking Behavior in Dynamic Traffic Assignment. In Transportation Networks: Recent Methodological Advances (Bell M. G. H., ed.), Elsevier Science, Oxford, United Kingdom, 1998, pp. 67–81.
6. Liu H. X., Ban X., Ran B., and Mirchandani P. Analytical Dynamic Traffic Assignment Model with Probabilistic Travel Times and Perceptions. In Transportation Research Record: Journal of the Transportation Research Board, No. 1783, TRB, National Research Council, 2002, pp. 125–133.
7. Dubois D., and Prade H. Fuzzy Sets and Systems (Theory and Application). Mathematics in Science and Engineering, Vol. 144, 1978, pp. 42–49.
8. Sheffi Y. Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods. Prentice-Hall, Englewood Cliffs, N.J., 1978.
9. Okada S., and Soper T. A Shortest Path Problem on a Network with Fuzzy Arc Lengths. Fuzzy Sets and Systems, Vol. 116, 2000, pp. 129–140.
10. Lin K. C., and Chern M. S. The Fuzzy Shortest Path Problem and Its Most Vital Arcs. Fuzzy Sets and Systems, Vol. 58, No. 3, 1993, pp. 343–353.
11. Blue M., Bush B., and Puckett J. Unified Approach to Fuzzy Graph Problems. Fuzzy Sets and Systems, Vol. 125, 2002, pp. 355–368.
12. Blue M., Bush B., and Puckett J. Application of Fuzzy Logic to Graph Theory. Report LA-UR-96-4792. Los Alamos National Laboratory, Los Alamos, N. Mex., 1996.
13. Dreyfus S. E. An Appraisal of Some Shortest-Path Algorithms. Operations Research, Vol. 17, 1969, pp. 395–412.
14. Yen J. Y. Finding the K Shortest Loopless Paths in a Network. Management Science, Vol. 17, 1971, pp. 712–716.
15. Shier D. R. On Algorithms for Finding the K Shortest Paths in a Network. Networks, Vol. 9, 1979, pp. 195–214.
16. Cascetta E., Nuzzolo A., Russo F., and Vitetta A. A Modified Logit Route Choice Model Overcoming Path Overlapping Problems. Specification and Some Calibration Results for Interurban Networks. Transportation and Traffic Theory, Proc., 13th International Symposium on Transportation and Traffic Theory, Lyon, France, 1996, pp. 697–712.
17. Gliebe J. P., Koppelman F. S., and Ziliaskopoulos A. K. Route Choice Using A Paired Combinatorial Logit Model. Presented at 77th Annual Meeting of the Transportation Research Board, Washington, D.C., 1998.

Cite article

Cite article

Cite article

OR

Download to reference manager

If you have citation software installed, you can download article citation data to the citation manager of your choice

Share options

Share

Share this article

Share with email
EMAIL ARTICLE LINK
Share on social media

Share access to this article

Sharing links are not relevant where the article is open access and not available if you do not have a subscription.

For more information view the Sage Journals article sharing page.

Information, rights and permissions

Information

Published In

Article first published: January 2003
Issue published: January 2003

Rights and permissions

© 2003 National Academy of Sciences.
Request permissions for this article.

Authors

Affiliations

Henry X. Liu
California PATH Program, Institute of Transportation Studies, University of California, Berkeley, Berkeley, CA 94720
Department of Civil and Environmental Engineering, Utah State University, 4110 Old Main Hill, Logan, UT 84322-4110
Xuegang Ban
Department of Civil and Environmental Engineering, University of Wisconsin at Madison, 1415 Engineering Drive, Madison, WI 53706
Bin Ran
Department of Civil and Environmental Engineering, University of Wisconsin at Madison, 1415 Engineering Drive, Madison, WI 53706
Pitu Mirchandani
Department of Systems and Industrial Engineering, University of Arizona, P.O. Box 210020, Tucson, AZ 85721

Metrics and citations

Metrics

Journals metrics

This article was published in Transportation Research Record: Journal of the Transportation Research Board.

VIEW ALL JOURNAL METRICS

Article usage*

Total views and downloads: 15

*Article usage tracking started in December 2016


Altmetric

See the impact this article is making through the number of times it’s been read, and the Altmetric Score.
Learn more about the Altmetric Scores



Articles citing this one

Receive email alerts when this article is cited

Web of Science: 0

Crossref: 12

  1. Dynamic user optimal route choice problem on a signalized transportati...
    Go to citation Crossref Google Scholar
  2. Optimization Techniques in Intelligent Transportation Systems
    Go to citation Crossref Google Scholar
  3. A web service based advanced traveller information system for itinerar...
    Go to citation Crossref Google Scholar
  4. Risk-based stochastic evacuation routing strategy under dynamic probab...
    Go to citation Crossref Google Scholar
  5. Proactive Control for Oversaturation Mitigation on Evacuation Network:...
    Go to citation Crossref Google Scholar
  6. Disruption management in public transit: the bee colony optimization a...
    Go to citation Crossref Google Scholar
  7. Modelling parking choice behaviour using Possibility Theory
    Go to citation Crossref Google Scholar
  8. A fuzzy traffic assignment algorithm based on driver perceived travel ...
    Go to citation Crossref Google Scholar
  9. Traffic assignment model with fuzzy level of travel demand: An efficie...
    Go to citation Crossref Google Scholar
  10. Adaptive hybrid fuzzy rule-based system approach for modeling and pred...
    Go to citation Crossref Google Scholar
  11. A Neuro-Fuzzy Approach to Simulate the User Mode Choice Behaviour in a...
    Go to citation Crossref Google Scholar
  12. A NEURO-FUZZY APPROACH TO SIMULATE THE USER MODE CHOICE BEHAVIOUR IN A...
    Go to citation Crossref Google Scholar

Figures and tables

Figures & Media

Tables

View Options

Get access

Access options

If you have access to journal content via a personal subscription, university, library, employer or society, select from the options below:


Alternatively, view purchase options below:

Purchase 24 hour online access to view and download content.

Access journal content via a DeepDyve subscription or find out more about this option.

View options

PDF/ePub

View PDF/ePub