Considering the decision-making variables of the capacities of branch roads and the optimization targets of lowering the saturation of arterial roads and the reconstruction expense of branch roads, the bi-level progra...Considering the decision-making variables of the capacities of branch roads and the optimization targets of lowering the saturation of arterial roads and the reconstruction expense of branch roads, the bi-level programming model for reconstructing the branch roads was set up. The upper level model was for determining the enlarged capacities of the branch roads, and the lower level model was for calculating the flows of road sections via the user equilibrium traffic assignment method. The genetic algorithm for solving the bi-level model was designed to obtain the reconstruction capacities of the branch roads. The results show that by the bi-level model and its algorithm, the optimum scheme of urban branch roads reconstruction can be gained, which reduces the saturation of arterial roads apparently, and alleviates traffic congestion. In the data analysis the arterial saturation decreases from 1.100 to 0.996, which verifies the micro-circulation transportation's function of urban branch road network.展开更多
This paper considers multiobjective integer programming problems involving random variables in constraints. Using the concept of simple recourse, the formulated multiobjective stochastic simple recourse problems are t...This paper considers multiobjective integer programming problems involving random variables in constraints. Using the concept of simple recourse, the formulated multiobjective stochastic simple recourse problems are transformed into deterministic ones. For solving transformed deterministic problems efficiently, we also introduce genetic algorithms with double strings for nonlinear integer programming problems. Taking into account vagueness of judgments of the decision maker, an interactive fuzzy satisficing method is presented. In the proposed interactive method, after determineing the fuzzy goals of the decision maker, a satisficing solution for the decision maker is derived efficiently by updating the reference membership levels of the decision maker. An illustrative numerical example is provided to demonstrate the feasibility and efficiency of the proposed method.展开更多
The urban transit fare structure and level can largely affect passengers’travel behavior and route choices.The commonly used transit fare policies in the present transit network would lead to the unbalanced transit a...The urban transit fare structure and level can largely affect passengers’travel behavior and route choices.The commonly used transit fare policies in the present transit network would lead to the unbalanced transit assignment and improper transit resources distribution.In order to distribute transit passenger flow evenly and efficiently,this paper introduces a new distance-based fare pattern with Euclidean distance.A bi-level programming model is developed for determining the optimal distance-based fare pattern,with the path-based stochastic transit assignment(STA)problem with elastic demand being proposed at the lower level.The upper-level intends to address a principal-agent game between transport authorities and transit enterprises pursing maximization of social welfare and financial interest,respectively.A genetic algorithm(GA)is implemented to solve the bi-level model,which is verified by a numerical example to illustrate that the proposed nonlinear distance-based fare pattern presents a better financial performance and distribution effect than other fare structures.展开更多
The purpose of this paper is to introduce second order (K, F)-pseudoconvex and second order strongly (K, F)- pseudoconvex functions which are a generalization of cone-pseudoconvex and strongly cone-pseudoconvex functi...The purpose of this paper is to introduce second order (K, F)-pseudoconvex and second order strongly (K, F)- pseudoconvex functions which are a generalization of cone-pseudoconvex and strongly cone-pseudoconvex functions. A pair of second order symmetric dual multiobjective nonlinear programs is formulated by using the considered functions. Furthermore, the weak, strong and converse duality theorems for this pair are established. Finally, a self duality theorem is given.展开更多
In this paper, we present several parametric duality results under various generalized （a,v,p）-V- invexity assumptions for a semiinfinite multiobjective fractional programming problem.
In this work, we established a converse duality theorem for higher-order Mond-Weir type multiob- jective programming involving cones. This fills some gap in recently work of Kim et al. [Kim D S, Kang H S, Lee Y J, et ...In this work, we established a converse duality theorem for higher-order Mond-Weir type multiob- jective programming involving cones. This fills some gap in recently work of Kim et al. [Kim D S, Kang H S, Lee Y J, et al. Higher order duality in inultiobjective programming with cone constraints. Optimization, 2010, 59： 29-43].展开更多
An optimization model and its solution algorithm for alternate traffic restriction(ATR) schemes were introduced in terms of both the restriction districts and the proportion of restricted automobiles. A bi-level progr...An optimization model and its solution algorithm for alternate traffic restriction(ATR) schemes were introduced in terms of both the restriction districts and the proportion of restricted automobiles. A bi-level programming model was proposed to model the ATR scheme optimization problem by aiming at consumer surplus maximization and overload flow minimization at the upper-level model. At the lower-level model, elastic demand, mode choice and multi-class user equilibrium assignment were synthetically optimized. A genetic algorithm involving prolonging codes was constructed, demonstrating high computing efficiency in that it dynamically includes newly-appearing overload links in the codes so as to reduce the subsequent searching range. Moreover,practical processing approaches were suggested, which may improve the operability of the model-based solutions.展开更多
In this paper,we point out some deficiencies in a recent paper(Lee and Kim in J.Nonlinear Convex Anal.13:599–614,2012),and we establish strong duality and converse duality theorems for two types of nondifferentiable...In this paper,we point out some deficiencies in a recent paper(Lee and Kim in J.Nonlinear Convex Anal.13:599–614,2012),and we establish strong duality and converse duality theorems for two types of nondifferentiable higher-order symmetric duals multiobjective programming involving cones.展开更多
基金Project(2006CB705507) supported by the National Basic Research and Development Program of ChinaProject(20060533036) supported by the Specialized Research Foundation for the Doctoral Program of Higher Education of China
文摘Considering the decision-making variables of the capacities of branch roads and the optimization targets of lowering the saturation of arterial roads and the reconstruction expense of branch roads, the bi-level programming model for reconstructing the branch roads was set up. The upper level model was for determining the enlarged capacities of the branch roads, and the lower level model was for calculating the flows of road sections via the user equilibrium traffic assignment method. The genetic algorithm for solving the bi-level model was designed to obtain the reconstruction capacities of the branch roads. The results show that by the bi-level model and its algorithm, the optimum scheme of urban branch roads reconstruction can be gained, which reduces the saturation of arterial roads apparently, and alleviates traffic congestion. In the data analysis the arterial saturation decreases from 1.100 to 0.996, which verifies the micro-circulation transportation's function of urban branch road network.
文摘This paper considers multiobjective integer programming problems involving random variables in constraints. Using the concept of simple recourse, the formulated multiobjective stochastic simple recourse problems are transformed into deterministic ones. For solving transformed deterministic problems efficiently, we also introduce genetic algorithms with double strings for nonlinear integer programming problems. Taking into account vagueness of judgments of the decision maker, an interactive fuzzy satisficing method is presented. In the proposed interactive method, after determineing the fuzzy goals of the decision maker, a satisficing solution for the decision maker is derived efficiently by updating the reference membership levels of the decision maker. An illustrative numerical example is provided to demonstrate the feasibility and efficiency of the proposed method.
基金the Humanities and Social Science Foundation of the Ministry of Education of China(Grant No.20YJCZH121).
文摘The urban transit fare structure and level can largely affect passengers’travel behavior and route choices.The commonly used transit fare policies in the present transit network would lead to the unbalanced transit assignment and improper transit resources distribution.In order to distribute transit passenger flow evenly and efficiently,this paper introduces a new distance-based fare pattern with Euclidean distance.A bi-level programming model is developed for determining the optimal distance-based fare pattern,with the path-based stochastic transit assignment(STA)problem with elastic demand being proposed at the lower level.The upper-level intends to address a principal-agent game between transport authorities and transit enterprises pursing maximization of social welfare and financial interest,respectively.A genetic algorithm(GA)is implemented to solve the bi-level model,which is verified by a numerical example to illustrate that the proposed nonlinear distance-based fare pattern presents a better financial performance and distribution effect than other fare structures.
文摘The purpose of this paper is to introduce second order (K, F)-pseudoconvex and second order strongly (K, F)- pseudoconvex functions which are a generalization of cone-pseudoconvex and strongly cone-pseudoconvex functions. A pair of second order symmetric dual multiobjective nonlinear programs is formulated by using the considered functions. Furthermore, the weak, strong and converse duality theorems for this pair are established. Finally, a self duality theorem is given.
文摘In this paper, we present several parametric duality results under various generalized （a,v,p）-V- invexity assumptions for a semiinfinite multiobjective fractional programming problem.
基金supported by National Natural Science Foundation of China(Grant Nos.10831009 and 11271391)the Natural Science Foundation of Chongqing(Grant No.CSTC2011BA0030)
文摘In this work, we established a converse duality theorem for higher-order Mond-Weir type multiob- jective programming involving cones. This fills some gap in recently work of Kim et al. [Kim D S, Kang H S, Lee Y J, et al. Higher order duality in inultiobjective programming with cone constraints. Optimization, 2010, 59： 29-43].
基金Projects(71171200,51108465,71101155)supported by the National Natural Science Foundation of China
文摘An optimization model and its solution algorithm for alternate traffic restriction(ATR) schemes were introduced in terms of both the restriction districts and the proportion of restricted automobiles. A bi-level programming model was proposed to model the ATR scheme optimization problem by aiming at consumer surplus maximization and overload flow minimization at the upper-level model. At the lower-level model, elastic demand, mode choice and multi-class user equilibrium assignment were synthetically optimized. A genetic algorithm involving prolonging codes was constructed, demonstrating high computing efficiency in that it dynamically includes newly-appearing overload links in the codes so as to reduce the subsequent searching range. Moreover,practical processing approaches were suggested, which may improve the operability of the model-based solutions.
基金This work was partially supported by the National Natural Science Foundation of China(Nos.11271391 and 10831009)d the Natural Science Foundation of Chongqing(CSTC,No.2011BA0030).
文摘In this paper,we point out some deficiencies in a recent paper(Lee and Kim in J.Nonlinear Convex Anal.13:599–614,2012),and we establish strong duality and converse duality theorems for two types of nondifferentiable higher-order symmetric duals multiobjective programming involving cones.
