首页 | 本学科首页   官方微博 | 高级检索  
     

约束规划方法在原油混输调度中的应用
引用本文:周祥,郭锦标,周涵,单石灵,梁彬华. 约束规划方法在原油混输调度中的应用[J]. 计算机与应用化学, 2008, 25(1): 51-53
作者姓名:周祥  郭锦标  周涵  单石灵  梁彬华
作者单位:1. 中国石油化工股份有限公司石油化工科学研究院,北京,100083
2. 中国石油化工股份有限公司广州分公司,广东,广州,510726
摘    要:应用约束规划方法建立炼厂原油混输模型,并通过搜索求解获得可操作的调度方案。约束规划允许以逻辑约束表达混输过程中的操作规则,使模型简洁直观,而对整型变量及非线性约束不敏感,则降低了模型的求解难度。选取了一个时间跨度为300小时实际调度问题作为案例,模型中包含约8000个变量和14000条约束,在普通PC机上计算求解,能够在30秒内获得调度方案,方案具有可操作性且优于人工方案,表明以约束规划方法解决原油混输调度问题是可行的。

关 键 词:原油混输  调度方案  约束规划  逻辑约束
文章编号:1001-4160(2008)01-51-53
收稿时间:2007-06-20
修稿时间:2007-08-23

Application of constraint programming method in crude scheduling
Zhou Xiang,Guo Jinbiao,Zhou Han,Shan Shiling,Liang Binhua. Application of constraint programming method in crude scheduling[J]. Computers and Applied Chemistry, 2008, 25(1): 51-53
Authors:Zhou Xiang  Guo Jinbiao  Zhou Han  Shan Shiling  Liang Binhua
Abstract:Constraint programming(CP)method has been applied to construct crude feeding model for refineries.Feasible scheduling scheme can be acquired by solving the model with search strategies.In order to achieve a compact model,logical constraints enabled by CP are used to express the operation rules in crude feeding.CP models are insensitive to integer variables and nonlinear constraints, which reduces the difficulty of the solving procedure.An industrial scheduling problem with the horizon of 300 hours is introduced. Model for the problem is formulated with about 8000 variables and 14000 constraints.The model is solved on a common personal com- puter and a scheduling scheme is obtained in less than 30 seconds.The scheme is examined to be operable and proved to be more opti- mal than manual scheme,which demonstrates the feasibility of solving crude feeding scheduling problem with CP method.
Keywords:crude feeding  scheduling scheme  constraint programming  logical constraint
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号