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 programmin...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 altemately 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.展开更多
By handling the travel cost function artfully, the authors formulate the transportation mixed network design problem (MNDP) as a mixed-integer, nonlinear bilevel programming problem, in which the lower-level problem...By handling the travel cost function artfully, the authors formulate the transportation mixed network design problem (MNDP) as a mixed-integer, nonlinear bilevel programming problem, in which the lower-level problem, comparing with that of conventional bilevel DNDP models, is not a side constrained user equilibrium assignment problem, but a standard user equilibrium assignment problem. Then, the bilevel programming model for MNDP is reformulated as a continuous version of bilevel programming problem by the continuation method. By virtue of the optimal-value function, the lower-level assignment problem can be expressed as a nonlinear equality constraint. Therefore, the bilevel programming model for MNDP can be transformed into an equivalent single-level optimization problem. By exploring the inherent nature of the MNDP, the optimal-value function for the lower- level equilibrium assignment problem is proved to be continuously differentiable and its functional value and gradient can be obtained efficiently. Thus, a continuously differentiable but still nonconvex optimization formulation of the MNDP is created, and then a locally convergent algorithm is proposed by applying penalty function method. The inner loop of solving the subproblem is mainly to implement an Ml-or-nothing assignment. Finally, a small-scale transportation network and a large-scale network are presented to verify the proposed model and algorithm.展开更多
基金The National Natural Science Foundation of China(No. 50908235 )China Postdoctoral Science Foundation (No.201003520)
文摘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 altemately 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.
基金supported by the National Basic Research Program of China under Grant No. 2006CB705500the National Natural Science Foundation of China under Grant No. 0631001+1 种基金the Program for Changjiang Scholars and Innovative Research Team in University Volvo Research and Educational Foundations
文摘By handling the travel cost function artfully, the authors formulate the transportation mixed network design problem (MNDP) as a mixed-integer, nonlinear bilevel programming problem, in which the lower-level problem, comparing with that of conventional bilevel DNDP models, is not a side constrained user equilibrium assignment problem, but a standard user equilibrium assignment problem. Then, the bilevel programming model for MNDP is reformulated as a continuous version of bilevel programming problem by the continuation method. By virtue of the optimal-value function, the lower-level assignment problem can be expressed as a nonlinear equality constraint. Therefore, the bilevel programming model for MNDP can be transformed into an equivalent single-level optimization problem. By exploring the inherent nature of the MNDP, the optimal-value function for the lower- level equilibrium assignment problem is proved to be continuously differentiable and its functional value and gradient can be obtained efficiently. Thus, a continuously differentiable but still nonconvex optimization formulation of the MNDP is created, and then a locally convergent algorithm is proposed by applying penalty function method. The inner loop of solving the subproblem is mainly to implement an Ml-or-nothing assignment. Finally, a small-scale transportation network and a large-scale network are presented to verify the proposed model and algorithm.