Solving continuous network design problem with generalized geometric programming approach
To satisfy growing travel demand and reduce traffic congestion, the continuous network design problem (CNDP) is often proposed to optimize road network performance by the expansion of road capacity. In the determination of the equilibrium travel flow pattern, equilibrium principles such as determini...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/87907 http://hdl.handle.net/10220/46846 |
| _version_ | 1826117883192672256 |
|---|---|
| author | Du, Bo Wang, David Zhi Wei |
| author2 | School of Civil and Environmental Engineering |
| author_facet | School of Civil and Environmental Engineering Du, Bo Wang, David Zhi Wei |
| author_sort | Du, Bo |
| collection | NTU |
| description | To satisfy growing travel demand and reduce traffic congestion, the continuous network design problem (CNDP) is often proposed to optimize road network performance by the expansion of road capacity. In the determination of the equilibrium travel flow pattern, equilibrium principles such as deterministic user equilibrium (DUE) and stochastic user equilibrium (SUE) may be applied to describe travelers’ route choice behavior. Because of the different mathematical formulation structures for the CNDP with DUE and SUE principles, most of the existing solution algorithms have been developed to solve the CNDP for either DUE or SUE. In this study, a more general solution method is proposed by applying the generalized geometric programming (GGP) approach to obtain the global optimal solution of the CNDP with both DUE and SUE principles. Specifically, the original CNDP problem is reformulated into a GGP form, and then a successive monomial approximation method is employed to transform the GGP formulation into a standard geometric programming form, which can be cast into an equivalent nonlinear but convex optimization problem whose global optimal solution can be guaranteed and solved by many existing solution algorithms. Numerical experiments are presented to demonstrate the validity and efficiency of the solution method. |
| first_indexed | 2024-10-01T04:34:38Z |
| format | Journal Article |
| id | ntu-10356/87907 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T04:34:38Z |
| publishDate | 2018 |
| record_format | dspace |
| spelling | ntu-10356/879072020-03-07T11:43:37Z Solving continuous network design problem with generalized geometric programming approach Du, Bo Wang, David Zhi Wei School of Civil and Environmental Engineering Deterministic User Equilibrium Stochastic User Equilibrium DRNTU::Engineering::Civil engineering To satisfy growing travel demand and reduce traffic congestion, the continuous network design problem (CNDP) is often proposed to optimize road network performance by the expansion of road capacity. In the determination of the equilibrium travel flow pattern, equilibrium principles such as deterministic user equilibrium (DUE) and stochastic user equilibrium (SUE) may be applied to describe travelers’ route choice behavior. Because of the different mathematical formulation structures for the CNDP with DUE and SUE principles, most of the existing solution algorithms have been developed to solve the CNDP for either DUE or SUE. In this study, a more general solution method is proposed by applying the generalized geometric programming (GGP) approach to obtain the global optimal solution of the CNDP with both DUE and SUE principles. Specifically, the original CNDP problem is reformulated into a GGP form, and then a successive monomial approximation method is employed to transform the GGP formulation into a standard geometric programming form, which can be cast into an equivalent nonlinear but convex optimization problem whose global optimal solution can be guaranteed and solved by many existing solution algorithms. Numerical experiments are presented to demonstrate the validity and efficiency of the solution method. 2018-12-06T05:10:50Z 2019-12-06T16:51:52Z 2018-12-06T05:10:50Z 2019-12-06T16:51:52Z 2018 Journal Article Du, B., & Wang, D. Z. W. (2018). Solving continuous network design problem with generalized geometric programming approach. Transportation Research Record: Journal of the Transportation Research Board, 2567(1), 38-46. doi:10.3141/2567-05 0361-1981 https://hdl.handle.net/10356/87907 http://hdl.handle.net/10220/46846 10.3141/2567-05 en Transportation Research Record: Journal of the Transportation Research Board © 2018 National Academy of Sciences. |
| spellingShingle | Deterministic User Equilibrium Stochastic User Equilibrium DRNTU::Engineering::Civil engineering Du, Bo Wang, David Zhi Wei Solving continuous network design problem with generalized geometric programming approach |
| title | Solving continuous network design problem with generalized geometric programming approach |
| title_full | Solving continuous network design problem with generalized geometric programming approach |
| title_fullStr | Solving continuous network design problem with generalized geometric programming approach |
| title_full_unstemmed | Solving continuous network design problem with generalized geometric programming approach |
| title_short | Solving continuous network design problem with generalized geometric programming approach |
| title_sort | solving continuous network design problem with generalized geometric programming approach |
| topic | Deterministic User Equilibrium Stochastic User Equilibrium DRNTU::Engineering::Civil engineering |
| url | https://hdl.handle.net/10356/87907 http://hdl.handle.net/10220/46846 |
| work_keys_str_mv | AT dubo solvingcontinuousnetworkdesignproblemwithgeneralizedgeometricprogrammingapproach AT wangdavidzhiwei solvingcontinuousnetworkdesignproblemwithgeneralizedgeometricprogrammingapproach |