Abstract
The multi-class reliability-based user equilibrium (RUE) problem has been intensively studied in recent years, as it could better reveal different travelers' path choice behaviors in road networks under demand and/or supply uncertainties. However, the path disutility is non-additive in the RUE problem, in which path enumeration is required for solving such complex problem. In this paper, a novel solution algorithm without requirement of path enumeration is proposed for solving the RUE problem in road networks with multi-user classes. The proposed algorithm converges at finite iterations by iteratively shifting path flows from the costliest to the cheapest path. Experimental results show that the proposed algorithm could efficiently lead to stable solution of the RUE path choice problems within reasonable computational time for large-scale networks with multi-user classes.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 14th HKSTS International Conference |
| Subtitle of host publication | Transportation and Geography |
| Pages | 139-147 |
| Number of pages | 9 |
| Volume | 1 |
| Publication status | Published - 1 Dec 2009 |
| Event | 14th HKSTS International Conference: Transportation and Geography - Kowloon, Hong Kong Duration: 10 Dec 2009 → 12 Dec 2009 |
Conference
| Conference | 14th HKSTS International Conference: Transportation and Geography |
|---|---|
| Country | Hong Kong |
| City | Kowloon |
| Period | 10/12/09 → 12/12/09 |
ASJC Scopus subject areas
- Transportation