A system-optimum relaxation based approach to discrete network design problems

Shuaian Wang; Qiang Meng; Hai Yang

A system-optimum relaxation based approach to discrete network design problems

Shuaian Wang
, Qiang Meng
, Hai Yang

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

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

Cite this

@inproceedings{cbee42b62a0b4c2794e25d1341d5c61d,

title = "A system-optimum relaxation based approach to discrete network design problems",

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.",

keywords = "Bi-level programming, Discrete network design problem, Mixed-integer nonlinear programming, Network optimization, Traffic equilibrium",

author = "Shuaian Wang and Qiang Meng and Hai Yang",

year = "2012",

month = dec,

day = "1",

language = "English",

isbn = "9789881581419",

pages = "615--622",

booktitle = "Proceedings of the 17th International Conference of Hong Kong Society for Transportation Studies, HKSTS 2012",

note = "17th International Conference of Hong Kong Society for Transportation Studies: Transportation and Logistics Management, HKSTS 2012 ; Conference date: 15-12-2012 Through 17-12-2012",

}

Wang, S, Meng, Q & Yang, H 2012, A system-optimum relaxation based approach to discrete network design problems. in Proceedings of the 17th International Conference of Hong Kong Society for Transportation Studies, HKSTS 2012: Transportation and Logistics Management. pp. 615-622, 17th International Conference of Hong Kong Society for Transportation Studies: Transportation and Logistics Management, HKSTS 2012, Kowloon, Hong Kong, 15/12/12.

A system-optimum relaxation based approach to discrete network design problems. / Wang, Shuaian; Meng, Qiang; Yang, Hai.
Proceedings of the 17th International Conference of Hong Kong Society for Transportation Studies, HKSTS 2012: Transportation and Logistics Management. 2012. p. 615-622.

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

TY - GEN

T1 - A system-optimum relaxation based approach to discrete network design problems

AU - Wang, Shuaian

AU - Meng, Qiang

AU - Yang, Hai

PY - 2012/12/1

Y1 - 2012/12/1

N2 - 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.

AB - 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.

KW - Bi-level programming

KW - Discrete network design problem

KW - Mixed-integer nonlinear programming

KW - Network optimization

KW - Traffic equilibrium

UR - https://www.scopus.com/pages/publications/84896872817

M3 - Conference article published in proceeding or book

SN - 9789881581419

SP - 615

EP - 622

BT - Proceedings of the 17th International Conference of Hong Kong Society for Transportation Studies, HKSTS 2012

T2 - 17th International Conference of Hong Kong Society for Transportation Studies: Transportation and Logistics Management, HKSTS 2012

Y2 - 15 December 2012 through 17 December 2012

ER -

A system-optimum relaxation based approach to discrete network design problems

Abstract

Conference

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this