[1] Chen Qun, Yao Jialin,. Dimension-down iterative algorithmfor the mixed transportation network design problem [J]. Journal of Southeast University (English Edition), 2012, 28 (2): 236-239. [doi:10.3969/j.issn.1003-7985.2012.02.018]

Copy

Dimension-down iterative algorithmfor the mixed transportation network design problem()

Share：

Journal of Southeast University (English Edition)[ISSN:1003-7985/CN:32-1325/N]

Volumn:

28

Issue:

2012 2

Page:

236-239

Research Field:

Traffic and Transportation Engineering

Publishing date:

2012-06-30

Info

Title:

Dimension-down iterative algorithmfor the mixed transportation network design problem

Author(s):

Chen Qun;  Yao Jialin

School of Traffic and Transportation Engineering, Central South University, Changsha 410075, China

Keywords:

mixed network design problem(MNDP);  dimension-down iterative algorithm(DDIA);  mathematical programming with equilibrium constraint(MPEC)

PACS:

U491

DOI:

10.3969/j.issn.1003-7985.2012.02.018

Abstract:

An optimal dimension-down iterative algorithm(DDIA)is proposed for solving a mixed(continuous/discrete)transportation network design problem(MNDP), which is generally expressed as a mathematical programming with equilibrium constraints(MPEC). The upper level of the MNDP aims to optimize the network performance via both the expansion of existing links and the addition of new candidate links, whereas the lower level is a traditional Wardrop user equilibrium(UE)model. The idea of the proposed DDIA is to reduce the dimensions of the problem. A group of variables(discrete/continuous)are fixed to alternately optimize another group of variables(continuous/discrete). Some continuous network design problems(CNDPs)and discrete network design problems(DNDPs)are solved repeatedly until the optimal solution is obtained. A numerical example is given to demonstrate the efficiency of the proposed algorithm.

References:

[1] Yang H, Bell M G H. Models and algorithms for road network design: a review and some new developments[J]. Transport Reviews, 1998, 18(3): 257-278.
[2] Abdulaal M, LeBlanc L J. Continuous equilibrium network design models[J]. Transportation Research Part B, 1979, 13(1): 19-32.
[3] Suwansirikul C, Friesz T L, Tobin R L. Equilibrium decomposed optimization: a heuristic for the continuous equilibrium network design problems[J].Transportation Science, 1987, 21(4): 254-263.
[4] Meng Q, Yang H, Bell M G H. An equivalent continuously differentiable model and a locally convergent algorithm for the continuous network design problem[J]. Transportation Research Part B, 2001, 35(1): 83-105.
[5] Chiou S W. Bilevel programming for the continuous transport network design problem[J]. Transportation Research Part B, 2005, 39(4): 361-383.
[6] Wang D Z W, Lo H K. Global optimum of the linearized network design problem with equilibrium flows[J]. Transportation Research Part B, 2010, 44(4): 482-492.
[7] LeBlanc L J. An algorithm for the discrete network design problem[J]. Transportation Science, 1975, 9(3): 183-199.
[8] Poorzahedy H, Turnquist M A. Approximate algorithms for the discrete network design problem[J]. Transportation Research Part B, 1982, 16(1): 45-55.
[9] Gao Z, Wu J, Sun H. Solution algorithm for the bi-level discrete network design problem[J]. Transportation Research Part B, 2005, 39(6): 479-495.
[10] Sheffi Y. Urban transportation networks: equilibrium analysis with mathematical programming methods[M]. Englewood Cliffs, NJ, USA: Prentice-Hall, 1985.

Memo

Memo:

Biography: Chen Qun(1977—), male, doctor, associate professor, chenqun631@csu.edu.cn.
Foundation items: The National Natural Science Foundation of China(No.50908235), China Postdoctoral Science Foundation(No.201003520).
Citation: Chen Qun, Yao Jialin.Dimension-down iterative algorithm for the mixed transportation network design problem[J].Journal of Southeast University(English Edition), 2012, 28(2):236-239.[doi:10.3969/j.issn.1003-7985.2012.02.018]

Common functions