Linear programming-based approach to scheduling of crude oil operations in refinery for energy efficiency optimization

A non-transitory computer-readable medium whose contents cause a computing system to perform a computer-implemented method for scheduling a crude oil operation process in a refinery, the oil operation process, based on a predetermined short-term schedule as determined by a control-theoretic-based approach, comprising a plurality of tasks DTSs for oil delivering from a plurality of storage tanks to a plurality of charging tanks TKij for maximizing the productivity, the refinery comprising a pipeline system used to transport an amount of crude oil Vij from the plurality of storage tanks to the plurality of charging tanks TKij to be charged by performing a task DTSij from a time point Aij to a time point Bij for feeding the amount of crude oil Vij to a distiller, the pipeline system comprising a pipeline and a number of pumping stations, and a number of sets of machines n usable at each of the pumping stations, the method comprising:

• dividing, by a processor, the amount of crude oil Vij into a plurality of parcels such that the amount of crude oil Vij can be transported by the task DTSij by feeding the plurality of parcels each with a different flow rate;
• and
• determining, by a processor, the number of sets of machines n usable at each of the pumping stations such that an energy consumption J for the process is minimized under a plurality of constraints based on a linear programming model, subject to:
• J
• =
• ∑
• i
• ∈
• G
• ⁢
• ⁢
• ∑
• j
• ∈
• N
• ki
• ⁢
• ⁢
• ∑
• h
• ∈
• S
• ⁢
• ⁢
• C
• h
• ⁢
• x
• ijh
• ;
• τ
• 11
• ≥
• A
• 11
• ;
• ∑
• h
• ∈
• S
• ⁢
• ⁢
• x
• 1
• ⁢
• ⁢
• jh
• =
• V
• 1
• ⁢
• ⁢
• j
• ;
• τ
• 11
• +
• ∑
• g
• =
• 1
• j
• ⁢
• ⁢
• ∑
• h
• ∈
• S
• ⁢
• ⁢
• x
• 1
• ⁢
• gh
• /
• f
• h
• +
• Ω
• ≤
• T
• 1
• ⁢
• ⁢
• j
• ;
• τ
• i
• ⁢
• ⁢
• 1
• ≥
• A
• i
• ⁢
• ⁢
• 1
• ;
• τ
• i
• ⁢
• ⁢
• 1
• ≥
• τ
• (
• i
• -
• 1
• )
• ⁢
• 1
• +
• ∑
• j
• ∈
• N
• k
• ⁡
• (
• i
• -
• 1
• )
• ⁢
• ⁢
• ∑
• h
• ∈
• S
• ⁢
• ⁢
• x
• (
• i
• -
• 1
• )
• ⁢
• jh
• /
• f
• h
• ;
• ∑
• h
• ∈
• S
• ⁢
• ⁢
• x
• ijh
• =
• V
• ij
• ;
• τ
• i
• ⁢
• ⁢
• 1
• +
• ∑
• g
• =
• 1
• j
• ⁢
• ⁢
• ∑
• h
• ∈
• S
• ⁢
• ⁢
• x
• igh
• /
• f
• h
• +
• Ω
• ≤
• T
• ij
• ;
• x
• ijh
• ≥
• 0
• ⁢
• ⁢
• and
• ⁢
• ⁢
• τ
• i
• ⁢
• ⁢
• 1
• ≥
• 0
• ;
• wherein:
• n is the number of sets of machines usable at each pumping station;
• h∈S={1, 2, . . . , n} is a set of the number of sets of machines n;
• d is a number of groups of DTSs;
• G={1, 2, . . . , d} is a set of the number of groups of DTSs d;
• i∈G\{1};
• j∈Nki={1, 2, . . . , ki};
• DTSij is a j-th DTS in Group i∈G and j∈Nki that is decided by the predetermined short-term schedule;
• Gi={DTSi1, DTSi2, . . . DTSi(ki)},
• Aij is the time point when TKij starts to be charged by performing DTSij as given by the predetermined short-term schedule;
• Bij is the time point when the charging of TKij ends as given by the predetermined short-term schedule;
• Tij is a time point when TKij charged by performing DTSij begins to feed a distiller as given by the predetermined short-term schedule;
• Ω is an oil residency time;
• fi is a most energy-effective oil transportation flow rate when i sets of machines are used at each pumping station;
• Ci is a cost coefficient when i sets of machines are used at each pumping station;
• xijh is an amount of oil in DTSij to be transported by using the most energy-efficient flow rate with h sets of machines being used at each pumping station;
• and
• τi1 is a time point when TKi1 starts to be charged by performing DTSi1 after oil transportation rate is regulated,
• the linear programming model executed in a solver software and finding an optimized schedule with minimized power consumption based on the determined number of sets of machines n, and applying the optimized schedule to the refinery system to perform the plurality of tasks for delivering oil from the plurality of storage tanks to the plurality of charging tanks.