Abstract
We address the discrete network design problem (DNDP) which determines the optimal number of lanes to add to each candidate link in a road network. We formulate the problem as a bi-level programming model, where the upper level aims to minimize the total travel time via adding new lanes to candidate links and the lower level is a traditional Wardrop user equilibrium (UE) problem. We propose a global optimization method that is based on the system-optimum relaxation of the UE model. Numerical examples are given.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 17th International Conference of Hong Kong Society for Transportation Studies, HKSTS 2012 |
| Subtitle of host publication | Transportation and Logistics Management |
| Pages | 615-622 |
| Number of pages | 8 |
| Publication status | Published - 1 Dec 2012 |
| Externally published | Yes |
| Event | 17th International Conference of Hong Kong Society for Transportation Studies: Transportation and Logistics Management, HKSTS 2012 - Kowloon, Hong Kong Duration: 15 Dec 2012 → 17 Dec 2012 |
Conference
| Conference | 17th International Conference of Hong Kong Society for Transportation Studies: Transportation and Logistics Management, HKSTS 2012 |
|---|---|
| Country/Territory | Hong Kong |
| City | Kowloon |
| Period | 15/12/12 → 17/12/12 |
Keywords
- Bi-level programming
- Discrete network design problem
- Mixed-integer nonlinear programming
- Network optimization
- Traffic equilibrium
ASJC Scopus subject areas
- Transportation