Short-term scheduling of multiple source pipelines with simultaneous injections and deliveries
This paper addresses the optimal scheduling of straight pipelines featuring multiple intermediate nodes acting as dual-purpose stations, with a continuous-time Mixed-Integer Linear Programming formulation partly derived from Generalized Disjunctive Programming. The new model allows for an intermedia...
Saved in:
Published in | Computers & operations research Vol. 73; pp. 27 - 42 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
New York
Elsevier Ltd
01.09.2016
Pergamon Press Inc |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | This paper addresses the optimal scheduling of straight pipelines featuring multiple intermediate nodes acting as dual-purpose stations, with a continuous-time Mixed-Integer Linear Programming formulation partly derived from Generalized Disjunctive Programming. The new model allows for an intermediate station to act as an output and input terminal at the same time so as to reduce the number of segment switches between active and idle, and consequently decrease operating costs. Contrary to previous approaches, decisions related to batch sizing, batch sequencing and timing are determined in a single step. Several examples of growing complexity are solved to illustrate the effectiveness and computational advantage of the proposed model in both solution quality and CPU time.
•Continuous-time MILP model for operational scheduling of multi-product pipeline networks with dual purpose stations.•Simultaneous batch injections and product removals at input and output terminals.•Contrary to previous contributions, decisions related to batch sizing, batch sequencing and timing, are determined in a single step.•Flow rate limitations in pipeline segments originated from a lower diameter are easily handled. |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
ISSN: | 0305-0548 1873-765X 0305-0548 |
DOI: | 10.1016/j.cor.2016.03.006 |