Loading...
Search for: tennessee-eastman-process
0.01 seconds

    Fuzzy real-time optimization of the Tennessee Eastman challenge process

    , Article Iranian Journal of Chemistry and Chemical Engineering ; Volume 30, Issue 3 , 2011 , Pages 31-43 ; 10219986 (ISSN) Golshan, M ; Bozorgmehry Boozarjomehry, R ; Sahlodin, A. M ; Pishvaie, M. R ; Sharif University of Technology
    2011
    Abstract
    A Real-Time Optimization (RTO) strategy incorporating the fuzzy sets theory is developed, where the problem constraints obtained from process considerations are treated in fuzzy environment. Furthermore, the objective function is penalized by a fuzzified form of the key process constraints. To enable using conventional optimization techniques, the resulting fuzzy optimization problem is then reformulated into a crisp programming problem. The crisp programming problem is solved using both Sequential Quadratic Programming (SQP) and Heuristic Random Optimization (HRO) techniques for comparison purposes. The proposed fuzzy RTO strategy is demonstrated via the Tennessee Eastman benchmark process,... 

    Stochastic and global real time optimization of Tennessee Eastman challenge problem

    , Article Engineering Applications of Artificial Intelligence ; Volume 21, Issue 2 , 2008 , Pages 215-228 ; 09521976 (ISSN) Golshan, M ; Pishvaie, M. R ; Bozorgmehry Boozarjomehry, R ; Sharif University of Technology
    2008
    Abstract
    A stochastic real time optimization (SRTO) which has an efficient result has been implemented on the Tennessee Eastman (TE) challenging problem. In this article a novel stochastic optimization method, the so-called heuristic random optimization (HRO) proposed by Li & Rhinehart is used which attempts to rationally combine features of both deterministic and random (stochastic) methods. Further, an on-line nonlinear identifier via extended Kalman filter (EKF) is used to supply the plant model for model-based optimization algorithm. Using the information obtained from EKF an on-line HRO is accomplished by a random search method whose search directions and steps are considerably reduced by some...