This paper formulates the continuous network design problem as a mathematical program with complementarity constraints (MPCC), with the upper level a nonlinear programming problem and the lower level a nonlinear complementarity problem. Unlike in most previous studies, the proposed framework is more
โฆ LIBER โฆ
A subgradient optimization model for continuous road network design problem
โ Scribed by Suh-Wen Chiou
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 229 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0307-904X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A general MPCC model and its solution al
โ
Jeff X. Ban; Henry X. Liu; Michael C. Ferris; Bin Ran
๐
Article
๐
2006
๐
Elsevier Science
๐
English
โ 459 KB
A hybrid approach for optimal design of
โ
Suh-Wen Chiou
๐
Article
๐
2008
๐
Elsevier Science
๐
English
โ 221 KB
A computational method for optimal struc
โ
E. J. Haug Jr.; K. C. Pan; T. D. Streeter
๐
Article
๐
1975
๐
John Wiley and Sons
๐
English
โ 836 KB
A comparison of optimization-based appro
โ
Paul D Frank; Gregory R Shubin
๐
Article
๐
1991
๐
Elsevier Science
๐
English
โ 104 KB
A continuous network design model in sto
โ
Yongtaek Lim; Benjamin G Heydecker; Seungjae Lee
๐
Article
๐
2005
๐
Institute for Transportation Inc.
๐
English
โ 579 KB
The continuous network design problem (CNDP) is known to be difficult to solve due to the intrinsic properties of non-convexity and nonlinearity. Such kinds of CNDP can be formulated as a bi-level programme, in which the upper level represents the designer's decisions and the lower level the travell
A new tabu search method for continuous
โ
O. Hajji; S. Brisset; P. Brochet
๐
Article
๐
2005
๐
John Wiley and Sons
๐
English
โ 209 KB