System Optimum Fuzzy Traffic Assignment Problem

This paper focuses on converting the system optimum traffic assignment problem (SO-TAP) to system optimum fuzzy traffic assignment problem (SO-FTAP). The SO-TAP aims to minimize the total system travel time on road network between the specified origin and destination points. Link travel time is take...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Promet 2019-12, Vol.31 (6), p.611-620
Hauptverfasser: Temelcan, Gizem, Gonce Kocken, Hale, Albayrak, Inci
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper focuses on converting the system optimum traffic assignment problem (SO-TAP) to system optimum fuzzy traffic assignment problem (SO-FTAP). The SO-TAP aims to minimize the total system travel time on road network between the specified origin and destination points. Link travel time is taken as a linear function of fuzzy link flow; thus each link travel time is constructed as a triangular fuzzy number. The objective function is expressed in terms of link flows and link travel times in a non-linear form while satisfying the flow conservation constraints. The parameters of the problem are path lengths, number of lanes, average speed of a vehicle, vehicle length, clearance, spacing, link capacity and free flow travel time. Considering a road network, the path lengths and number of lanes are taken as crisp numbers. The average speed of a vehicle and vehicle length are imprecise in nature, so these are taken as triangular fuzzy numbers. Since the remaining parameters, that are clearance, spacing, link capacity and free flow travel time are determined by the average speed of a vehicle and vehicle length, they will be triangular fuzzy numbers. Finally, the original SO-TAP is converted to a fuzzy quadratic programming (FQP) problem, and it is solved using an existing approach from literature. A numerical experiment is illustrated.
ISSN:0353-5320
1848-4069
DOI:10.7307/ptt.v31i6.3210