期刊文献+
共找到9,147篇文章
< 1 2 250 >
每页显示 20 50 100
Developed Time-OptimalModel Predictive Static Programming Method with Fish Swarm Optimization for Near-Space Vehicle
1
作者 Yuanzhuo Wang Honghua Dai 《Computer Modeling in Engineering & Sciences》 2025年第5期1463-1484,共22页
To establish the optimal reference trajectory for a near-space vehicle under free terminal time,a time-optimal model predictive static programming method is proposed with adaptive fish swarm optimization.First,the mod... To establish the optimal reference trajectory for a near-space vehicle under free terminal time,a time-optimal model predictive static programming method is proposed with adaptive fish swarm optimization.First,the model predictive static programming method is developed by incorporating neighboring terms and trust region,enabling rapid generation of precise optimal solutions.Next,an adaptive fish swarm optimization technique is employed to identify a sub-optimal solution,while a momentum gradient descent method with learning rate decay ensures the convergence to the global optimal solution.To validate the feasibility and accuracy of the proposed method,a near-space vehicle example is analyzed and simulated during its glide phase.The simulation results demonstrate that the proposed method aligns with theoretical derivations and outperforms existing methods in terms of convergence speed and accuracy.Therefore,the proposed method offers significant practical value for solving the fast trajectory optimization problem in near-space vehicle applications. 展开更多
关键词 Near-space vehicle model predictive static programming neighboring term and trust region optimal control adaptive fish swarm optimization
在线阅读 下载PDF
Mixed integer programming modeling for the satellite three-dimensional component assignment and layout optimization problem
2
作者 Yufeng XIA Xianqi CHEN +3 位作者 Zhijia LIU Weien ZHOU Wen YAO Zhongneng ZHANG 《Chinese Journal of Aeronautics》 2025年第6期427-447,共21页
Satellite Component Layout Optimization(SCLO) is crucial in satellite system design.This paper proposes a novel Satellite Three-Dimensional Component Assignment and Layout Optimization(3D-SCALO) problem tailored to en... Satellite Component Layout Optimization(SCLO) is crucial in satellite system design.This paper proposes a novel Satellite Three-Dimensional Component Assignment and Layout Optimization(3D-SCALO) problem tailored to engineering requirements, aiming to optimize satellite heat dissipation while considering constraints on static stability, 3D geometric relationships between components, and special component positions. The 3D-SCALO problem is a challenging bilevel combinatorial optimization task, involving the optimization of discrete component assignment variables in the outer layer and continuous component position variables in the inner layer,with both influencing each other. To address this issue, first, a Mixed Integer Programming(MIP) model is proposed, which reformulates the original bilevel problem into a single-level optimization problem, enabling the exploration of a more comprehensive optimization space while avoiding iterative nested optimization. Then, to model the 3D geometric relationships between components within the MIP framework, a linearized 3D Phi-function method is proposed, which handles non-overlapping and safety distance constraints between cuboid components in an explicit and effective way. Subsequently, the Finite-Rectangle Method(FRM) is proposed to manage 3D geometric constraints for complex-shaped components by approximating them with a finite set of cuboids, extending the applicability of the geometric modeling approach. Finally, the feasibility and effectiveness of the proposed MIP model are demonstrated through two numerical examples"and a real-world engineering case, which confirms its suitability for complex-shaped components and real engineering applications. 展开更多
关键词 Mixed integer programming modeling Three-dimensional component assignment Layout optimization Phi-function Finite-rectangle method
原文传递
Peak-heat-flux entry test trajectory optimization by disjunctive programming
3
作者 Zexiao DENG Luhua LIU 《Chinese Journal of Aeronautics》 2025年第11期207-227,共21页
To evaluate the heat performance of the lifting-body entry vehicle during the hypersonic gliding phase,entry flight heat tests involving the determination of the maximum peak-heat-flux entry trajectory with complex co... To evaluate the heat performance of the lifting-body entry vehicle during the hypersonic gliding phase,entry flight heat tests involving the determination of the maximum peak-heat-flux entry trajectory with complex constraints are essential.A significant obstacle is the uncertainty of passage time or energy states of the maximum peak entry heat flux point and waypoints.This paper showcases an endeavour to leverage disjunctive programming and combinatorial theory for the max-max type(maximum peak-heat-flux)Entry Trajectory Optimization(ETO)problems with complex constraints such as dynamic pressure,normal load,waypoints,and no-fly zones.The concept of a"generalized waypoint"is introduced,and the maximum peak-heat-flux point is regarded as a"generalized waypoint".Through the application of propositional calculus rules,the derivation of generalized waypoints incorporating various physical quantities and magnitudes such as heat flux density,longitude,and latitude is actualized in one disjunctive normal form,enabling resolution via a unified method.Consequently,a novel method based on combinatorial prior rules is proposed,utilizing Successive Mixed-Integer Nonlinear Programming(SMINLP)to optimize various heat entry test flight trajectories.Numerical experiments are provided to show the computational accuracy,stability,and adaptability of the proposed method in solving maxmax type entry optimal control problems. 展开更多
关键词 Disjunctive programming Entry trajectory optimization Max-max type cost function Peak-heat-flux test trajectory Waypoint constraints
原文传递
Anti-interference beam pattern design based on second-order cone programming optimization 被引量:1
4
作者 戴文舒 鲍凯凯 +1 位作者 王萍 王黎明 《Journal of Measurement Science and Instrumentation》 CAS CSCD 2016年第3期255-260,共6页
When signal-to-interference ratio is low, the energy of strong interference leaked from the side lobe of beam pattern will infect the detection of weak target. Therefore, the beam pattern needs to be op... When signal-to-interference ratio is low, the energy of strong interference leaked from the side lobe of beam pattern will infect the detection of weak target. Therefore, the beam pattern needs to be optimized. The existing Dolph-Chebyshev weighting method can get the lowest side lobe level under given main lobe width, but for the other non-uniform circular array and nonlinear array, the low side lobe pattern needs to be designed specially. The second order cone programming optimization (SOCP) algorithm proposed in the paper transforms the optimization of the beam pattern into a standard convex optimization problem. Thus there is a paradigm to follow for any array formation, which not only achieves the purpose of Dolph-Chebyshev weighting, but also solves the problem of the increased side lobe when the signal is at end fire direction The simulation proves that the SOCP algorithm can detect the weak target better than the conventional beam forming. 展开更多
关键词 anti-interference beam pattern second-order cone programming optimization (SOCP) weak signal detection
在线阅读 下载PDF
Designing and Optimization of an Off-line Programming System for Robotic Belt Grinding Process 被引量:12
5
作者 WANG Wei YUN Chao +1 位作者 ZHANG Ling GAO Zhihui 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2011年第4期647-655,共9页
Off-line programming (OLP) system becomes one of the most important programming modules for the robotic belt grinding process, however there lacks research on increasing the grinding dexterous space depending on the... Off-line programming (OLP) system becomes one of the most important programming modules for the robotic belt grinding process, however there lacks research on increasing the grinding dexterous space depending on the OLP system. A new type of grinding robot and a novel robotic belt grinding workcell are forwarded, and their features are briefly introduced. An open and object-oriented off-line programming system is developed for this robotic belt grinding system. The parameters of the trimmed surface are read from the initial graphics exchange specification (IGES) file of the CAD model of the workpiece. The deBoor-Cox basis function is used to sample the grinding target with local contact frame on the workpiece. The numerical formula of inverse kinematics is set up based on Newton's iterative procedure, to calculate the grinding robot configurations corresponding to the grinding targets. After the grinding path is obtained, the OLP system turns to be more effective than the teach-by-showing system. In order to improve the grinding workspace, an optimization algorithm for dynamic tool frame is proposed and performed on the special robotic belt grinding system. The initial tool frame and the interval of neighboring tool frames are defined as the preparation of the algorithm. An optimized tool local frame can be selected to grind the complex surface for a maximum dexterity index of the robot. Under the optimization algorithm, a simulation of grinding a vane is included and comparison of grinding workspace is done before and after the tool frame optimization. By the algorithm, the grinding workspace can be enlarged. Moreover the dynamic tool frame can be considered to add one degree-of-freedom to the grinding kinematical chain, which provides the theoretical support for the improvement of robotic dexterity for the complex surface grinding. 展开更多
关键词 off-line programming robotic belt grinding path generation tool optimization
在线阅读 下载PDF
A hybrid genetic algorithm to the program optimization model based on a heterogeneous network
6
作者 CHEN Hang DOU Yajie +3 位作者 CHEN Ziyi JIA Qingyang ZHU Chen CHEN Haoxuan 《Journal of Systems Engineering and Electronics》 2025年第4期994-1005,共12页
Project construction and development are an impor-tant part of future army designs.In today’s world,intelligent war-fare and joint operations have become the dominant develop-ments in warfare,so the construction and ... Project construction and development are an impor-tant part of future army designs.In today’s world,intelligent war-fare and joint operations have become the dominant develop-ments in warfare,so the construction and development of the army need top-down,top-level design,and comprehensive plan-ning.The traditional project development model is no longer suf-ficient to meet the army’s complex capability requirements.Projects in various fields need to be developed and coordinated to form a joint force and improve the army’s combat effective-ness.At the same time,when a program consists of large-scale project data,the effectiveness of the traditional,precise mathe-matical planning method is greatly reduced because it is time-consuming,costly,and impractical.To solve above problems,this paper proposes a multi-stage program optimization model based on a heterogeneous network and hybrid genetic algo-rithm and verifies the effectiveness and feasibility of the model and algorithm through an example.The results show that the hybrid algorithm proposed in this paper is better than the exist-ing meta-heuristic algorithm. 展开更多
关键词 program optimization heterogeneous network genetic algorithm portfolio selection.
在线阅读 下载PDF
A Green Mixed Integer Linear Programming Model for Optimization of Byproduct Gases in Iron and Steel Industry 被引量:10
7
作者 Hai-ning KONG 《Journal of Iron and Steel Research International》 SCIE EI CAS CSCD 2015年第8期681-685,共5页
Byproduct gas is an important secondary energy in iron and steel industry, and its optimization is vital to cost reduction. With the development of iron and steel industry to be more eco-friendly, it is necessary to c... Byproduct gas is an important secondary energy in iron and steel industry, and its optimization is vital to cost reduction. With the development of iron and steel industry to be more eco-friendly, it is necessary to construct an integrated optimized system, taking economics, energy consumption and environment into consideration. Therefore, the environmental cost caused by pollutants discharge should be factored in total cost when optimizing byproduct gas distribution. A green mixed integer linear programming (MILP) model for the optimization of byproduct gases was established to reduce total cost, including both operation cost and environmental cost. The operation cost included penalty for gas deviation, costs of fuel and water consumption, holder booster trip penalty, and so forth; while the environmental cost consisted of penalties for both direct and indirect pollutants discharge. Case study showed that the proposed model brought an optimum solution and 2.2% of the total cost could be reduced compared with previous one. 展开更多
关键词 green mixed integer linear programming environmental cost optimization iron and steel industry byproduct gas
原文传递
Hybrid particle swarm optimization with chaotic search for solving integer and mixed integer programming problems 被引量:21
8
作者 谭跃 谭冠政 邓曙光 《Journal of Central South University》 SCIE EI CAS 2014年第7期2731-2742,共12页
A novel chaotic search method is proposed,and a hybrid algorithm combining particle swarm optimization(PSO) with this new method,called CLSPSO,is put forward to solve 14 integer and mixed integer programming problems.... A novel chaotic search method is proposed,and a hybrid algorithm combining particle swarm optimization(PSO) with this new method,called CLSPSO,is put forward to solve 14 integer and mixed integer programming problems.The performances of CLSPSO are compared with those of other five hybrid algorithms combining PSO with chaotic search methods.Experimental results indicate that in terms of robustness and final convergence speed,CLSPSO is better than other five algorithms in solving many of these problems.Furthermore,CLSPSO exhibits good performance in solving two high-dimensional problems,and it finds better solutions than the known ones.A performance index(PI) is introduced to fairly compare the above six algorithms,and the obtained values of(PI) in three cases demonstrate that CLSPSO is superior to all the other five algorithms under the same conditions. 展开更多
关键词 particle swarm optimization chaotic search integer programming problem mixed integer programming problem
在线阅读 下载PDF
Magneto-soft robots based on multi-materials optimizing and heat-assisted in-situ magnetic domains programming
9
作者 Fuzhou Niu Quhao Xue +9 位作者 Qing Cao Xinyang He Taolei Wang HaoChen Wang Chonglei Hao Xiaojian Li Ying Li Hao Yang Huayong Yang Dong Han 《International Journal of Extreme Manufacturing》 2025年第5期447-462,共16页
Soft robots, inspired by the flexibility and versatility of biological organisms, have potential in a variety of applications. Recent advancements in magneto-soft robots have demonstrated their abilities to achieve pr... Soft robots, inspired by the flexibility and versatility of biological organisms, have potential in a variety of applications. Recent advancements in magneto-soft robots have demonstrated their abilities to achieve precise remote control through magnetic fields, enabling multi-modal locomotion and complex manipulation tasks. Nonetheless, two main hurdles must be overcome to advance the field: developing a multi-component substrate with embedded magnetic particles to ensure the requisite flexibility and responsiveness, and devising a cost-effective,straightforward method to program three-dimensional distributed magnetic domains without complex processing and expensive machinery. Here, we introduce a cost-effective and simple heat-assisted in-situ integrated molding fabrication method for creating magnetically driven soft robots with three-dimensional programmable magnetic domains. By synthesizing a composite material with neodymium-iron-boron(NdFeB) particles embedded in a polydimethylsiloxane(PDMS) and Ecoflex matrix(PDMS:Ecoflex = 1:2 mass ratio, 50% magnetic particle concentration), we achieved an optimized balance of flexibility, strength, and magnetic responsiveness. The proposed heat-assisted in-situ magnetic domains programming technique,performed at an experimentally optimized temperature of 120℃, resulted in a 2 times magnetization strength(9.5 mT) compared to that at 20℃(4.8 m T), reaching a saturation level comparable to a commercial magnetizer. We demonstrated the versatility of our approach through the fabrication of six kinds of robots, including two kinds of two-dimensional patterned soft robots(2D-PSR), a circular six-pole domain distribution magnetic robot(2D-CSPDMR), a quadrupedal walking magnetic soft robot(QWMSR), an object manipulation robot(OMR), and a hollow thin-walled spherical magneto-soft robot(HTWSMSR). The proposed method provides a practical solution to create highly responsive and adaptable magneto-soft robots. 展开更多
关键词 magneto-soft robots multi-materials optimizing three-dimensional magnetic domains programming
在线阅读 下载PDF
Optimization Method of Teaching Program under the Concept of Sustainable Environmental Development of Renewable Energy Based on Artificial Intelligence Internet
10
作者 Bevl Naidu Krishna Babu Sambaru +3 位作者 Guru Prasad Pasumarthi Romala Vijaya Srinivas K.Srinivasa Krishna V.Purna Kumari Pechetty 《Journal of Environmental & Earth Sciences》 2025年第7期171-184,共14页
The increasing global demand for energy,coupled with concerns about environmental sustainability,has underscored the need for a transition toward renewable energy sources.A well-structured teaching program under the f... The increasing global demand for energy,coupled with concerns about environmental sustainability,has underscored the need for a transition toward renewable energy sources.A well-structured teaching program under the framework of sustainable development in renewable energy seeks to give students the information,abilities,and critical thinking needed to solve energy-related problems sustainably.This research proposes AI-powered personalized learning,innovative real-time integration of diverse data,and adaptive teaching strategies to enhance student understanding regarding renewable energy concepts.The sheep flock-optimized innovative recurrent neural network(SFO-IRNN)will recommend relevant topics and resources based on students’performance.Renewable energy teaching data from assessmethments are combined with real-time IoT-based renewable energy data.This dataset contains renewable energy education using AI-driven teaching methods and internet-based learning.The data was preprocessed by handling missing values and min-max scaling.The data features were extracted using Fourier Transform(FT).Further application of 10-fold cross-validation will increase the reliability of the model as it can evaluate its performance metrics like accuracy,F1-score,recall,and precision on different subsets of student data,which improves its robustness and prevents overfitting.The findings showed that the proposed method is significantly better,which ensures that the students have a deeper theoretical and practical understanding of renewable energy technologies.In addition,integrating real-time IoT data from renewable energy sources gives students a chance to do live simulations and problems that would enhance analytical thinking and hands-on learning.The research shows that AI provides context-aware guidance on sustainable energy infrastructure,enhancing interactive and personalized learning. 展开更多
关键词 Teaching program Artificial Intelligence(AI) SUSTAINABILITY Sheep Flock optimized Innovative Recurrent Neural Network(SFO-IRNN) Renewable Energy Environmental
在线阅读 下载PDF
Model-Free Coordinated Optimal Regulation for Rigidly Connected Dual-PMSM Systems via Adaptive Dynamic Programming
11
作者 Jianguo Zhao Linna Zhou +2 位作者 Weinan Gao Hai Wang Chunyu Yang 《IEEE/CAA Journal of Automatica Sinica》 2025年第10期2138-2149,共12页
In this article,a novel model-free coordinated optimal regulation design methodology is proposed for the rigidly connected dual permanent magnet synchronous motor(PMSM)system via adaptive dynamic programming(ADP).Firs... In this article,a novel model-free coordinated optimal regulation design methodology is proposed for the rigidly connected dual permanent magnet synchronous motor(PMSM)system via adaptive dynamic programming(ADP).First,we adopt the classical master-slave structure to maintain torque synchronization by virtue of field-oriented control.Then,a reducedorder model of the dual-PMSM system is established through the application of singular perturbation theory(SPT),which is of significance to decrease the learning time and computational complexity in the outer speed loop design.Afterwards,we design a coordinated adaptive optimal regulator in framework of ADP to drive the speed of girth gear asymptotic tracking the reference signal and accommodate the load torque disturbance,which is independent of the knowledge of model parameters of the system.According to SPT,we analyze the suboptimality,closed-loop stability,and robustness properties of the obtained controller under mild conditions.Finally,comprehensive experimental studies are provided to verify that the proposed control strategy can achieve the speed regulation and the torque synchronization,as well as ameliorate the transient response. 展开更多
关键词 Adaptive dynamic programming(ADP) optimal control output regulation permanent magnet synchronous motor(PMSM) singular perturbation theory(SPT)
在线阅读 下载PDF
Optimization of circulating cooling water systems based on chance constrained programming 被引量:5
12
作者 Bo Liu Yufei Wang Xiao Feng 《Chinese Journal of Chemical Engineering》 SCIE EI CAS CSCD 2021年第12期167-178,共12页
Recent research on deterministic methods for circulating cooling water systems optimization has been well developed. However, the actual operating conditions of the system are mostly variable, so the system obtained u... Recent research on deterministic methods for circulating cooling water systems optimization has been well developed. However, the actual operating conditions of the system are mostly variable, so the system obtained under deterministic conditions may not be stable and economical. This paper studies the optimization of circulating cooling water systems under uncertain circumstance. To improve the reliability of the system and reduce the water and energy consumption, the influence of different uncertain parameters is taken into consideration. The chance constrained programming method is used to build a model under uncertain conditions, where the confidence level indicates the degree of constraint violation. Probability distribution functions are used to describe the form of uncertain parameters. The objective is to minimize the total cost and obtain the optimal cooling network configuration simultaneously.An algorithm based on Monte Carlo method is proposed, and GAMS software is used to solve the mixed integer nonlinear programming model. A case is optimized to verify the validity of the model. Compared with the deterministic optimization method, the results show that when considering the different types of uncertain parameters, a system with better economy and reliability can be obtained(total cost can be reduced at least 2%). 展开更多
关键词 Circulating cooling water system UNCERTAINTY Chance constrained programming DESIGN optimization SIMULATION
在线阅读 下载PDF
OPTIMIZATION OF THE TAKE-OFF MOVEMENT OF SKI JUMPING WITH THE METHOD OF MATHEMATICAL PROGRAMMING 被引量:1
13
作者 关汝华 李润 于立然 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 1992年第7期669-674,共6页
This paper is based on the finite and dispersed data which were obtained from the experiments of the wind tunnel and of the force measurement and from the high-speed photography. It analyses and optimizes the take-off... This paper is based on the finite and dispersed data which were obtained from the experiments of the wind tunnel and of the force measurement and from the high-speed photography. It analyses and optimizes the take-off movement of ski jumping with the theory of dynamics of systems of rigid bodies and with the method of mathematical programming. The paper describes the optimal take-off movement of ski jumping. Furthermore, it presents an example and compares the result with those of other papers published at home and abroad. The comparison shows that our computation and optimization are reasonable and well-grounded. 展开更多
关键词 Mathematical programming optimization Ski jumps
在线阅读 下载PDF
Novel integrated optimization algorithm for trajectory planning of robot manipulators based on integrated evolutionary programming 被引量:1
14
作者 XiongLUO XiaopingFAN HengZHANG TefangCHEN 《控制理论与应用(英文版)》 EI 2004年第4期319-331,共13页
Optimal trajectory planning for robot manipulators plays an important role in implementing the high productivity for robots. The performance indexes used in optimal trajectory planning are classified into two main cat... Optimal trajectory planning for robot manipulators plays an important role in implementing the high productivity for robots. The performance indexes used in optimal trajectory planning are classified into two main categories: optimum traveling time and optimum mechanical energy of the actuators. The current trajectory planning algorithms are designed based on one of the above two performance indexes. So far, there have been few planning algorithms designed to satisfy two performance indexes simultaneously. On the other hand, some deficiencies arise in the existing integrated optimi2ation algorithms of trajectory planning. In order to overcome those deficiencies, the integrated optimization algorithms of trajectory planning are presented based on the complete analysis for trajectory planning of robot manipulators. In the algorithm, two object functions are designed based on the specific weight coefficient method and ' ideal point strategy. Moreover, based on the features of optimization problem, the intensified evolutionary programming is proposed to solve the corresponding optimization model. Especially, for the Stanford Robot,the high-quality solutions are found at a lower cost. 展开更多
关键词 Trajectory planning Integrated optimization Evolutionary programming Robot manipulator
在线阅读 下载PDF
Two-stage robust optimization of power cost minimization problem in gunbarrel natural gas networks by approximate dynamic programming 被引量:1
15
作者 Yi-Ze Meng Ruo-Ran Chen Tian-Hu Deng 《Petroleum Science》 SCIE CAS CSCD 2022年第5期2497-2517,共21页
In short-term operation of natural gas network,the impact of demand uncertainty is not negligible.To address this issue we propose a two-stage robust model for power cost minimization problem in gunbarrel natural gas ... In short-term operation of natural gas network,the impact of demand uncertainty is not negligible.To address this issue we propose a two-stage robust model for power cost minimization problem in gunbarrel natural gas networks.The demands between pipelines and compressor stations are uncertain with a budget parameter,since it is unlikely that all the uncertain demands reach the maximal deviation simultaneously.During solving the two-stage robust model we encounter a bilevel problem which is challenging to solve.We formulate it as a multi-dimensional dynamic programming problem and propose approximate dynamic programming methods to accelerate the calculation.Numerical results based on real network in China show that we obtain a speed gain of 7 times faster in average without compromising optimality compared with original dynamic programming algorithm.Numerical results also verify the advantage of robust model compared with deterministic model when facing uncertainties.These findings offer short-term operation methods for gunbarrel natural gas network management to handle with uncertainties. 展开更多
关键词 Natural gas Gunbarrel gas pipeline networks Robust optimization Approximate dynamic programming
原文传递
A Three-section Algorithm of Dynamic Programming Based on Three-stage Decomposition System Model for Grade Transition Trajectory Optimization Problems
16
作者 魏宇杰 江永亨 黄德先 《Chinese Journal of Chemical Engineering》 SCIE EI CAS CSCD 2014年第10期1122-1130,共9页
This paper introduces a practical solving scheme of gradetransition trajectory optimization(GTTO) problems under typical certificate-checking–updating framework. Due to complicated kinetics of polymerization,differen... This paper introduces a practical solving scheme of gradetransition trajectory optimization(GTTO) problems under typical certificate-checking–updating framework. Due to complicated kinetics of polymerization,differential/algebraic equations(DAEs) always cause great computational burden and system non-linearity usually makes GTTO non-convex bearing multiple optima. Therefore, coupled with the three-stage decomposition model, a three-section algorithm of dynamic programming(TSDP) is proposed based on the general iteration mechanism of iterative programming(IDP) and incorporated with adaptivegrid allocation scheme and heuristic modifications. The algorithm iteratively performs dynamic programming with heuristic modifications under constant calculation loads and adaptively allocates the valued computational resources to the regions that can further improve the optimality under the guidance of local error estimates. TSDP is finally compared with IDP and interior point method(IP) to verify its efficiency of computation. 展开更多
关键词 Gradetransition TRAJECTORY optimization Adaptivegrid ALLOCATION HEURISTIC modifications Three-section dynamic programming Three-stage DECOMPOSITION model
在线阅读 下载PDF
METHOD BASED ON DUAL-QUADRATIC PROGRAMMING FOR FRAME STRUCTURAL OPTIMIZATION WITH LARGE SCALE
17
作者 隋允康 杜家政 郭英乔 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 2006年第3期383-391,共9页
The optimality criteria (OC) method and mathematical programming (MP) were combined to found the sectional optimization model of frame structures. Different methods were adopted to deal with the different constrai... The optimality criteria (OC) method and mathematical programming (MP) were combined to found the sectional optimization model of frame structures. Different methods were adopted to deal with the different constraints. The stress constraints as local constraints were approached by zero-order approximation and transformed into movable sectional lower limits with the full stress criterion. The displacement constraints as global constraints were transformed into explicit expressions with the unit virtual load method. Thus an approximate explicit model for the sectional optimization of frame structures was built with stress and displacement constraints. To improve the resolution efficiency, the dual-quadratic programming was adopted to transform the original optimization model into a dual problem according to the dual theory and solved iteratively in its dual space. A method called approximate scaling step was adopted to reduce computations and smooth the iterative process. Negative constraints were deleted to reduce the size of the optimization model. With MSC/Nastran software as structural solver and MSC/Patran software as developing platform, the sectional optimization software of frame structures was accomplished, considering stress and displacement constraints. The examples show that the efficiency and accuracy are improved. 展开更多
关键词 frame structures sectional optimization dual-quadratic programming approximate scaling step deletion of negative constraints
在线阅读 下载PDF
Optimization Design of Two-Stage Operational Amplifier with Frequency Compensation via Geometric Programming
18
作者 李丹 戎蒙恬 殳国华 《Journal of Shanghai Jiaotong university(Science)》 EI 2011年第6期648-651,共4页
An optimization design technique to obtain global solution for a two-stage operational amplifier(op-amp) with frequency compensation is presented.This frequency compensation technique can adjust the equivalent resista... An optimization design technique to obtain global solution for a two-stage operational amplifier(op-amp) with frequency compensation is presented.This frequency compensation technique can adjust the equivalent resistance to guarantee that the phase margin is stable even though circumstance temperature varies.Geometric programming is used to optimize the component values and transistor dimensions.It is used in this analog integrated circuit design to calculate these parameters automatically.This globally optimal amplifier obtains minimum power while other specifications are fulfilled. 展开更多
关键词 frequency compensation two-stage operational amplifier(op-amp) geometric programming global optimization
原文传递
Control strategy optimization using dynamic programming method for synergic electric system on hybrid electric vehicle
19
作者 Yuan-Bin Yu Qing-Nian Wang +2 位作者 Hai-Tao Min Peng-Yu Wang Chun-Guang Hao 《Natural Science》 2009年第3期222-228,共7页
Dynamic Programming (DP) algorithm is used to find the optimal trajectories under Beijing cycle for the power management of synergic electric system (SES) which is composed of battery and super capacitor. Feasible rul... Dynamic Programming (DP) algorithm is used to find the optimal trajectories under Beijing cycle for the power management of synergic electric system (SES) which is composed of battery and super capacitor. Feasible rules are derived from analyzing the optimal trajectories, and it has the highest contribution to Hybrid Electric Vehicle (HEV). The methods of how to get the best performance is also educed. Using the new Rule-based power management strat-egy adopted from the optimal results, it is easy to demonstrate the effectiveness of the new strategy in further improvement of the fuel economy by the synergic hybrid system. 展开更多
关键词 DYNAMIC programming Control STRATEGY optimization Synergic ELECTRIC System HEV
暂未订购
A Distributed DBMS Based Dynamic Programming Method for Query Optimization
20
作者 孙纪舟 李阳 +2 位作者 蒋志勇 顾云苏 何清法 《Journal of Donghua University(English Edition)》 EI CAS 2012年第1期55-58,共4页
Dynamic programming(DP) is an effective query optimization approach to select an appropriate join order for relational database management system(RDBMS) in multi-table joins. This method was extended and made availabl... Dynamic programming(DP) is an effective query optimization approach to select an appropriate join order for relational database management system(RDBMS) in multi-table joins. This method was extended and made available in distributed DBMS(D-DBMS). The structure of this optimal solution was firstly characterized according to the distributing status of tables and data, and then the recurrence relations between a problem and its sub-problems were recursively defined. DP in D-DBMS has the same time-complexity with that in centralized DBMS, while it has the capability to solve a much more sophisticated optimal problem of multi-table join in D-DBMS. The effectiveness of this optimal strategy has been proved by experiments. 展开更多
关键词 distributed database dynamic programming (DP) multitable loin: auery optimization
在线阅读 下载PDF
上一页 1 2 250 下一页 到第
使用帮助 返回顶部