Crude Oil Short-Term Scheduling Algorithm with Multiple Charging Tanks Charging a Distiller Overlapingly Based on Priority-Slot Continuous-Time Formulation
The optimal scheduling of crude-oil operation in refineries has been researched by various groups during the past decade. Different mixed integer linear programming or mixed nonlinear programming formulations are derived. This paper proposes a novel MINLP formulation with multiple charging tanks charging a distiller overlapingly and oil residency time constraint that is based on multi-operation sequencing with synchronized start time (MOS-SST). It is different from previous formulations because of its consideration for oil residency time constraint and multiple charging tanks charging a distiller overlapingly. A branch and bound algorithm combined with the Lagrangian Relaxation Subgradient Optimization algorithm is proposed to solve this model, resulting in a satisfactory optimal result.
목차
Abstract 1. Introduction 2. Processes and Their Scheduling Problem 3. Problem Formulation 4. Solution Method 5. Industrial Case Study 6. Conclusions References
키워드
oil refineryscheduling algorithmcharging overlappinglyoil residency time
저자
Yuming Zhao [ School of Computer Science, Zhaoqing University, Zhaoqing, Guangdong, China ]
보안공학연구지원센터(IJUNESST) [Science & Engineering Research Support Center, Republic of Korea(IJUNESST)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of u- and e- Service, Science and Technology
간기
격월간
pISSN
2005-4246
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of u- and e- Service, Science and Technology Vol.9 No.7