A thesis submitted in partial fulfillment of the re quirements for the degree of Master of Engineering in Transportation Engineering, School of Engineering and Technology

It has long been aimed by transportation researcher s to solve the unmanageable urban traffic congestion all over the world. RGS and ATIS are amo ng the useful ITS applications for urban passenger car travel. However, available mode ls used in evaluating their effectiveness have not precisely imitated the real transportation network. For example, many of the previous studies avoided path enumeration, route ch oice models were formulated without integrating the driver{u2019}s perception error, etc. All of the aforementioned issues are significant in a route choice model{u2019}s efficiency. Moreover, in traffic assignment and network design problems, reliable route choice models are very essential. The proposed route choice model is provided with an efficient path enumeration algorithm. The combined concepts of hierarchical road classifi cation, resource constraints, link penalty and the link-based shortest path searching algorith m successfully enumerated independent paths; manifested through the choice probability re sults of the deterministic multinomial logit (MNL) model. In addition, the model calculates the path choice probabilities both when a reference travel time frame is known and unknown. U sing a network in Bangkok, Thailand, the proposed model was examined and the calculated path choice probabilities were compared to the Success Rate (SR) and deterministic MNL. Significant advantages of the proposed model over the conventional MNL were estab lished.

Thesis (M.Eng.) - Asian Institute of Technology, 2008