A Novel Two-Level Optimization Framework Based on Constrained Ordinal Optimization and Evolutionary Algorithms for Scheduling of Multipipeline Crude Oil Blending

被引:11
作者
Bai Liang [1 ,2 ]
Jiang Yongheng [1 ,2 ]
Huang Dexian [1 ,2 ]
机构
[1] Tsinghua Univ, Dept Automat, Beijing 100084, Peoples R China
[2] Tsinghua Univ, Tsinghua Natl Lab Informat Sci & Technol, Beijing 100084, Peoples R China
基金
中国国家自然科学基金;
关键词
SUBSTANTIAL DOWNSTREAM BENEFITS; NONLINEAR-PROGRAMMING PROBLEMS; MULTIMILLION-DOLLAR BENEFITS; MIXED-INTEGER; GENETIC ALGORITHMS; DIFFERENTIAL EVOLUTION; OPERATIONS; MODEL; DESIGN; BLENDSHOP;
D O I
10.1021/ie202224w
中图分类号
TQ [化学工业];
学科分类号
0817 ;
摘要
This paper introduces a practical scheduling of multipipeline crude oil blending (SMCOB) problem. It is formulated as a complex mixed integer nonlinear programming (MINLP) model, taking the charging sequence and flow rates of oil tanks as decision variables, which cannot be efficiently solved by traditional deterministic methods and solvers. Then, a novel two-level optimization framework based on constrained ordinal optimization (COO) and evolutionary algorithms (EA) is proposed. The solution methodology has two stages based on the main procedures of COO. At the crude evaluation stage, discrete EA are used to search for sequence solutions in the outer level. It evolves the sequence solutions on the basis of their rough evaluation of the feasibility and objective value obtained from the inner level and keeps certain number of probably best sequence solutions. At the accurate evaluation stage, the probably best sequence solutions kept by the crude evaluation stage are accurately evaluated by inner-level continuous EA. The COO approach ensures that some true good enough sequence and flow rate solutions can be obtained from the accurate evaluation stage with high probability. COO-based EA are compared with mixed-coding EA to verify the framework's efficiency and robustness.
引用
收藏
页码:9078 / 9093
页数:16
相关论文
共 40 条
[1]  
Ambrosio C. D., 2011, 4OR-Q J OPER RES, P1
[2]   Optimization of process synthesis and design problems: A modified differential evolution approach [J].
Angira, Rakesh ;
Abu, B. V. .
CHEMICAL ENGINEERING SCIENCE, 2006, 61 (14) :4707-4721
[3]  
[Anonymous], 1987, Genetic algorithms and simulated annealing
[4]  
Back T., 1996, EVOLUTIONARY ALGORIT, DOI DOI 10.1093/OSO/9780195099713.001.0001
[5]   A Novel Scheduling Strategy for Crude Oil Blending [J].
Bai Liang ;
Jiang Yongheng ;
Huang Dexian ;
Liu Xianguang .
CHINESE JOURNAL OF CHEMICAL ENGINEERING, 2010, 18 (05) :777-786
[6]  
Bean J. C., 1994, ORSA Journal on Computing, V6, P154, DOI 10.1287/ijoc.6.2.154
[7]   Nested tabu search (TS) and sequential quadratic programming (SQP) method, combined with adaptive model reformulation for heat exchanger network synthesis (HENS) [J].
Chen, Xi ;
Li, Zhaohua ;
Yang, Jing ;
Shao, Zhijiang ;
Zhu, Lingyu .
INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH, 2008, 47 (07) :2320-2330
[8]   Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art [J].
Coello, CAC .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2002, 191 (11-12) :1245-1287
[9]   Evolutionary algorithms approach to the solution of mixed integer non-linear programming problems [J].
Costa, L ;
Oliveira, P .
COMPUTERS & CHEMICAL ENGINEERING, 2001, 25 (2-3) :257-266
[10]   An efficient constraint handling method for genetic algorithms [J].
Deb, K .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2000, 186 (2-4) :311-338