期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
基于增量式拟进化规划算法的TE模式切换最小时间动态优化
1
作者 郭轩 杜文莉 钱锋 《华东理工大学学报(自然科学版)》 CAS CSCD 北大核心 2013年第1期71-76,94,共7页
以往对聚烯烃牌号切换的优化一般采用序列二次规划和迭代动态规划方法。本文针对不同成分产品之间的切换问题,建立两层控制结构的牌号切换系统:回路控制层和牌号切换层,通过控制变量参数方法转化为带有约束的非线性规划问题。针对该问... 以往对聚烯烃牌号切换的优化一般采用序列二次规划和迭代动态规划方法。本文针对不同成分产品之间的切换问题,建立两层控制结构的牌号切换系统:回路控制层和牌号切换层,通过控制变量参数方法转化为带有约束的非线性规划问题。针对该问题控制变量轨迹的特性,提出一种增量式的拟进化规划方法(IEA)。对于最小时间优化问题,采用双层优化策略:内层以某个给定末端时间产生可行解,搜索可行域;根据内层可行域的大小,收缩末端时间。将该方法应用于TE仿真系统,得到TE模型两种不同生产状态之间切换的最小时间和切换过程中操作变量的轨迹,验证了所提方法的有效性。 展开更多
关键词 牌号切换 TE模型 增量式拟进化规划 最小时间优化 双层优化策略(DLOA)
下载PDF
Optimization Route Algorithm Based on the Minimal Transfer Time and Distance
2
作者 胡红萍 赵敏 白艳萍 《Journal of Measurement Science and Instrumentation》 CAS 2011年第4期333-336,共4页
The transfer system,an important subsystem in urban citizen passenger transport system,is a guarantee of public transport priority and is crucial in the whole urban passenger transport traffic.What the majority of bus... The transfer system,an important subsystem in urban citizen passenger transport system,is a guarantee of public transport priority and is crucial in the whole urban passenger transport traffic.What the majority of bus passengers consider is the convenience and comfort of the bus ride,which reduces the transfer time of bus passengers."Transfer time" is considered to be the first factor by the majority of bus passengers who select the routes.In this paper,according to the needs of passengers,optimization algorithm,with the minimal distance being the first goal,namely,the improved Dijkstra algorithm based on the minimal distance,is put forward on the basis of the optimization algorithm with the minimal transfer time being the first goal. 展开更多
关键词 TRANSFER DISTANCE optimization route
下载PDF
Improved twin support vector machine 被引量:6
3
作者 TIAN YingJie JU XuChan +1 位作者 QI ZhiQuan SHI Yong 《Science China Mathematics》 SCIE 2014年第2期417-432,共16页
We improve the twin support vector machine(TWSVM)to be a novel nonparallel hyperplanes classifier,termed as ITSVM(improved twin support vector machine),for binary classification.By introducing the diferent Lagrangian ... We improve the twin support vector machine(TWSVM)to be a novel nonparallel hyperplanes classifier,termed as ITSVM(improved twin support vector machine),for binary classification.By introducing the diferent Lagrangian functions for the primal problems in the TWSVM,we get an improved dual formulation of TWSVM,then the resulted ITSVM algorithm overcomes the common drawbacks in the TWSVMs and inherits the essence of the standard SVMs.Firstly,ITSVM does not need to compute the large inverse matrices before training which is inevitable for the TWSVMs.Secondly,diferent from the TWSVMs,kernel trick can be applied directly to ITSVM for the nonlinear case,therefore nonlinear ITSVM is superior to nonlinear TWSVM theoretically.Thirdly,ITSVM can be solved efciently by the successive overrelaxation(SOR)technique or sequential minimization optimization(SMO)method,which makes it more suitable for large scale problems.We also prove that the standard SVM is the special case of ITSVM.Experimental results show the efciency of our method in both computation time and classification accuracy. 展开更多
关键词 support vector machine twin support vector machine nonparallel structural risk minimization CLASSIFICATION
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部