03493nas a2200397 4500 20260818145603.0 980811s1998 th u m rtt 0| a1eng d .b11716976 AIT Thesis no.IP-98-06 Varameth Vichiensan A link-based user equilibrium traffic assignment for urban transportation networks Bangkok : Asian Institute of Technology, 1998 56 leaves : ill. Thesis ; no. IP-98-06 A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Civil Engineering Thesis (M.Eng.) - Asian Institute of Technology, 1998 This study shows that the user equilibrium assignment can be represented as an optimization problem with only link variables, i.e., link-based user equilibrium problem. Such a formulation does not require to enumerate the possible paths, so it seems feasible to obtain the exact solution compared with the solution from classical algorithms. This study concentrates on the problem formulations with only link-based variables rather than developing algorithms or testing the solution convergence speed. The equivalence of route-based and link-based user equilibrium problem is theoretically derived; the optimality conditions of link-based program must satisfy that of the route-based program and vice versa. And from this equivalency, the same set of solution can be obtained by solving either models. The relation between link flow and route flow is also investigated for the uniqueness conditions. The computation trade-offs between two models are discussed. The size of two problems are compared as well as some issues relating to the dynamic user equilibrium (DUE) problem are mentioned. Since the solution is not unique in terms of path flow, the most likely path flow pattern is then determined. Next, the concept of link-based user equilibrium is extended to analyze some of the typical transportation planning problems in a way parallel to Sheffi (1985). Next, the link-based user equilibrium concept is applied to Bell (1995)'s model which presented the equilibrium assignment with queues. Finally, the stochastic user equilibrium is analyzed based on link variables, and various models are discussed. In this study only small network problems are numerically solved to validate the model formulated. Urban transportation Mathematical models Fujiwara, Okitsugu, Chairperson Nakatsuji, Takashi, Examination Committee Do, Ba Khang, Examination Committee Nguyen Luong Bach, Examination Committee Royal Thai Government, Scholarship Donor Asian Institute of Technology. Thesis ; no. IP-98-06 Full-Text http://203.159.5.9/ait-thesis/detail.php?q=B12899 .b11716976 mnait y 240403 0 980811 m a y 2 mnait mnarc 22 40 Barcode : 30050120729263 CREATED : 2014-03-20 RECORD # : i1277540x LPATRON : 0 LCHKIN : - # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 0 TOT CHKOUT : 0 TOT RENEW : 0 Barcode : 30050160072285 CREATED : 2016-04-27 RECORD # : i12958943 LPATRON : 0 LCHKIN : - # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 0 TOT CHKOUT : 0 TOT RENEW : 0 69830 69830 0 0 0 0 MAIN MAIN mnait 2026-08-18 50.00 0 AIT Thesis no.IP-98-06 30050120729263 2026-08-18 14:56:03 3 2026-08-18 22 0 0 0 0 MAIN MAIN mnarc 2026-08-18 0 AIT Thesis no.IP-98-06 30050160072285 2026-08-18 14:56:03 1 2026-08-18 40