Lagrangean-based techniques for the supply chain management of flexible process networks

被引:17
作者
Chen, Peter [1 ]
Pinto, Jose M. [1 ]
机构
[1] Polytech Univ, Othmer Jacobs Dept Chem & Biol Engn, Brooklyn, NY 11201 USA
关键词
Lagrangean relaxation; continuous process network; MILP; decomposition;
D O I
10.1016/j.compchemeng.2007.12.006
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The supply chain optimization of continuous process networks is essential for most chemical companies. The dynamic nature of this problem leads to systems that involve several types of chemicals as Well as multiple time periods. and ultimately are represented with complex and large combinatorial optimization models. Since, these models become very difficult to solve and sometimes are not even solvable, they require the use of decomposition methods. so that they can be solved efficiently and effectively. This work develops decomposition techniques fora continuous flexible process network (CFPN) model. The techniques include Lagrangean decomposition, Lagrangean relaxation, and Lagrangean/surrogate relaxation, coupled with subgradient and modified subgradient optimization. Several schemes derived from the techniques are proposed and applied to the process network model. The results from the full-scale solution and the proposed decomposition schemes are presented and compared. (c) 2008 Elsevier Ltd. All rights reserved.
引用
收藏
页码:2505 / 2528
页数:24
相关论文
共 21 条
[1]  
[Anonymous], INTEGER COMBINATORIA
[2]   SURVEY OF VARIOUS TACTICS FOR GENERATING LAGRANGIAN MULTIPLIERS IN THE CONTEXT OF LAGRANGIAN DUALITY [J].
BAZARAA, MS ;
GOODE, JJ .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1979, 3 (04) :322-338
[3]   Supply chain optimization in continuous flexible process networks [J].
Bok, JK ;
Grossmann, IE ;
Park, S .
INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH, 2000, 39 (05) :1279-1290
[4]  
BROOKE A, 1998, GAMS USER GUIDE, P1963
[5]   AN APPLICATIONS ORIENTED GUIDE TO LAGRANGIAN-RELAXATION [J].
FISHER, ML .
INTERFACES, 1985, 15 (02) :10-21
[6]   A modified subgradient algorithm for Lagrangean relaxation [J].
Fumero, F .
COMPUTERS & OPERATIONS RESEARCH, 2001, 28 (01) :33-52
[7]  
Grossmann I. E., 1994, IND ENG CHEM RES, V33, P68
[8]   LAGRANGEAN DECOMPOSITION - A MODEL YIELDING STRONGER LAGRANGEAN BOUNDS [J].
GUIGNARD, M ;
KIM, S .
MATHEMATICAL PROGRAMMING, 1987, 39 (02) :215-228
[9]   Managing demand uncertainty in supply chain planning [J].
Gupta, A ;
Maranas, CD .
COMPUTERS & CHEMICAL ENGINEERING, 2003, 27 (8-9) :1219-1227
[10]  
*ILOG, 2006, ILOG CPLEX 10 0 USER