earticle

논문검색

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

저자정보

  • Yuming Zhao School of Computer Science, Zhaoqing University, Zhaoqing, Guangdong, China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.