Abstract

Scheduling of the transportation of liquids by multiproduct pipelines has been receiving considerable attention in the literature. The preferred methods for solving this problem rely on mathematical programming and use continuous-time formulations that move the virtual entities of batches instead of the real entities of products. Such batch-centric formulations require the user to convert the products initially in the pipeline into batches, which is trivial to do for linear or branched systems with a single input node but not for straight systems with multiple input nodes. While the dependence of solution quality on the initial batch sequence has been recognized early, no systematic procedure covering all possibilities has been presented yet. In this paper, we propose a novel scheduling algorithm that starts generating all possible initial batch sequences with a new planning formulation, before exploring all generated sequences with either a sequential or simultaneous approach, using the scheduling formulation of Liao, Q.; [ AIChE J. 2019, 65, e16712]. We then generalize this formulation to consider automatic batch selection, by including the logical constraints of the planning model.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.