A general MPCC model and its solution algorithm for continuous network design problem

✍ Scribed by Jeff X. Ban; Henry X. Liu; Michael C. Ferris; Bin Ran

• Publisher: Elsevier Science
• Year: 2006
• Tongue: English
• Weight: 459 KB
• Volume: 43
• Category: Article
• ISSN: 0895-7177
• DOI: 10.1016/j.mcm.2005.11.001

✦ Synopsis

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 general, in which both symmetric and asymmetric user equilibria can be captured. By applying the complementarity slackness condition of the lower-level problem, the original bilevel formulation can be converted into a single-level and smooth nonlinear programming problem. In order to solve the problem, a relaxation scheme is applied by progressively restricting the complementarity condition, which has been proven to be a rigorous approach under certain conditions. The model and solution algorithm are tested for well-known network design problems and promising results are shown.