Journals / Konya Journal of Engineering Sciences / 2016 / Cilt: 4 Sayı: 4

SOLUTION TO A PIPELINE SCHEDULING PROBLEM BY USING A MIXED INTEGER LINEAR PROGRAMMING MODEL

Karma Tamsayılı Doğrusal Programlama Modeli İle Bir Boru Hattı Çizelgeleme Probleminin Çözümü

Pages
284–296
Publication Date
2016-12-01
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

As a result of the study, an optimal pumping schedule for pipelineoperations at a certain period of time is achieved.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Pipelines are efficient ways of conveying huge amounts of refined petroleum products todistant points.
📊
Key Findings & Data:Different products are pumped successively, in the pipelines without a need of aseparator between them.
💡
Conclusion & Impact:As a result of the study, an optimal pumping schedule for pipelineoperations at a certain period of time is achieved.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Boru hattı çizelgeleme · GAMS · Karma tamsayılı doğrusal programlama

Abstract

Pipelines are efficient ways of conveying huge amounts of refined petroleum products todistant points. Different products are pumped successively, in the pipelines without a need of aseparator between them. Pipelines should be chosen very carefully based on the pumping sequences,volumes to be conveyed, covering the constraints involved by cutting operational costs and focusing onmarket demands. The real life problem considered in this study consists of a unidirectional pipedistribution system used for pumping petroleum products between the sources and distribution centers.Problem was stated as a Mixed Integer Linear Programming (MILP) model and solved by using GAMSsoftware thorough actual data. As a result of the study, an optimal pumping schedule for pipelineoperations at a certain period of time is achieved.

Özet

Boru hatları büyük miktarlardaki rafine edilmiş petrol ürünlerinin uzak mesafelere taşınmasında ekonomik bir yoldur. Boru hatlarında farklı ürünler aralarında herhangi bir ayırıcı olmadan arka arkaya pompalanmaktadır. Pompaj hareketinin sırası ve uzunluğu, boru hattı operasyonel maliyetlerini azaltarak kısıtları karşılamak ve pazar taleplerine cevap vermek için dikkatli bir şekilde seçilmek zorundadır. Bu çalışmada ele alınan gerçek hayat problemi, kaynak ve dağıtım merkezleri arasında yakıt türevlerinin pompalanmasında kullanılan ve tek yönlü boru hattından oluşan bir dağıtım sistemini içermektedir. Problem mevcut veriler doğrultusunda Karma Tamsayılı Doğrusal Programlama modeli olarak ifade edilmiş ve GAMS yazılımı ile çözülmüştür. Çalışma neticesinde belirli bir zaman dilimindeki boru hattı operasyonlarını içeren optimal bir pompaj çizelgesi elde edilmiştir.

🔖

Cite This Article

BAYSAL, M. E., UÇAKTÜRK, E. (2016). SOLUTION TO A PIPELINE SCHEDULING PROBLEM BY USING A MIXED INTEGER LINEAR PROGRAMMING MODEL. Konya Journal of Engineering Sciences, Cilt: 4 Sayı: 4, 284–296. https://ajindex.com/articles/909389

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (11)

  1. Álvaro, G.S., Arreche, L.M., “A Support Decision Tool for Pipeline Scheduling”, Third International Conference on Production Research Americas’ Region 2006 (ICPR-AM06), Conference Proceeding, Curitiba, Brazil, 2006.
  2. Cafaro, D. C., Cerda, J., 2004, “Optimal Scheduling of Multiproduct Pipeline Systems Using a Non- Discrete MILP Formulation”, Computers and Chemical Engineering, Vol. 28, pp. 2053-2068.
  3. Cafaro, D.C., Cerd{, J., 2008, “Dynamic Scheduling of Multiproduct Pipelines with Multiple Delivery Due Dates”, Computers and Chemical Engineering, Vol. 32, pp.728-753.
  4. Cafaro, D.C., Cerd{, J., 2009, “Optimal Scheduling of Refined Products Pipelines with Multiple Sources”, Industrial & Engineering Chemistry Research, Vol. 48, pp. 6675-6689.
  5. Cafaro, G.V., Cafaro, D.C., Cerd{, J., Mendes, A.C., “Oil-Derivatives Pipeline Logistics Using Discrete- Event Simulation”, Proceedings of the 2010
  6. Winter Simulation Conference, Arizona, USA, 2010, pp. 2101-2114.
  7. Cafaro, D.C., Cerd{, J., 2010, “Operational Scheduling of Refined Products Pipeline Networks with Simultaneous Batch Injections”, Computers and Chemical Engineering, Vol. 34, pp. 1687–1704.
  8. Cafaro, G.V., Cafaro, D.C., Mendes, A.C., Cerd{, J., 2011, “Detailed Scheduling of Operations in Single- Source Refined Products Pipelines”, Industrial & Engineering Chemistry Research, Vol. 50 (10), pp. 6240–6259. Herr{n, A., de la Cruz, J. M., de Andrés, B., 2010, “A Mathematical Model for Planning Transportation of Multiple Petroleum Products in A Multi Pipeline System”, Computers and Chemical Engineering, Vol. 34, pp. 401–413. Herr{n, A., de la Cruz, J. M., de Andrés, B., 2012, “Global Search Metaheuristics for Planning Transportation of Multiple Petroleum Products in A Multi-Pipeline System”, Computers and Chemical Engineering Vol. 37 (2012), pp.248– 261 Magatão, L., Arruda, L. V. R., Nevesxe, F.A., 2005, “Using CLP and MILP for Scheduling Commodities in A Pipeline”, Computer Aided Chemical Engineering, Vol. 20, pp. 1027-1032.
  9. Maruyama Mori, F., Luders, R., Arruda, L. V. R., Yamamoto, L., Bonacin, M. V.; Polli, H. L., Aires, M. C., Bernardo, L. F. J., 2007, “Simulating The Operational Scheduling of a Real World Pipeline Network”, Computer Aided Chemical Engineering, Vol. 24, pp.691–696.
  10. MirHassani, S.A., Ghorbanalizadeh, M., 2008, “The Multi-Product Pipeline Scheduling System”, Computers and Mathematics with Applications, Vol. 56(4), pp. 891–897.
  11. MirHassani, S.A., Jahromi H.F., 2011, “Scheduling Multi-Product Tree-Structure P