A Three-section Algorithm of Dynamic Programming Based on Three-stage Decomposition System Model for Grade Transition Trajectory Optimization Problems

Yujie Wei; Yongheng Jiang; Dexian Huang

doi:10.1016/j.cjche.2014.09.002

Your Location：

Home >

Browse articles >

A Three-section Algorithm of Dynamic Programming Based on Three-stage Decomposition System Model for Grade Transition Trajectory Optimization Problems

过程系统工程与过程安全 | Updated：2026-01-06

- A Three-section Algorithm of Dynamic Programming Based on Three-stage Decomposition System Model for Grade Transition Trajectory Optimization Problems
- A Three-section Algorithm of Dynamic Programming Based on Three-stage Decomposition System Model for Grade Transition Trajectory Optimization Problems
- 中国化学工程学报（英文版） 2014年22卷第10期页码：1122-1130
- Affiliations：
  
  National Laboratory for Information Science and Technology, Department of Automation, Tsinghua University,Beijing,China,100084
- Author bio：
- Funds：
- DOI：10.1016/j.cjche.2014.09.002
  中图分类号：
- 纸质出版：2014
- Accepted：
Scan QR Code
Yujie Wei, Yongheng Jiang, Dexian Huang. A Three-section Algorithm of Dynamic Programming Based on Three-stage Decomposition System Model for Grade Transition Trajectory Optimization Problems[J]. 中国化学工程学报（英文版）, 2014,22(10):1122-1130.

Yujie Wei, Yongheng Jiang, Dexian Huang. A Three-section Algorithm of Dynamic Programming Based on Three-stage Decomposition System Model for Grade Transition Trajectory Optimization Problems[J]. , 2014, 22(10): 1122-1130.
Yujie Wei, Yongheng Jiang, Dexian Huang. A Three-section Algorithm of Dynamic Programming Based on Three-stage Decomposition System Model for Grade Transition Trajectory Optimization Problems[J]. 中国化学工程学报（英文版）, 2014,22(10):1122-1130. DOI： 10.1016/j.cjche.2014.09.002.

Yujie Wei, Yongheng Jiang, Dexian Huang. A Three-section Algorithm of Dynamic Programming Based on Three-stage Decomposition System Model for Grade Transition Trajectory Optimization Problems[J]. , 2014, 22(10): 1122-1130. DOI： 10.1016/j.cjche.2014.09.002.

摘要

Abstract

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.

关键词

Keywords

references

浏览量

Downloads

CSCD

文章被引用时，请邮件提醒。

Submit

工具集

关联资源

Revealing critical factors in lignite-water interactions: From atomic to macroscopic

Synergistic Ba/Na promotion of BaFe2O4-derived catalysts for enhanced CO2 hydrogenation to light olefins

A durable fluorine-free polyurethane-coated fabric with switchable super-wetting properties under mild pH conditions for controllable oil/water separation

Dual-site engineering of Ga-modified HZSM-5 towards efficient propane aromatization

Dynamic behavior of a single bubble in cavity flow driven by a turbulent channel