Detailed Scheduling of Operations in Single-Source Refined Products Pipelines

Abstract

The short-term scheduling of refined products pipelines is a very complex problem with many operational constraints to be considered. Available nondiscrete planning approaches just provide the input schedule and the set of aggregate product deliveries to be performed from in-transit lots to depots at every batch injection. To determine the sequence of individual cuts on each batch to be accomplished by the pipeline operator, it is still necessary to refine such an aggregate plan. To do so, new computational tools for efficiently generating the detailed schedule of single-source pipelines with multiple distribution terminals are presented. Two types of methodologies are proposed. On one hand, it is developed a continuous-time mixed-integer linear programming (MILP) formulation that seeks to minimize both the total flow restart volume and the number of single-delivery pumping runs over the planning horizon. In this way, substantial savings in energy consumption and pump maintenance costs are achieved. Effective solution strategies for the MILP model are also designed to deal with large pipeline scheduling problems. On the other hand, three different heuristic rules for selecting the receiving terminal are introduced. By applying those rules in combination with a discrete-event simulation model, not only alternative detailed schedules can be generated in a very short CPU time but also some of them are near-optimal solutions. Three instances of a case study aimed at finding the detailed schedule of a real-world single-source pipeline system are solved through the proposed optimization and discrete-event simulation methods. Results are analyzed to assess the quality of the generated solutions and the required computational costs.