QQ客服 官方微博 反馈留言

	聚合物品牌切换轨线优化问题的三段式动态规划算法（英文）
	魏宇杰 ; 江永亨 ; 黄德先 ; Yujie Wei ; Yongheng Jiang ; Dexian Huang
	2016-03-30 ; 2016-03-30
关键词	Gradetransition trajectory optimization Adaptivegrid allocation Heuristic modifications Three-section dynamic programming Three-stage decomposition model TQ015 O631.5
其他题名	A Three-section Algorithm of Dynamic Programming Based on Three-stage Decomposition System Model for Grade Transition Trajectory Optimization Problems
中文摘要	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.; 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.
语种	英语 ; 英语
内容类型	期刊论文
源URL	[http://ir.lib.tsinghua.edu.cn/ir/item.do?handle=123456789/147169]
专题	清华大学
推荐引用方式 GB/T 7714	魏宇杰,江永亨,黄德先,等. 聚合物品牌切换轨线优化问题的三段式动态规划算法（英文）[J],2016, 2016.
APA	魏宇杰,江永亨,黄德先,Yujie Wei,Yongheng Jiang,&Dexian Huang.(2016).聚合物品牌切换轨线优化问题的三段式动态规划算法（英文）..
MLA	魏宇杰,et al."聚合物品牌切换轨线优化问题的三段式动态规划算法（英文）".(2016).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。