The present paper deals with a multiobjective optimization of truss topology by either Sequential Linear Programming （SLP） method or Linear Programming （LP） method. The ground structure approach is often used to s...The present paper deals with a multiobjective optimization of truss topology by either Sequential Linear Programming （SLP） method or Linear Programming （LP） method. The ground structure approach is often used to solve this kind of design problems. In this paper, the topology optimization is formulated as a Multiobjective Optimization Problem （MOP）, which is to find the cross-sectional area of truss members, such that both the total volume of members and the weighted mean compliance are minimized. Based upon the Karush-Kuhn-Tucker conditions （the optimality condition）, the Pareto optimal front of this problem can be obtained theoretically. The truss topology optimization under multiple load cases can be solved by the SLP. On the other hand, the LP such as the Simplex method or the interior point method can be applied to find one of the Pareto optimal solutions of the MOP under single load case. The applications of either the SLP or the LP are illustrated in numerical examples with discussion on characteristics of design results.展开更多
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.展开更多
This paper presents an efficient method for globally optimizing and automating component sizing for rotary traveling wave oscillator arrays. The lumped equivalent model of transmission lines loaded by inverter pairs i...This paper presents an efficient method for globally optimizing and automating component sizing for rotary traveling wave oscillator arrays. The lumped equivalent model of transmission lines loaded by inverter pairs is evaluated and posynomial functions for oscillation frequency, power dissipation, phase noise, etc. are formulated using transmission line theory. The re- sulting design problem can be posed as a geometric programJning problem, which can be efficiently solved with a convex opti- mization solver. The proposed method can compute the global optima more efficiently than the traditional iterative scheme and various design problems can be solved with the same circuit model. The globally optimal trade-off curves between competing objectives are also computed to carry out robust designs and quickly explore the design space.展开更多
文摘The present paper deals with a multiobjective optimization of truss topology by either Sequential Linear Programming （SLP） method or Linear Programming （LP） method. The ground structure approach is often used to solve this kind of design problems. In this paper, the topology optimization is formulated as a Multiobjective Optimization Problem （MOP）, which is to find the cross-sectional area of truss members, such that both the total volume of members and the weighted mean compliance are minimized. Based upon the Karush-Kuhn-Tucker conditions （the optimality condition）, the Pareto optimal front of this problem can be obtained theoretically. The truss topology optimization under multiple load cases can be solved by the SLP. On the other hand, the LP such as the Simplex method or the interior point method can be applied to find one of the Pareto optimal solutions of the MOP under single load case. The applications of either the SLP or the LP are illustrated in numerical examples with discussion on characteristics of design results.
基金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.
基金Project (No 20060335065) supported by the Specialized Research Fund for the Doctoral Program of Higher Education of Ministry of Education, China
文摘This paper presents an efficient method for globally optimizing and automating component sizing for rotary traveling wave oscillator arrays. The lumped equivalent model of transmission lines loaded by inverter pairs is evaluated and posynomial functions for oscillation frequency, power dissipation, phase noise, etc. are formulated using transmission line theory. The re- sulting design problem can be posed as a geometric programJning problem, which can be efficiently solved with a convex opti- mization solver. The proposed method can compute the global optima more efficiently than the traditional iterative scheme and various design problems can be solved with the same circuit model. The globally optimal trade-off curves between competing objectives are also computed to carry out robust designs and quickly explore the design space.
