期刊文献+
共找到5篇文章
< 1 >
每页显示 20 50 100
二叉判定图最优化算法研究综述 被引量:5
1
作者 王明全 于海斌 王宏 《信息与控制》 CSCD 北大核心 2004年第5期567-572,共6页
对近年来二叉判定图 (BDD)最优化算法的成果和发展趋势进行了综述和讨论 ,重点介绍精确排序算法和动态启发式排序算法 .给出了BDD优化算法的改进建议 :用不完全枚举法的优势和随机过程动态规划策略改进BDD优化算法 .
关键词 二叉判定图 解最优化算法 情况精确排序算法 动态启发式排序算法
下载PDF
Multi-objective optimization for draft scheduling of hot strip mill 被引量:2
2
作者 李维刚 刘相华 郭朝晖 《Journal of Central South University》 SCIE EI CAS 2012年第11期3069-3078,共10页
A multi-objective optimization model for draft scheduling of hot strip mill was presented, rolling power minimizing, rolling force ratio distribution and good strip shape as the objective functions. A multi-objective ... A multi-objective optimization model for draft scheduling of hot strip mill was presented, rolling power minimizing, rolling force ratio distribution and good strip shape as the objective functions. A multi-objective differential evolution algorithm based on decomposition (MODE/D). The two-objective and three-objective optimization experiments were performed respectively to demonstrate the optimal solutions of trade-off. The simulation results show that MODE/D can obtain a good Pareto-optimal front, which suggests a series of alternative solutions to draft scheduling. The extreme Pareto solutions are found feasible and the centres of the Pareto fronts give a good compromise. The conflict exists between each two ones of three objectives. The final optimal solution is selected from the Pareto-optimal front by the importance of objectives, and it can achieve a better performance in all objective dimensions than the empirical solutions. Finally, the practical application cases confirm the feasibility of the multi-objective approach, and the optimal solutions can gain a better rolling stability than the empirical solutions, and strip flatness decreases from (0± 63) IU to (0±45) IU in industrial production. 展开更多
关键词 hot strip mill draft scheduling multi-objective optimization multi-objective differential evolution algorithm based ondecomposition (MODE/D) Pareto-optimal front
下载PDF
Layout problem of multi-component systems arising for improving maintainability 被引量:5
3
作者 罗旭 杨拥民 +2 位作者 葛哲学 温熙森 官凤娇 《Journal of Central South University》 SCIE EI CAS 2014年第5期1833-1841,共9页
To improve the mainlainability design efficiency and quality, a layout optimization method for maintainability of multi-component systems was proposed. The impact of the component layout design on system maintainabili... To improve the mainlainability design efficiency and quality, a layout optimization method for maintainability of multi-component systems was proposed. The impact of the component layout design on system maintainability was analyzed, and the layout problem for maintainability was presented. It was formulated as an optimization problem, where maintainability, layout space and distance requirement were formulated as objective functions. A multi-objective particle swarm optimization algorithm, in which the constrained-domination relationship and the update strategy of the global best were simply modified, was then used to obtain Pareto optimal solutions for the maintainability layout design problem. Finally, application in oxygen generation system of a spacecraft was studied in detail to illustrate the effectiveness and usefulness of the proposed method. The results show that the concurrent maintainability design can be carried out during the layout design process by solving the layout optimization problem for maintainability. 展开更多
关键词 MAINTAINABILITY layout problem OPTIMIZATION multi-component system multi-objective particle swarm optimization
下载PDF
Modified constriction particle swarm optimization algorithm 被引量:4
4
作者 Zhe Zhang Limin Jia Yong Qin 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2015年第5期1107-1113,共7页
To deal with the demerits of constriction particle swarm optimization(CPSO), such as relapsing into local optima, slow convergence velocity, a modified CPSO algorithm is proposed by improving the velocity update formu... To deal with the demerits of constriction particle swarm optimization(CPSO), such as relapsing into local optima, slow convergence velocity, a modified CPSO algorithm is proposed by improving the velocity update formula of CPSO. The random velocity operator from local optima to global optima is added into the velocity update formula of CPSO to accelerate the convergence speed of the particles to the global optima and reduce the likelihood of being trapped into local optima. Finally the convergence of the algorithm is verified by calculation examples. 展开更多
关键词 particle swarm optimization random speed operator CONVERGENCE global optima
原文传递
Robust optimization of nonlinear impulsive rendezvous with uncertainty 被引量:2
5
作者 LUO YaZhong YANG Zhen LI HengNian 《Science China(Physics,Mechanics & Astronomy)》 SCIE EI CAS 2014年第4期731-740,共10页
The optimal rendezvous trajectory designs in many current research efforts do not incorporate the practical uncertainties into the closed loop of the design.A robust optimization design method for a nonlinear rendezvo... The optimal rendezvous trajectory designs in many current research efforts do not incorporate the practical uncertainties into the closed loop of the design.A robust optimization design method for a nonlinear rendezvous trajectory with uncertainty is proposed in this paper.One performance index related to the variances of the terminal state error is termed the robustness performance index,and a two-objective optimization model(including the minimum characteristic velocity and the minimum robustness performance index)is formulated on the basis of the Lambert algorithm.A multi-objective,non-dominated sorting genetic algorithm is employed to obtain the Pareto optimal solution set.It is shown that the proposed approach can be used to quickly obtain several inherent principles of the rendezvous trajectory by taking practical errors into account.Furthermore,this approach can identify the most preferable design space in which a specific solution for the actual application of the rendezvous control should be chosen. 展开更多
关键词 rendezvous and docking UNCERTAINTY robust optimization multi-objective evolutionary algorithm
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部