Assigning and sequencing batches and blends of oil derivatives in a mesh-like pipeline network

Abstract

To transport oil using pipelines is very efficient, but expanding the existing infrastructure is costly. Therefore, it is essential to optimize the use of the existing pipelines. One step to optimize their operations is to make a proper schedule, an NP-Complete problem. Researchers have developed approaches to solve this problem, and in some of these, to avoid computational burden, the problem is divided into roughly three main components: assigning, sequencing, and timing. We describe a new approach to the assigning and sequencing steps to schedule a Brazilian pipeline network used to convey heavy oil derivatives. An MILP model is used to generate the assigning solution, while both a heuristic algorithm and an MILP model are used to solve the sequencing problem. Computational tests considered the operational particularities of the real-world pipeline network, as inline oil blending. The proposed approach was able to obtain monthly schedules in relatively low running time.