期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Learning control of fermentation process with an improved DHP algorithm
1
作者 Dazi Li Ningjia Meng Tianheng Song 《Chinese Journal of Chemical Engineering》 SCIE EI CAS CSCD 2016年第10期1399-1405,共7页
Control of the fed-batch ethanol fermentation processes to produce maximum product ethanol is one of the key issues in the bioreactor system.However,ethanol fermentation processes exhibit complex behavior and nonlinea... Control of the fed-batch ethanol fermentation processes to produce maximum product ethanol is one of the key issues in the bioreactor system.However,ethanol fermentation processes exhibit complex behavior and nonlinear dynamics with respect to the cell mass,substrate,feed-rate,etc.An improved dual heuristic programming algorithm based on the least squares temporal difference with gradient correction(LSTDC) algorithm(LSTDC-DHP) is proposed to solve the learning control problem of a fed-batch ethanol fermentation process.As a new algorithm of adaptive critic designs,LSTDC-DHP is used to realize online learning control of chemical dynamical plants,where LSTDC is commonly employed to approximate the value functions.Application of the LSTDC-DHP algorithm to ethanol fermentation process can realize efficient online learning control in continuous spaces.Simulation results demonstrate the effectiveness of LSTDC-DHP,and show that LSTDC-DHP can obtain the near-optimal feed rate trajectory faster than other-based algorithms. 展开更多
关键词 Dual heuristic programming Batch process Ethanol fermentation process Learning control
下载PDF
Improved Estimation of Distribution Algorithm for Solving Unrelated Parallel Machine Scheduling Problem
2
作者 孙泽文 顾幸生 《Journal of Donghua University(English Edition)》 EI CAS 2016年第5期797-802,共6页
Scheduling problem is a well-known combinatorial optimization problem.An effective improved estimation of distribution algorithm(IEDA) was proposed for minimizing the makespan of the unrelated parallel machine schedul... Scheduling problem is a well-known combinatorial optimization problem.An effective improved estimation of distribution algorithm(IEDA) was proposed for minimizing the makespan of the unrelated parallel machine scheduling problem(UPMSP).Mathematical description was given for the UPMSP.The IEDA which was combined with variable neighborhood search(IEDA_VNS) was proposed to solve the UPMSP in order to improve local search ability.A new encoding method was designed for representing the feasible solutions of the UPMSP.More knowledge of the UPMSP were taken consideration in IEDA_ VNS for probability matrix which was based the processing time matrix.The simulation results show that the proposed IEDA_VNS can solve the problem effectively. 展开更多
关键词 Scheduling neighborhood scheduling minimizing processed unrelated probabilistic intelligent heuristic representing
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部