首页 | 官方网站   微博 | 高级检索  
     

用Lagrangian松弛法解化工批处理调度问题
引用本文:王朝晖,陈浩勋,胡保生.用Lagrangian松弛法解化工批处理调度问题[J].自动化学报,1998,24(1):1-8.
作者姓名:王朝晖  陈浩勋  胡保生
作者单位:1.西安交通大学系统工程研究所,西安
摘    要:研究基于Lagrangian松弛法的化工批处理过程的调度方法.建立了化工批处理过 程调度问题的一种混合整数规划(MILP)模型,并通过松弛离散变量和连续变量共存的约束, 将问题分解为一个两层次的优化问题,其中上层是原问题的对偶问题,下层由两个子问题构 成:一个与产品批量有关,另一个确定操作时间表,分别用线性规划和动态规划方法解这两个 子问题.然后从对偶问题的解构作原问题的可行解.数值试验结果证明了该方法的有效性.

关 键 词:Lagrangian松弛法    化工批处理过程    调度    动态规划
收稿时间:1996-9-16
修稿时间:1996-09-16

Scheduling for Batch Chemical Processes Using Lagrangian Relaxation-Based Approach
WANG ZHAOHUI,CHEN HAOXUN,HU BAOSHENG.Scheduling for Batch Chemical Processes Using Lagrangian Relaxation-Based Approach[J].Acta Automatica Sinica,1998,24(1):1-8.
Authors:WANG ZHAOHUI  CHEN HAOXUN  HU BAOSHENG
Affiliation:1.System Engineering Institute,Xi'an Jiaotong University,Xi'an
Abstract:In this paper,an approach based on Lagrangian Relaxation to schedule batch chemical processes is presented.The scheduling problem is modeled as a compact MILP formulation.The constraints including both discrete and continuous variables are relaxed and the problem is turned into a two level optimization problem.The high level is the dual of the original problem,and the low level consists of two subproblems,one for batch sizing,the other for deciding the time table.Linear programming and dynamic programming methods are used to solve the subproblems.A feasible solution is then constructed based on the solution of the dual problem.Computational results are given to demonstrate the effectiveness of the approach.
Keywords:Lagrangian relaxation  batch chemical processes  scheduling  dynamic programming    
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《自动化学报》浏览原始摘要信息
点击此处可从《自动化学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号