Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/34381
Title: An efficient solution algorithm for solving multi-class reliability-based traffic assignment problem
Authors: Chen, BY
Lam, WHK 
Sumalee, A
Shao, H
Keywords: Multi-user classes
Reliability-based user equilibrium
Reliable shortest path problem
Traffic assignment problem
Travel time uncertainty
Issue Date: 2011
Publisher: Pergamon Press
Source: Mathematical and computer modelling, 2011, v. 54, no. 5-6, p. 1428-1439 How to cite?
Journal: Mathematical and computer modelling 
Abstract: The multi-class reliability-based user equilibrium (RUE) problem has been intensively studied in recent years, as it can capture the route choice behaviors of users with heterogeneous risk-aversion under demand and supply uncertainties. Few solution algorithms, however, are available for solving the RUE problems in large-scale road networks. This is mainly due to the non-additive property of the path finding sub-problem in the RUE model. An efficient traffic assignment solution algorithm for solving the multi-class RUE problems in large-scale road networks is proposed in this study. First, an effective shortest path algorithm is developed to explicitly overcome the non-additive difficulty. The algorithm is capable of finding optimal paths for all user classes in one search process and hence the repeated search process for each user class is avoided. This property can save not only computational time but also memory requirement. The proposed shortest path algorithm is then, further incorporated into a path-based traffic assignment algorithm using a column generation technique. Such traffic assignment algorithms can solve the multi-class RUE problem without the requirement of path enumeration. Experimental results show that the proposed solution algorithms can, even for large-scale networks with multi-user classes, efficiently achieve highly accurate RUE solutions within satisfactory computational time.
URI: http://hdl.handle.net/10397/34381
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2011.04.015
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

34
Last Week
0
Last month
0
Citations as of Sep 11, 2017

WEB OF SCIENCETM
Citations

32
Last Week
0
Last month
1
Citations as of Sep 23, 2017

Page view(s)

31
Last Week
1
Last month
Checked on Sep 17, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.