A perturbation-based approach for continuous network design problem with link capacity expansion. (18th December 2019)

• Record Type: Journal Article
• Authors: Msigwa, Robert Ebihart; Lu, Yue; Zhang, Li-Wei
• Is Part Of: International journal of operational research. Volume 37:Number 1(2020)
• Page Start: 105
• Page End: 134
• Publication Date: 2019-12-18
• Subjects: continuous network design problem -- CNDP -- bilevel programming -- nonlinear mathematical program with complementarity constraints -- MPCC -- variational analysis -- perturbation-based approach; Operations research -- Periodicals; 003.05
• Languages: English
• ISSNs: 1745-7645

Abstract

This paper formulates a continuous network design problem (CNDP) as a nonlinear mathematical program with complementarity constraints (NLMPCC) and then a perturbation-based approach is proposed to overcome the NLMPCC problem and the lack of constraint qualifications. This formulation permits a more general route cost structure and every stationary point of it corresponds to a global optimal solution of the perturbed problem. The contribution of this paper from the mathematical perspective is that, instead of using the conventional nonlinear programming methodology, variational analysis is taken as a tool to analyse the convergence of the perturbation-based method. From the practical point of view, a convergent algorithm is proposed for the CNDP and employs the sequential quadratic program (SQP) solver to obtain the solution of the perturbed problem. Numerical experiments are carried out in both 16 and 76-link road networks to illustrate the capability of the perturbation-based approach to the CNDP with elastic demand. Results showed that the proposed model will solve a wider class of transportation equilibrium problems than the existing ones.