A TSP-based MILP Model for Medium-Term Planning of Single-Stage Continuous Multiproduct Plants

被引:47
作者
Liu, Songsong [1 ]
Pinto, Jose M. [2 ]
Papageorgiou, Lazaros G. [1 ]
机构
[1] UCL, Dept Chem Engn, Ctr Proc Syst Engn, London WC1E 7JE, England
[2] Polytech Univ, Othmer Jacobs Dept Chem & Biol Engn, Brooklyn, NY 11201 USA
关键词
D O I
10.1021/ie800646q
中图分类号
TQ [化学工业];
学科分类号
0817 ;
摘要
In this paper, we consider the problem of medium-term planning of single-stage continuous plants with a single processing unit that manufactures several products over a planning horizon of several weeks. Sequence-dependent changeover times and Costs Occur when switching from one type of product to another. To overcome the computational expensiveness of traditional slot-based models for large instances, a novel TSP-based (traveling salesman problem) mixed-integer linear programming (MILP) model is proposed that relies on a hybrid discrete/continuous time representation. The model is applied to an example of a real world polymer processing plant to illustrate its applicability. Finally, the proposed model is compared to recently published approaches through literature examples, and the results show that the Computational performance of the proposed model is superior.
引用
收藏
页码:7733 / 7743
页数:11
相关论文
共 22 条
[11]   Simultaneous planning and scheduling of single-stage multi-product continuous plants with parallel lines [J].
Erdirik-Dogan, Muge ;
Grossmann, Ignacio E. .
COMPUTERS & CHEMICAL ENGINEERING, 2008, 32 (11) :2664-2683
[12]   Slot-based formulation for the short-term scheduling of multistage, multiproduct batch plants with sequence-dependent changeovers [J].
Erdirik-Dogan, Muge ;
Grossmann, Ignacio E. .
INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH, 2008, 47 (04) :1159-1183
[13]   Planning models for parallel batch reactors with sequence-dependent changeovers [J].
Erdirik-Dogan, Muge ;
Grossmann, Ignacio E. .
AICHE JOURNAL, 2007, 53 (09) :2284-2300
[14]  
KALLRATH J, 1997, BUSINESS OPTIMISATIO
[15]   An efficient MILP continuous-time formulation for short-term scheduling of multiproduct continuous facilities [J].
Méndez, CA ;
Cerdá, J .
COMPUTERS & CHEMICAL ENGINEERING, 2002, 26 (4-5) :687-695
[16]   Planning production on a single processor with sequence-dependent setups part 1: determination of campaigns [J].
Oh, HC ;
Karimi, IA .
COMPUTERS & CHEMICAL ENGINEERING, 2001, 25 (7-8) :1021-1030
[17]   A comparative analysis of several asymmetric traveling salesman problem formulations [J].
Oncan, Temel ;
Altinel, I. Kuban ;
Laporte, Gilbert .
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (03) :637-654
[18]   Decomposition approaches to batch plant design and planning [J].
Subrahmanyam, S ;
Pekny, JF ;
Reklaitis, GV .
INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH, 1996, 35 (06) :1866-1876
[19]   A mixed-integer programming formulation for the general capacitated lot-sizing problem [J].
Sung, Charles ;
Maravelias, Christos T. .
COMPUTERS & CHEMICAL ENGINEERING, 2008, 32 (1-2) :244-259
[20]   An attainable region approach for production planning of multiproduct processes [J].
Sung, Charles ;
Maravelias, Christos T. .
AICHE JOURNAL, 2007, 53 (05) :1298-1315