专家简介：
邓天虎，博士，副教授。目前就职于清华大学工业工程系。2013年于美国加州大学伯克利分校获得工业工程与运筹博士学位，2008年于清华大学工业工程系获得学士学位。目前研究方向侧重智慧供应链。以第一作者和通讯作者在manufacturing & service operations management、operations research等国际高水平学术期刊和学术会议发表论文20余篇。
报告简介:
we study the energy consumption minimization problems of natural gas transmission in gunbarrel structured networks. in particular, we consider the transient-state dynamics of natural gas and a compressor's nonlinear working domain and ramp constraints. we formulate the problem as a two-level dynamic programming (dp), where the upper-level dp problem formulates each compressor station as a decision stage and each stage's optimization problem is further solved as a lower-level dp by setting each time period as a stage. both dynamic programming problems are high-dimensional. we propose an approximate dynamic programming (adp) approach for the upper-level dp and an exact approach for the lower-level dp. finally, we numerically compare our adp approach to the existing simulated annealing (sa) heuristics based on real-world data in china. the results demonstrate that the adp saves about 4.1%∼7.5% energy consumption than the sas. furthermore, the solution found by the adp within the first 20 seconds dominates the solutions found by sas in more than ten minutes. the advantages in solution performance and computation time support the proposed adp algorithm in practice.
邓天虎，博士，副教授。目前就职于清华大学工业工程系。2013年于美国加州大学伯克利分校获得工业工程与运筹博士学位，2008年于清华大学工业工程系获得学士学位。目前研究方向侧重智慧供应链。以第一作者和通讯作者在manufacturing & service operations management、operations research等国际高水平学术期刊和学术会议发表论文20余篇。
报告简介:
we study the energy consumption minimization problems of natural gas transmission in gunbarrel structured networks. in particular, we consider the transient-state dynamics of natural gas and a compressor's nonlinear working domain and ramp constraints. we formulate the problem as a two-level dynamic programming (dp), where the upper-level dp problem formulates each compressor station as a decision stage and each stage's optimization problem is further solved as a lower-level dp by setting each time period as a stage. both dynamic programming problems are high-dimensional. we propose an approximate dynamic programming (adp) approach for the upper-level dp and an exact approach for the lower-level dp. finally, we numerically compare our adp approach to the existing simulated annealing (sa) heuristics based on real-world data in china. the results demonstrate that the adp saves about 4.1%∼7.5% energy consumption than the sas. furthermore, the solution found by the adp within the first 20 seconds dominates the solutions found by sas in more than ten minutes. the advantages in solution performance and computation time support the proposed adp algorithm in practice.
