.png){kind=icon}
返回
Continuous-time scheduling formulation for straight pipelines
.png){kind=icon}
PRE
AI
DOI：10.1002/aic.15563.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Pipelines represent the most cost-effective way of transporting large quantities of refined petroleum products over large distances but can be challenging to operate. In this article, we propose a new mixed-integer linear programming formulation for scheduling straight pipelines with multiple single and dual purpose nodes. The model allows for simultaneous injections and deliveries, and interacting pumping runs, in which a segment of the pipeline simultaneously receives material from its refinery and upstream segment. In contrast to previous batch centric models, it uses segment dependent coordinates. To make it efficient by design, we rely on generalized disjunctive programming and develop disjunctions for which the convex hull reformulation is simple (roughly the same number of variables and constraints as its big-M counterpart). Through the solution of a set of test cases from the literature, we show a better utilization of the pipeline capacity that is translated into a lower makespan. (c) 2016 American Institute of Chemical Engineers AIChE J, 63: 1923-1936, 2017
Keyword:
petroleum industry
mathematical modeling
optimization
logic
computational logistics
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
1.1W
被引数:
2.9W
机构
引用论文
.png){kind=icon}
分享收藏Optimal maintenance scheduling of a gas engine power plant using generalized disjunctive programming
OAAI
OAAI分享收藏
查看更多内容