Produced Water Application for Beneficial Reuse, Environmental Impact and Treatment Optimization (PARETO)

Project Goals

The goal of the project is to develop a modeling and optimization application, PARETO, that can help organizations better manage, better treat, and – where possible – beneficially reuse produced water from oil and gas operations. Specifically, PARETO will help decision-makers with:

  • buildout of the produced water infrastructure

  • management of produced water volumes

  • selection of effective treatment technologies

  • placement & sizing of treatment facilities

  • identification of beneficial water reuse options

  • distribution of treated produced water for reuse

The initiative is committed to viewing produced water management from a “systems” perspective and to building an inclusive framework that will unite stakeholders from across the produced water community. The vision is that PARETO will not only help oil & gas but also allow other industries (e.g., agriculture, mining) explore beneficial reuse opportunities for treated produced water. Figure 1 (below) illustrates the scope of “Project PARETO”.

Collaborating institutions

The PARETO team is comprised of collaborators from the following institutions:

  • National Energy Technology Laboratory (Lead)

  • Sandia National Laboratory

  • Lawrence Berkeley National Laboratory

Project Timeline

Project PARETO is a 3-year initiative that has been split into three distinct phases; with each phase taking up exactly one year. In execution year 2021, PARETO will capture produced water management, i.e., capturing options for coordinating water deliveries in a given development area. By execution year 2022, the project will shift its attention towards produced water treatment. Finally, execution year 2023 will be dedicated to produced water beneficial reuse.

_images/PARETO_3.png

Figure 4. Project PARETO Timeline

In terms of deliverables, PARETO itself will be released as free and open-source software every year of the initiative – with increasing capabilities and functionality becoming available over time. The project team is also committed to conducting case studies with industrial and other partners; and where possible findings from those collaborations will be shared with the produced water community as best practice reports. It should also be noted that the project will be continuously evaluated by a comprehensive stakeholder board that involves individuals representing upstream operators, midstream organizations, treatment technology providers, beneficial reuse entities, regulatory agencies and others – all of which will guide the project team and provide necessary input.

Contact us

General, background and overview information is available at the PARETO main website. Framework development happens at our GitHub repo where you can report issues/bugs or make contributions. For further enquiries, send an email to: <pareto-support@pareto.org>

Contents

Getting Started

Installation

To install the PARETO framework on Windows operating systems, follow the set of instructions below that are appropriate for your needs. If you need assistance please contact start a new discussion on our GitHub Discussion form or send an email to pareto-support@project-pareto.org.

Developer Role

The installation instructions vary slightly depending on the role you will have with Project Pareto. Below are the roles we’ve identified:

Users: Use the PARETO platform to develop models, but never contribute to development of the framework (i.e. never commit changes to the project-pareto repo). This includes people who only work with protected data.

Core-dev: Work primarily on PARETO platform development and never handle protected data.

Hybrid: Handle protected data, but also commit changes to the project-pareto repo (even occasionally) - needs approval from PhD. Markus Drouven

Developer Role

Installation Section

Users

Users

Core-dev

Core-dev

Hybrid

Hybrid

Install Miniconda (optional)

  1. Download: https://repo.anaconda.com/miniconda/Miniconda3-latest-Windows-x86_64.exe

  2. Install anaconda from the downloaded file in (1).

  3. Open the Anaconda Prompt (Start -> “Anaconda Prompt”).

Warning

If you are using Python for other complex projects, you may want to consider using environments of some sort to avoid conflicting dependencies. There are several good options including conda environments if you use Anaconda.

Users

Non-git tracked option

  1. Install PARETO with pip by one of the following methods

  1. To get the latest release:

    pip install project-pareto
    
  2. To get a specific release, for example 1.6.3:

    pip install project-pareto==1.6.3
    
  3. If you need unreleased cutting-edge development versions of PARETO, you can install PARETO directly from the GitHub repo either from the main PARETO repo or a developer’s fork and branch (this installs from GitHub but does not create a local git clone/workspace):

    pip install git+https://github.com/project-pareto/project-pareto.git
    pip install git+https://github.com/ksbeattie/project-pareto@feature_1
    

Core-dev

  1. Fork the repo on GitHub (your copy of the main repo)

  2. Clone your fork locally, creating a workspace (github id is “myusername,”):

    git clone https://github.com/myusername/project-pareto
    git clone git@github.com:myusername/project-pareto.
    
  3. In this new project-pareto directory, run the following command which installs PARETO in editable mode so that developers can make changes and push to their fork/branch:

    pip install -e
    

Hybrid

User that can edit the base code

  1. Create environment:

    conda create -n pareto-env python=3.8pip --yes
    conda activate pareto-env
    
  2. Download zip files (project-pareto-main)

  3. Unpack zip files (select directory)

  4. Install pareto-project (non-git tracked repo):

    pip install -r requirements-dev.txt
    

Building Documentation

We use Sphinx for writing and building our on-line documentation. This is a tool that translates a set of plain text .rst (reStructuredText) files into various output formats, such as HTML or PDF (via Latex).

After installing as a Core-dev or Users (as described above) you can build the documentation locally on your system by running the make command in the docs folder, as follows:

$ cd project-pareto/docs/
$ make html

Visit the Sphinx Style Guide for information on syntax rules, tips, and FAQ.

Model Library

Optimization Framework

The Produced Water Application for Beneficial Reuse, Environmental Impact and Treatment Optimization (PARETO) is specifically designed for produced water management and beneficial reuse. The major deliverable of this project will be an open-source, optimization-based, downloadable and executable produced water decision-support application, PARETO, that can be run by upstream operators, midstream companies, technology providers, water end users, research organizations and regulators.

PARETO is designed as an executable optimization-based decision-support application. In return for specifying select input data, users will be provided with specific, actionable recommendations as program outputs. The table below summarizes representative inputs and outputs.

_images/PARETO_1.png

Figure 1. Problem Description

Program Inputs

  • Produced water forecast
    • Quantity

    • Quality

  • Transportation resources
    • Water hauling trucks

    • Produced water pipelines

  • Reuse opportunities
    • Demand forecasts

    • Quality constraints

  • Cost assumptions
    • cost of freshwater

    • treatment, production, and storage cost

_images/PARETO_2.png

Figure 2. Input Data

Program Outputs

  • Infrastructure buildout
    • Storage/treatment facilities

    • Pipeline network

  • Source-to-sink matches
    • Volumetric flows

    • Blending/treatment options

  • Planning and scheduling
    • Water delivery coordination

    • Operational and strategic

  • Economic performance
    • Operational costs

    • Capital expenditures

_images/PARETO_2a.png

Figure 3. Output Data

It should be noted that PARETO users will be able to choose from a range of objectives for their optimization runs; these can range from minimizing costs to maximing the ruese of produced water (or combinations thereof).

Water Management Model Library

Operational Water Management
Overview

Given a fixed network of pads (completion and/or production), storage tanks, water forecasts (both consumption and production), and distribution options (trucks and/or pipelines), the operational water management model provides insight into the operational costs associated with water management. The operational model allows the user to explore the tradeoff between minimizing costs (distribution, storage, treatment, disposal, etc.) and maximizing reuse water.

Sections

Operational Model Mathematical Notation

Operational Model Mathematical Program Formulation

Operational Model Water Quality Extension

Operational Model Terminology

Operational Model Mathematical Notation

Sets

\(\textcolor{blue}{t ∈ T}\) Time periods (i.e. days)

\(\textcolor{blue}{p ∈ P}\) Well pads

\(\textcolor{blue}{p ∈ PP}\) Production pads (subset of well pads P)

\(\textcolor{blue}{p ∈ CP}\) Completions pads (subset of well pads P)

\(\textcolor{blue}{f ∈ F}\) Freshwater sources

\(\textcolor{blue}{k ∈ K}\) Disposal sites

\(\textcolor{blue}{s ∈ S}\) Storage sites

\(\textcolor{blue}{r ∈ R}\) Treatment sites

\(\textcolor{blue}{o ∈ O}\) Beneficial Reuse options

\(\textcolor{blue}{n ∈ N}\) Network nodes

\(\textcolor{blue}{l ∈ L}\) Locations (superset of well pads, disposal sites, nodes, …)

\(\textcolor{blue}{a ∈ A}\) Production tanks

\(\textcolor{blue}{(p,p) ∈ PCA}\) Production-to-completions pipeline arcs

\(\textcolor{blue}{(p,n) ∈ PNA}\) Production-to-node pipeline arcs

\(\textcolor{blue}{(p,p) ∈ PPA}\) Production-to-production pipeline arcs

\(\textcolor{blue}{(p,n) ∈ CNA}\) Completions-to-node pipeline arcs

\(\textcolor{blue}{(p,p) ∈ CCA}\) Completions-to-completions pipeline arcs

\(\textcolor{blue}{(n,n) ∈ NNA}\) Node-to-node pipeline arcs

\(\textcolor{blue}{(n,p) ∈ NCA}\) Node-to-completions pipeline arcs

\(\textcolor{blue}{(n,k) ∈ NKA}\) Node-to-disposal pipeline arcs

\(\textcolor{blue}{(n,s) ∈ NSA}\) Node-to-storage pipeline arcs

\(\textcolor{blue}{(n,r) ∈ NRA}\) Node-to-treatment pipeline arcs

\(\textcolor{blue}{(n,o) ∈ NOA}\) Node-to-beneficial reuse pipeline arcs

\(\textcolor{blue}{(f,p) ∈ FCA}\) Freshwater-to-completions pipeline arcs

\(\textcolor{blue}{(r,n) ∈ RNA}\) Treatment-to-node pipeline arcs

\(\textcolor{blue}{(r,p) ∈ RCA}\) Treatment-to-completions pipeline arcs

\(\textcolor{blue}{(r,k) ∈ RKA}\) Treatment-to-disposal pipeline arcs

\(\textcolor{blue}{(s,n) ∈ SNA}\) Storage-to-node pipeline arcs

\(\textcolor{blue}{(s,p) ∈ SCA}\) Storage-to-completions pipeline arcs

\(\textcolor{blue}{(s,k) ∈ SKA}\) Storage-to-disposal pipeline arcs

\(\textcolor{blue}{(s,r) ∈ SRA}\) Storage-to-treatment pipeline arcs

\(\textcolor{blue}{(s,o) ∈ SOA}\) Storage-to-beneficial reuse pipeline arcs

\(\textcolor{blue}{(p,p) ∈ PCT}\) Production-to-completions trucking arcs

\(\textcolor{blue}{(f,c) ∈ FCT}\) Freshwater-to-completions trucking arcs

\(\textcolor{blue}{(p,k) ∈ PKT}\) Production-to-disposal trucking arcs

\(\textcolor{blue}{(p,s) ∈ PST}\) Production-to-storage trucking arcs

\(\textcolor{blue}{(p,r) ∈ PRT}\) Production-to-treatment trucking arcs

\(\textcolor{blue}{(p,o) ∈ POT}\) Production-to-beneficial reuse trucking arcs

\(\textcolor{blue}{(p,k) ∈ CKT}\) Completions-to-disposal trucking arcs

\(\textcolor{blue}{(p,s) ∈ CST}\) Completions-to-storage trucking arcs

\(\textcolor{blue}{(p,r) ∈ CRT}\) Completions-to-treatment trucking arcs

\(\textcolor{blue}{(p,p) ∈ CCT}\) Completions-to-completions trucking arcs (flowback reuse)

\(\textcolor{blue}{(s,p) ∈ SCT}\) Storage-to-completions trucking arcs

\(\textcolor{blue}{(s,k) ∈ SKT}\) Storage-to-disposal trucking arcs

\(\textcolor{blue}{(r,k) ∈ RKT}\) Treatment-to-disposal trucking arcs

\(\textcolor{blue}{(p,a) ∈ PAL}\) Pad-to-tank links

Continuous Variables

\(\textcolor{red}{F_{l,l,t}^{Piped}}\) = Produced water piped from one location to another location

\(\textcolor{red}{F_{l,l,t}^{Trucked}}\) = Produced water trucked from one location to another location

\(\textcolor{red}{F_{f,p,t}^{Sourced}}\) = Fresh water sourced from source to completions

\(\textcolor{red}{F_{p,t}^{PadStorageIn}}\) = Water put into completions pad storage

\(\textcolor{red}{F_{p,t}^{PadStorageOut}}\) = Water removed from completions pad storage

\(\textcolor{red}{F_{r,t}^{TreatmentDestination}}\) = Water delivered to treatment site

\(\textcolor{red}{F_{r,t}^{UnusedTreatedWater}}\) = Water leftover from the treatment process

\(\textcolor{red}{F_{k,t}^{DisposalDestination}}\) = Water injected at disposal site

\(\textcolor{red}{F_{o,t}^{BeneficialReuseDestination}}\) = Water delivered to beneficial reuse site

If the production tanks are separate, water level and water drainage are tracked at each individual production tank:

\(\textcolor{red}{F_{p,a,t}^{DrainF}}\) = Produced water drained from production tank

\(\textcolor{red}{L_{p,a,t}^{ProdTankL}}\) = Water level in production tank at the end of time period t

Otherwise, if the production tanks are equalized, the water level and water drainage can be aggregated to a pad level:

\(\textcolor{red}{F_{p,t}^{DrainF}}\) = Produced water drained from equalized production tanks

\(\textcolor{red}{L_{p,t}^{ProdTank}}\) = Water level in equalized production tanks at the end of time period t

\(\textcolor{red}{B_{p,t}^{ProductionB}}\) = Produced water for transport from pad

\(\textcolor{red}{L_{s,t}^{Storage}}\) = Water level in storage site at the end of time period t

\(\textcolor{red}{L_{p,t}^{PadStorage}}\) = Water level in completions pad storage at the end of time period t

\(\textcolor{red}{C_{l,l,t}^{Piped}}\) = Cost of piping produced water from one location to another location

\(\textcolor{red}{C_{l,l,t}^{Trucked}}\) = Cost of trucking produced water from one location to another location

\(\textcolor{red}{C_{f,p,t}^{Sourced}}\) = Cost of sourcing fresh water from source to completions pad

\(\textcolor{red}{C_{k,t}^{Disposal}}\) = Cost of injecting produced water at disposal site

\(\textcolor{red}{C_{r,t}^{Treatment}}\) = Cost of treating produced water at treatment site

\(\textcolor{red}{C_{p,t}^{CompletionsReuse}}\) = Cost of reusing produced water at completions site

\(\textcolor{red}{C_{s,t}^{Storage}}\) = Cost of storing produced water at storage site (incl. treatment)

\(\textcolor{red}{R_{s,t}^{Storage}}\) = Credit for retrieving stored produced water from storage site

\(\textcolor{red}{C^{TotalSourced}}\) = Total cost of sourcing freshwater

\(\textcolor{red}{C^{TotalDisposal}}\) = Total cost of injecting produced water

\(\textcolor{red}{C^{TotalTreatment}}\) = Total cost of treating produced water

\(\textcolor{red}{C^{TotalCompletionsReuse}}\) = Total cost of reusing produced water

\(\textcolor{red}{C^{TotalPiping}}\) = Total cost of piping produced water

\(\textcolor{red}{C^{TotalStorage}}\) = Total cost of storing produced water

\(\textcolor{red}{C^{TotalPadStorage}}\) = Total cost of storing produced water at completions pad

\(\textcolor{red}{C^{TotalTrucking}}\) = Total cost of trucking produced water

\(\textcolor{red}{C^{Slack}}\) = Total cost of slack variables

\(\textcolor{red}{R^{TotalStorage}}\) = Total credit for withdrawing produced water

\(\textcolor{red}{S_{p,t}^{FracDemand}}\) = Slack variable to meet the completions water demand

\(\textcolor{red}{S_{p,t}^{Production}}\) = Slack variable to process produced water production

\(\textcolor{red}{S_{p,t}^{Flowback}}\) = Slack variable to process flowback water production

\(\textcolor{red}{S_{l,l}^{Pipeline Capacity}}\) = Slack variable to provide necessary pipeline capacity

\(\textcolor{red}{S_{s}^{StorageCapacity}}\) = Slack variable to provide necessary storage capacity

\(\textcolor{red}{S_{k}^{DisposalCapacity}}\) = Slack variable to provide necessary disposal capacity

\(\textcolor{red}{S_{r}^{TreatmentCapacity}}\) = Slack variable to provide necessary treatment capacity

\(\textcolor{red}{S_{o}^{BeneficialReuseCapacity}}\) = Slack variable to provide necessary beneficial reuse capacity

Binary Variables

\(\textcolor{red}{y_{l,l,t}^{Flow}}\) = Directional flow between two locations

\(\textcolor{red}{z_{p,t}^{PadStorage}}\) = Completions pad storage use

Parameters

\(\textcolor{green}{y_{p,t}^{Completions}}\) = Completions demand at a completions site in a time period

If the production tanks are separate, water level and water drainage are tracked at each individual production tank:

\(\textcolor{green}{β_{p,a,t}^{Production}}\) = Produced water supply forecast for a production pad

\(\textcolor{green}{σ_{p,a}^{ProdTank}}\) = Production tank capacity

\(\textcolor{green}{λ_{p,a}^{ProdTank}}\) = Initial water level in production tank

Otherwise, if the production tanks are equalized, the water level and water drainage can be aggregated to a pad level:

\(\textcolor{green}{β_{p,t}^{Production}}\) = Produced water supply forecast for a production pad

\(\textcolor{green}{σ_{p}^{ProdTank}}\) = Combined capacity of equalized production tanks

\(\textcolor{green}{λ_{p}^{ProdTank}}\) = Initial water level in equalized production tanks

\(\textcolor{green}{β_{p,t}^{Flowback}}\) = Flowback supply forecast for a completions pad

\(\textcolor{green}{σ_{l,l}^{Pipeline}}\) = Daily pipeline capacity between two locations

\(\textcolor{green}{σ_{k}^{Disposal}}\) = Daily disposal capacity at a disposal site

\(\textcolor{green}{σ_{s}^{Storage}}\) = Storage capacity at a storage site

\(\textcolor{green}{σ_{p,t}^{PadStorage}}\) = Storage capacity at completions site

\(\textcolor{green}{σ_{r}^{Treatment}}\) = Daily treatment capacity at a treatment site

\(\textcolor{green}{σ_{o}^{BeneficialReuse}}\) = Daily reuse capacity at a beneficial reuse site

\(\textcolor{green}{σ_{f,t}^{Freshwater}}\) = Daily freshwater sourcing capacity at freshwater source

\(\textcolor{green}{σ_{p}^{Offloading,Pad}}\) = Daily truck offloading sourcing capacity per pad

\(\textcolor{green}{σ_{s}^{Offloading,Storage}}\) = Daily truck offloading sourcing capacity per storage site

\(\textcolor{green}{σ_{p}^{Processing,Pad}}\) = Daily processing (e.g. clarification) capacity per pad

\(\textcolor{green}{σ_{s}^{Processing,Storage}}\) = Daily processing (e.g. clarification) capacity at storage site

\(\textcolor{green}{ϵ_{r,w}^{Treatment}}\) = Treatment efficiency for water quality component at treatment site

\(\textcolor{green}{δ^{Truck}}\) = Truck Capacity

\(\textcolor{green}{τ_{p,p}^{Trucking}}\) = Drive time between two pads

\(\textcolor{green}{τ_{p,k}^{Trucking}}\) = Drive time from a pad to a disposal site

\(\textcolor{green}{τ_{p,s}^{Trucking}}\) = Drive time from a pad to a storage site

\(\textcolor{green}{τ_{p,r}^{Trucking}}\) = Drive time from a pad to a treatment site

\(\textcolor{green}{τ_{p,o}^{Trucking}}\) = Drive time from a pad to a beneficial reuse site

\(\textcolor{green}{τ_{s,p}^{Trucking}}\) = Drive time from a storage site to a completions site

\(\textcolor{green}{τ_{s,k}^{Trucking}}\) = Drive time from a storage site to a disposal site

\(\textcolor{green}{τ_{r,k}^{Trucking}}\) = Drive time from a treatment site to a disposal site

\(\textcolor{green}{λ_{s}^{Storage}}\) = Initial storage level at storage site

\(\textcolor{green}{λ_{p}^{PadStorage}}\) = Initial storage level at completions site

\(\textcolor{green}{θ_{p}^{PadStorage}}\) = Terminal storage level at completions site

\(\textcolor{green}{λ_{l,l}^{Pipeline}}\) = Pipeline segment length

\(\textcolor{green}{π_{k}^{Disposal}}\) = Disposal operational cost

\(\textcolor{green}{π_{r}^{Treatment}}\) = Treatment operational cost (may include “clean brine”)

\(\textcolor{green}{π_{p}^{CompletionReuse}}\) = Completions reuse operational cost

\(\textcolor{green}{π_{s}^{Storage}}\) = Storage deposit operational cost

\(\textcolor{green}{π_{p,t}^{PadStorage}}\) = Completions pad operational cost

\(\textcolor{green}{ρ_{s}^{Storage}}\) = Storage withdrawal operational cgreenit

\(\textcolor{green}{π_{l,l}^{Pipeline}}\) = Pipeline operational cost

\(\textcolor{green}{π_{l}^{Trucking}}\) = Trucking hourly cost (by source)

\(\textcolor{green}{π_{f}^{Sourcing}}\) = Fresh sourcing cost (does not include transportation cost)

\(\textcolor{green}{M^{Flow}}\) = Big-M flow parameter

\(\textcolor{green}{ψ^{FracDemand}}\) = Slack cost parameter

\(\textcolor{green}{ψ^{Production}}\) = Slack cost parameter

\(\textcolor{green}{ψ^{Flowback}}\) = Slack cost parameter

\(\textcolor{green}{ψ^{PipelineCapacity}}\) = Slack cost parameter

\(\textcolor{green}{ψ^{StorageCapacity}}\) = Slack cost parameter

\(\textcolor{green}{ψ^{DisposalCapacity}}\) = Slack cost parameter

\(\textcolor{green}{ψ^{TreamentCapacity}}\) = Slack cost parameter

\(\textcolor{green}{ψ^{BeneficialReuseCapacity}}\) = Slack cost parameter

Operational Model Mathematical Program Formulation

The default objective function for this produced water operational model is to minimize costs, which includes operational costs associated with procurement of fresh water, the cost of disposal, trucking and piping produced water between well pads and treatment facilities, and the cost of storing, treating and reusing produced water. A credit for using treated water is also considered, and additional slack variables are included to facilitate the identification of potential issues with input data.

Objective

\[ \begin{align}\begin{aligned}min = \textcolor{red}{C^{TotalSourced}}+\textcolor{red}{C^{TotalDisposal}}+\textcolor{red}{C^{TotalTreatment}}+\textcolor{red}{C^{TotalCompletionsReuse}}+\\ \textcolor{red}{C^{TotalPiping}}+\textcolor{red}{C^{TotalStorage}}+\textcolor{red}{C^{TotalPadStorage}}+ \textcolor{red}{C^{TotalTrucking}}+\textcolor{red}{C^{Slack}-R^{TotalStorage}}\end{aligned}\end{align} \]

Completions Pad Demand Balance: ∀p ∈ CP, t ∈ T

\[ \begin{align}\begin{aligned}\textcolor{green}{γ_{p,t}^{Completions}}=\sum\nolimits_{(n,p)∈NCA}\textcolor{red}{F_{l,l,t}^{Piped}} +\sum\nolimits_{(p,p)∈PCA}\textcolor{red}{F_{l,l,t}^{Piped}} +\sum\nolimits_{(s,p)∈SCA}\textcolor{red}{F_{l,l,t}^{Piped}}\\ +\sum\nolimits_{(p,c)∈CCA}\textcolor{red}{F_{l,l,t}^{Piped}} +\sum\nolimits_{(r,p)∈RCA}\textcolor{red}{F_{l,l,t}^{Piped}} +\sum\nolimits_{(f,p)∈FCA}\textcolor{red}{F_{l,l,t}^{Sourced}}\\ +\sum\nolimits_{(p,p)∈PCT}\textcolor{red}{F_{l,l,t}^{Trucked}} +\sum\nolimits_{(s,p)∈SCT}\textcolor{red}{F_{l,l,t}^{Trucked}} +\sum\nolimits_{(p,p)∈CCT}\textcolor{red}{F_{l,l,t}^{Trucked}}\\ +\sum\nolimits_{(f,p)∈FCT}\textcolor{red}{F_{l,l,t}^{Trucked}} +\textcolor{red}{F_{p,t}^{PadStorageOut}}-\textcolor{red}{F_{p,t}^{PadStorageIn}}+\textcolor{red}{S_{p,t}^{FracDemand}}\end{aligned}\end{align} \]

Completions Pad Storage Balance: ∀p ∈ CP, t ∈ T

This constraint sets the storage level at the completions pad. For each completions pad and for each time period, completions pad storage is equal to storage in last time period plus water put in minus water removed. If it is the first time period, the pad storage is the initial pad storage.

\[\textcolor{red}{L_{p,t}^{PadStorage}} = \textcolor{green}{λ_{p,t=1}^{PadStorage}}+\textcolor{red}{L_{p,t-1}^{PadStorage}}+\textcolor{red}{F_{p,t}^{StorageIn}}-\textcolor{red}{F_{p,t}^{StorageOut}}\]

Completions Pad Storage Capacity: ∀p ∈ CP, t ∈ T

The storage at each completions pad must always be at or below its capacity in every time period.

\[\textcolor{red}{L_{p,t}^{PadStorage}}≤\textcolor{red}{z_{p,t}^{PadStorage}}⋅\textcolor{green}{σ_{p,t}^{PadStorage}}\]

Terminal Completions Pad Storage Level: ∀p ∈ CP, t ∈ T

\[\textcolor{red}{L_{p,t=T}^{PadStorage}}≤\textcolor{green}{θ_{p}^{PadStorage}}\]

The storage in the last period must be at or below its terminal storage level.

Freshwater Sourcing Capacity: ∀f ∈ F, t ∈ T

For each freshwater source and each time period, the outgoing water from the freshwater source is below the freshwater capacity.

\[\sum\nolimits_{(f,p)∈FCA}\textcolor{red}{F_{l,l,t}^{Sourced}} +\sum\nolimits_{(f,p)∈FCT}\textcolor{red}{F_{l,l,t}^{Trucked}} ≤\textcolor{green}{σ_{f,t}^{Freshwater}}\]

Completions Pad Truck Offloading Capacity: ∀p ∈ CP, t ∈ T

For each completions pad and time period, the volume of water being trucked into the completions pad must be below the trucking offloading capacity.

\[ \begin{align}\begin{aligned}\sum\nolimits_{(p,p)∈PCT}\textcolor{red}{F_{l,l,t}^{Trucked}} +\sum\nolimits_{(s,p)∈SCT}\textcolor{red}{F_{l,l,t}^{Trucked}} +\sum\nolimits_{(f,p)∈FCT}\textcolor{red}{F_{l,l,t}^{Trucked}}\\ +\sum\nolimits_{(p,p)∈CCT}\textcolor{red}{F_{l,l,t}^{Trucked}} ≤\textcolor{green}{σ_{p}^{Offloading,Pad}}\end{aligned}\end{align} \]

Completions Pad Processing Capacity:

For each completions pad and time period, the volume of water (excluding freshwater) coming in must be below the processing limit.

\[ \begin{align}\begin{aligned}\sum\nolimits_{(n,p)∈NCA}\textcolor{red}{F_{l,l,t}^{Piped}} +\sum\nolimits_{(p,p)∈PCA}\textcolor{red}{F_{l,l,t}^{Piped}} +\sum\nolimits_{(s,p)∈SCA}\textcolor{red}{F_{l,l,t}^{Piped}}\\ +\sum\nolimits_{(p,c)∈CCA}\textcolor{red}{F_{l,l,t}^{Piped}} +\sum\nolimits_{(r,p)∈RCA}\textcolor{red}{F_{l,l,t}^{Piped}} +\sum\nolimits_{(p,p)∈PCT}\textcolor{red}{F_{l,l,t}^{Trucked}}\\ +\sum\nolimits_{(s,p)∈SCT}\textcolor{red}{F_{l,l,t}^{Trucked}} +\sum\nolimits_{(p,p)∈CCT}\textcolor{red}{F_{l,l,t}^{Trucked}} ≤\textcolor{green}{σ_{p}^{Processing,Pad}}\end{aligned}\end{align} \]

Note

This constraint has not actually been implemented yet.

Storage Site Truck Offloading Capacity: ∀p ∈ S, t ∈ T

For each storage site and each time period, the volume of water being trucked into the storage site must be below the trucking offloading capacity for that storage site.

\[\sum\nolimits_{(p,s)∈PST}\textcolor{red}{F_{l,l,t}^{Trucked}} +\sum\nolimits_{(p,s)∈CST}\textcolor{red}{F_{l,l,t}^{Trucked}} ≤\textcolor{green}{σ_{s}^{Offloading,Storage}}\]

Storage Site Processing Capacity: ∀s ∈ S, t ∈ T

For each storage site and each time period, the volume of water being trucked into the storage site must be less than the processing capacity for that storage site.

\[\sum\nolimits_{(n,s)∈NSA}\textcolor{red}{F_{l,l,t}^{Piped}} +\sum\nolimits_{(p,s)∈PST}\textcolor{red}{F_{l,l,t}^{Trucked}} +\sum\nolimits_{(p,s)∈CST}\textcolor{red}{F_{l,l,t}^{Trucked}} ≤\textcolor{green}{σ_{s}^{Processing,Storage}}\]

Production Tank Balance:

If there are individual production tanks, the water level must be tracked at each tank. The water level at a given tank at the end of each period is equal to the water level at the previous period plus the flowback supply forecast at the pad minus the water that is drained. If it is the first period, it is equal to the initial water level.

For individual production tanks: ∀(p,a) ∈ PAL, t ∈ T

\[\textcolor{red}{L_{p,a,t}^{ProdTank}} = \textcolor{green}{λ_{p,a,t=1}^{ProdTank}}+\textcolor{red}{L_{p,a,t-1}^{ProdTank}}+\textcolor{green}{β_{p,a,t}^{Production}}-\textcolor{red}{F_{p,a,t}^{Drain}}\]

For equalized production tanks: ∀p ∈ P, t ∈ T

\[\textcolor{red}{L_{p,t}^{ProdTank}} = \textcolor{green}{λ_{p,t=1}^{ProdTank}}+\textcolor{red}{L_{p,t-1}^{ProdTank}}+\textcolor{green}{β_{p,t}^{Production}}-\textcolor{red}{F_{p,t}^{Drain}}\]

Production Tank Capacity:

The water level at the production tanks must always be below the production tank capacity.

For individual production tanks: ∀(p,a) ∈ PAL, t ∈ T

\[\textcolor{red}{L_{p,a,t}^{ProdTank}}≤\textcolor{green}{σ_{p,a}^{ProdTank}}\]

For equalized production tanks: ∀p ∈ P, t ∈ T

\[\textcolor{red}{L_{p,t}^{ProdTank}}≤\textcolor{green}{σ_{p}^{ProdTank}}\]

Terminal Production Tank Level Balance:

The water level at the production tanks in the final time period must be below the terminal production tank water level parameter.

For individual production tanks: ∀(p,a) ∈ PAL, t ∈ T

\[\textcolor{red}{L_{p,a,t=T}^{ProdTank}}≤\textcolor{green}{λ_{p,a,t=1}^{ProdTank}}\]

For equalized production tanks: ∀p ∈ P,t ∈ T

\[\textcolor{red}{L_{p,t=T}^{ProdTank}}≤\textcolor{green}{λ_{p,t=1}^{ProdTank}}\]

Tank-to-Pad Production Balance:

If there are individual production tanks, the water drained across all tanks at the completions pad must be equal to the produced water for transport at the pad.

For individual production tanks: ∀p ∈ P, t ∈ T

\[\sum\nolimits_{(p,a)∈PAL}\textcolor{red}{F_{p,a,t}^{Drain}} =\textcolor{red}{B_{p,t}^{Production}}\]

Otherwise, if the production tanks are equalized, the production water drained is measured on an aggregated production pad level.

For equalized production tanks: ∀p ∈ P, t ∈ T

\[\textcolor{red}{F_{p,t}^{Drain}}=\textcolor{red}{B_{p,t}^{Production}}\]

Note

The constraint proposed above is not necessary but included to facilitate switching between (1) an equalized production tank version and (2) a non-equalized production tank version.

Production Pad Supply Balance: ∀p ∈ PP, t ∈ T

All produced water must be accounted for. For each production pad and for each time period, the volume of outgoing water must be equal to the produced water transported out of the production pad.

\[ \begin{align}\begin{aligned}\textcolor{red}{B_{p,t}^{Production}} = \sum\nolimits_{(p,n)∈PNA}\textcolor{red}{F_{l,l,t}^{Piped}} +\sum\nolimits_{(p,p)∈PCA}\textcolor{red}{F_{l,l,t}^{Piped}}+\sum\nolimits_{(p,p)∈PPA}\textcolor{red}{F_{l,l,t}^{Piped}}\\ +\sum\nolimits_{(p,p)∈PCT}\textcolor{red}{F_{l,l,t}^{Trucked}}+\sum\nolimits_{(p,k)∈PKT}\textcolor{red}{F_{l,l,t}^{Trucked}}+\sum\nolimits_{(p,s)∈PST}\textcolor{red}{F_{l,l,t}^{Trucked}}\\ +\sum\nolimits_{(p,r)∈PRT}\textcolor{red}{F_{l,l,t}^{Trucked}} +\sum\nolimits_{(p,o)∈POT}\textcolor{red}{F_{l,l,t}^{Trucked}}+\textcolor{red}{S_{p,t}^{Production}}\end{aligned}\end{align} \]

Completions Pad Supply Balance (i.e. Flowback Balance): ∀p ∈ CP, t ∈ T

All flowback water must be accounted for. For each completions pad and for each time period, the volume of outgoing water must be equal to the forecasted flowback produced water for the completions pad.

\[ \begin{align}\begin{aligned}\textcolor{green}{β_{p,t}^{Flowback}} = \sum\nolimits_{(p,n)∈CNA}\textcolor{red}{F_{l,l,t}^{Piped}}+\sum\nolimits_{(p,c)∈CCA}\textcolor{red}{F_{l,l,t}^{Piped}}+\sum\nolimits_{(p,p)∈CCT}\textcolor{red}{F_{l,l,t}^{Trucked}}+\\\sum\nolimits_{(p,k)∈CKT}\textcolor{red}{F_{l,l,t}^{Trucked}}+\sum\nolimits_{(p,s)∈CST}\textcolor{red}{F_{l,l,t}^{Trucked}}+\sum\nolimits_{(p,r)∈CRT}\textcolor{red}{F_{l,l,t}^{Trucked}} +\textcolor{red}{S_{p,t}^{Flowback}}\end{aligned}\end{align} \]

Network Node Balance: ∀n ∈ N, t ∈ T

Flow balance constraint (i.e., inputs are equal to outputs). For each pipeline node and for each time period, the volume water into the node is equal to the volume of water out of the node.

\[ \begin{align}\begin{aligned}\sum\nolimits_{(p,n)∈PNA}\textcolor{red}{F_{l,l,t}^{Piped}} +\sum\nolimits_{(p,n)∈CNA}\textcolor{red}{F_{l,l,t}^{Piped}} +\sum\nolimits_{(n ̃,n)∈NNA}\textcolor{red}{F_{l,l,t}^{Piped}}+\sum\nolimits_{(s,n)∈SNA}\textcolor{red}{F_{l,l,t}^{Piped}}\\ = \sum\nolimits_{(n,n ̃ )∈NNA}\textcolor{red}{F_{l,l,t}^{Piped}} +\sum\nolimits_{(n,p)∈NCA}\textcolor{red}{F_{l,l,t}^{Piped}}+\sum\nolimits_{(n,k)∈NKA}\textcolor{red}{F_{l,l,t}^{Piped}}\\ +\sum\nolimits_{(n,r)∈NRA}\textcolor{red}{F_{l,l,t}^{Piped}} +\sum\nolimits_{(n,s)∈NSA}\textcolor{red}{F_{l,l,t}^{Piped}} +\sum\nolimits_{(n,o)∈NOA}\textcolor{red}{F_{l,l,t}^{Piped}}\end{aligned}\end{align} \]

Bi-Directional Flow: ∀(l,l) ∈ {PCA,PNA,PPA,CNA,NNA,NCA,NKA,NSA,NRA,…,SOA}, t ∈ T

There can only be flow in one direction for a given pipeline arc in a given time period.

Flow is only allowed in a given direction if the binary indicator for that direction is “on”.

\[\textcolor{red}{y_{l,l ̃,t}^{Flow}}+\textcolor{red}{y_{l ̃,l,t}^{Flow}} = 1\]

Note

Technically this constraint should only be enforced for truly reversible arcs (e.g. NCA and CNA); and even then it only needs to be defined per one reversible arc (e.g. NCA only and not NCA and CNA).

\[\textcolor{red}{F_{l,l,t}^{Piped}}≤\textcolor{red}{y_{l,l,t}^{Flow}}⋅\textcolor{green}{M^{Flow}}\]

Storage Site Balance: ∀s ∈ S, t ∈ T

For each storage site and for each time period, if it is the first time period, the storage level is the initial storage. Otherwise, the storage level is equal to the storage level in the previous time period plus water inputs minus water outputs.

\[ \begin{align}\begin{aligned}\textcolor{red}{L_{s,t}^{Storage}} = \textcolor{green}{λ_{s,t=1}^{Storage}}+\textcolor{red}{L_{s,t-1}^{Storage}}+\sum\nolimits_{(n,s)∈NSA}\textcolor{red}{F_{l,l,t}^{Piped}} +\sum\nolimits_{(p,s)∈PST}\textcolor{red}{F_{l,l,t}^{Trucked}}\\ +\sum\nolimits_{(p,s)∈CST}\textcolor{red}{F_{l,l,t}^{Trucked}}-\sum\nolimits_{(s,n)∈SNA}\textcolor{red}{F_{l,l,t}^{Piped}}-\sum\nolimits_{(s,p)∈SCA}\textcolor{red}{F_{l,l,t}^{Piped}}-\sum\nolimits_{(s,k)∈SKA}\textcolor{red}{F_{l,l,t}^{Piped}}\\ -\sum\nolimits_{(s,r)∈SRA}\textcolor{red}{F_{l,l,t}^{Piped}}-\sum\nolimits_{(s,o)∈SOA}\textcolor{red}{F_{l,l,t}^{Piped}}-\sum\nolimits_{(s,p)∈SCT}\textcolor{red}{F_{l,l,t}^{Trucked}}-\sum\nolimits_{(s,k)∈SKT}\textcolor{red}{F_{l,l,t}^{Trucked}}\end{aligned}\end{align} \]

Pipeline Capacity:

∀(l,l) ∈ {PCA,PNA,PPA,CNA,NNA,NCA,NKA,NSA,NRA,…,SOA}, [t ∈ T]

\[\textcolor{red}{F_{l,l,[t]}^{Capacity}} = \textcolor{green}{σ_{l,l}^{Pipeline}}+\textcolor{red}{S_{l,l}^{PipelineCapacity}}\]

∀(l,l) ∈ {PCA,PNA,PPA,CNA,NNA,NCA,NKA,NSA,NRA,…,SOA}, t ∈ T

\[\textcolor{red}{F_{l,l,t}^{Piped}}≤\textcolor{red}{F_{l,l,[t]}^{Capacity}}\]

Storage Capacity:

The total stored water in a given time period must be less than the capacity. If the storage capacity limits the feasibility, the slack variable will be nonzero, and the storage capacity will be increased to allow a feasible solution.

∀s ∈ S,[t ∈ T]

\[\textcolor{red}{X_{s,[t]}^{Capacity}} = \textcolor{green}{σ_{s}^{Storage}}+\textcolor{red}{S_{s}^{StorageCapacity}}\]

∀s ∈ S, t ∈ T

\[\textcolor{red}{L_{s,t}^{Storage}}≤\textcolor{red}{X_{s,[t]}^{Capacity}}\]

Disposal Capacity:

The total disposed water in a given time period must be less than the capacity. If the disposal capacity limits the feasibility, the slack variable will be nonzero, and the disposal capacity will be increased to allow a feasible solution.

∀k ∈ K, [t ∈ T]

\[\textcolor{red}{D_{k,[t]}^{Capacity}} = \textcolor{green}{σ_{k}^{Disposal}}+\textcolor{red}{S_{k}^{DisposalCapacity}}\]

∀k ∈ K, t ∈ T

\[ \begin{align}\begin{aligned}\sum\nolimits_{(n,k)∈NKA}\textcolor{red}{F_{l,l,t}^{Piped}} +\sum\nolimits_{(s,k)∈SKA}\textcolor{red}{F_{l,l,t}^{Piped}}+\sum\nolimits_{(s,k)∈SKT}\textcolor{red}{F_{l,l,t}^{Trucked}}+\sum\nolimits_{(p,k)∈PKT}\textcolor{red}{F_{l,l,t}^{Trucked}}\\ +\sum\nolimits_{(p,k)∈CKT}\textcolor{red}{F_{l,l,t}^{Trucked}}+\sum\nolimits_{(r,k)∈RKT}\textcolor{red}{F_{l,l,t}^{Trucked}} ≤\textcolor{red}{D_{k,[t]}^{Capacity}}\end{aligned}\end{align} \]

∀k ∈ K, t ∈ T

\[ \begin{align}\begin{aligned}\sum\nolimits_{(n,k)∈NKA}\textcolor{red}{F_{l,l,t}^{Piped}} +\sum\nolimits_{(s,k)∈SKA}\textcolor{red}{F_{l,l,t}^{Piped}}+\sum\nolimits_{(s,k)∈SKT}\textcolor{red}{F_{l,l,t}^{Trucked}}+\sum\nolimits_{(p,k)∈PKT}\textcolor{red}{F_{l,l,t}^{Trucked}}\\ +\sum\nolimits_{(p,k)∈CKT}\textcolor{red}{F_{l,l,t}^{Trucked}}+\sum\nolimits_{(r,k)∈RKT}\textcolor{red}{F_{l,l,t}^{Trucked}} =\textcolor{red}{F_{k,t}^{DisposalDestination}}\end{aligned}\end{align} \]

Treatment Capacity:

The total treated water in a given time period must be less than the capacity. If the treatment capacity limits the feasibility, the slack variable will be nonzero, and the treatment capacity will be increased to allow a feasible solution.

∀r ∈ R, t ∈ T

\[ \begin{align}\begin{aligned}\sum\nolimits_{(n,r)∈NRA}\textcolor{red}{F_{l,l,t}^{Piped}} +\sum\nolimits_{(s,r)∈SRA}\textcolor{red}{F_{l,l,t}^{Piped}}+\sum\nolimits_{(p,r)∈PRT}\textcolor{red}{F_{l,l,t}^{Trucked}}\\ +\sum\nolimits_{(p,r)∈CRT}\textcolor{red}{F_{l,l,t}^{Trucked}}≤\textcolor{green}{σ_{r}^{Treatment}}+\textcolor{red}{S_{r}^{TreatmentCapacity}}\end{aligned}\end{align} \]

∀r ∈ R, t ∈ T

\[ \begin{align}\begin{aligned}\sum\nolimits_{(n,r)∈NRA}\textcolor{red}{F_{l,l,t}^{Piped}} +\sum\nolimits_{(s,r)∈SRA}\textcolor{red}{F_{l,l,t}^{Piped}}+\sum\nolimits_{(p,r)∈PRT}\textcolor{red}{F_{l,l,t}^{Trucked}}\\ +\sum\nolimits_{(p,r)∈CRT}\textcolor{red}{F_{l,l,t}^{Trucked}}=\textcolor{red}{F_{r,t}^{TreatmentDestination}}\end{aligned}\end{align} \]

Beneficial Reuse Capacity:

The total water for beneficial reuse in a given time period must be less than the capacity. If the beneficial reuse capacity limits the feasibility, the slack variable will be nonzero, and the beneficial reuse capacity will be increased to allow a feasible solution.

∀o ∈ O, t ∈ T

\[\sum\nolimits_{(n,o)∈NOA}\textcolor{red}{F_{l,l,t}^{Piped}} +\sum\nolimits_{(s,o)∈SOA}\textcolor{red}{F_{l,l,t}^{Piped}} +\sum\nolimits_{(p,o)∈POT}\textcolor{red}{F_{l,l,t}^{Trucked}} ≤\textcolor{green}{σ_{o}^{Reuse}}+\textcolor{red}{S_{o}^{ReuseCapacity}}\]

∀o ∈ O, t ∈ T

\[\sum\nolimits_{(n,o)∈NOA}\textcolor{red}{F_{l,l,t}^{Piped}} +\sum\nolimits_{(s,o)∈SOA}\textcolor{red}{F_{l,l,t}^{Piped}} +\sum\nolimits_{(p,o)∈POT}\textcolor{red}{F_{l,l,t}^{Trucked}} =\textcolor{red}{F_{o,t}^{BeneficialReuseDestination}}\]

Fresh Sourcing Cost: ∀f ∈ F, p ∈ CP, t ∈ T

For each freshwater source, for each completions pad, and for each time period, the freshwater sourcing cost is equal to all output from the freshwater source times the freshwater sourcing cost.

\[ \begin{align}\begin{aligned}\textcolor{red}{C_{f,p,t}^{Sourced}} =(\textcolor{red}{F_{f,p,t}^{Sourced}}+\textcolor{red}{F_{f,p,t}^{Trucked}})⋅\textcolor{green}{π_{f}^{Sourcing}}\\\textcolor{red}{C^{TotalSourced}} = \sum\nolimits_{∀t∈T}\sum\nolimits_{(f,p)∈FCA}\textcolor{red}{C_{f,p,t}^{Sourced}}\end{aligned}\end{align} \]

Disposal Cost: ∀k ∈ K, t ∈ T

For each disposal site, for each time period, the disposal cost is equal to all water moved into the disposal site multiplied by the operational disposal cost. Total disposal cost is the sum of disposal costs over all time periods and all disposal sites.

\[ \begin{align}\begin{aligned}\textcolor{red}{C_{k,t}^{Disposal}} = (\sum\nolimits_{(l,l)∈{NKA,RKA,SKA}}\textcolor{red}{F_{l,l,t}^{Piped}}+\sum\nolimits_{(l,l)∈{PKT,CKT,SKT,RKT}}\textcolor{red}{F_{l,l,t}^{Trucked}})⋅ \textcolor{green}{π_{k}^{Disposal}}\\\textcolor{red}{C^{TotalDisposal}} = \sum\nolimits_{∀t∈T}\sum\nolimits_{k∈K}\textcolor{red}{C_{k,t}^{Disposal}}\end{aligned}\end{align} \]

Treatment Cost: ∀r ∈ R, t ∈ T

For each treatment site, for each time period, the treatment cost is equal to all water moved to the treatment site multiplied by the operational treatment cost. The total treatments cost is the sum of treatment costs over all time periods and all treatment sites.

\[ \begin{align}\begin{aligned}\textcolor{red}{C_{r,t}^{Treatment}} = (\sum\nolimits_{(l,l)∈{NRA,SRA}}\textcolor{red}{F_{l,l,t}^{Piped}}+\sum\nolimits_{(l,l)∈{PRT,CRT}}\textcolor{red}{F_{l,l,t}^{Trucked}})⋅ \textcolor{green}{π_{r}^{Treatment}}\\\textcolor{red}{C^{TotalTreatment}} = \sum\nolimits_{∀t∈T}\sum\nolimits_{r∈R}\textcolor{red}{C_{r,t}^{Treatment}}\end{aligned}\end{align} \]

Treatment Balance: ∀r ∈ R, t ∈ T

Water input into treatment facility is treated with a level of efficiency, meaning only a given percentage of the water input is outputted to be reused at the completions pads.

\[ \begin{align}\begin{aligned}\textcolor{green}{ϵ^{Treatment}}⋅(\sum\nolimits_{(n,r)∈NRA}\textcolor{red}{F_{l,l,t}^{Piped}}+\sum\nolimits_{(s,r)∈SRA}\textcolor{red}{F_{l,l,t}^{Piped}}+\sum\nolimits_{(p,r)∈PRT}\textcolor{red}{F_{l,l,t}^{Trucked}}\\ +\sum\nolimits_{(p,r)∈CRT}\textcolor{red}{F_{l,l,t}^{Trucked}} )=\sum\nolimits_{(r,p)∈RCA}\textcolor{red}{F_{l,l,t}^{Piped}} + \textcolor{red}{F_{r,t}^{UnusedTreatedWater}}\end{aligned}\end{align} \]

where \(\textcolor{green}{ϵ^{Treatment}}\) <1

Completions Reuse Cost: ∀p ∈ P, t ∈ T

Completions reuse water is all water that meets completions pad demand, excluding freshwater. Completions reuse cost is the volume of completions reused water multiplied by the cost for reuse.

\[ \begin{align}\begin{aligned}\textcolor{red}{C_{p,t}^{CompletionsReuse}} = (\sum\nolimits_{(n,p)∈NCA}\textcolor{red}{F_{l,l,t}^{Piped}}+\sum\nolimits_{(p,p)∈PCA}\textcolor{red}{F_{l,l,t}^{Piped}}+\sum\nolimits_{(r,p)∈RCA}\textcolor{red}{F_{l,l,t}^{Piped}}\\ +\sum\nolimits_{(s,p)∈SCA}\textcolor{red}{F_{l,l,t}^{Piped}}+\sum\nolimits_{(p,c)∈CCA}\textcolor{red}{F_{l,l,t}^{Piped}}+\sum\nolimits_{(p,p)∈CCT}\textcolor{red}{F_{l,l,t}^{Trucked}}\\ +\sum\nolimits_{(p,p)∈PCT}\textcolor{red}{F_{l,l,t}^{Trucked}}+\sum\nolimits_{(s,p)∈SCT}\textcolor{red}{F_{l,l,t}^{Trucked}})⋅ \textcolor{green}{π_{p}^{CompletionsReuse}}\end{aligned}\end{align} \]

Note

Freshwater sourcing is excluded from completions reuse costs.

\[\textcolor{red}{C^{TotalCompletionsReuse}} = \sum\nolimits_{∀t∈T}\sum\nolimits_{p∈CP}\textcolor{red}{C_{p,t}^{CompletionsReuse}}\]

Piping Cost: ∀(l,l) ∈ {PPA,…,CCA}, t ∈ T

Piping cost is the total volume of piped water multiplied by the cost for piping.

\[ \begin{align}\begin{aligned}\textcolor{red}{C_{l,l,t}^{Piped}} = (\textcolor{red}{F_{l,l,t}^{Piped}}+\textcolor{red}{F_{l,l,t}^{Sourced}})⋅ \textcolor{green}{π_{l,l}^{Pipeline}}\\\textcolor{red}{C^{TotalPiping}} = \sum\nolimits_({t∈T}\sum\nolimits_{∀(l,l)∈{PPA,…}}\textcolor{red}{C_{l,l,t}^{Piped}}\end{aligned}\end{align} \]

Note

The constraints above explicitly consider freshwater piping via FCA arcs.

Storage Deposit Cost: ∀s ∈ S, t ∈ T

Cost of depositing into storage is equal to the total volume of water moved into storage multiplied by the storage operation cost rate.

\[ \begin{align}\begin{aligned}\textcolor{red}{C_{s,t}^{Storage}} = (\sum\nolimits_{(l,l)∈{NSA}}\textcolor{red}{F_{l,l,t}^{Piped}}+\sum\nolimits_{(l,l)∈{CST}}\textcolor{red}{F_{l,l,t}^{Trucked}}+\sum\nolimits_{(l,s)∈{PST}}\textcolor{red}{F_{l,s,t}^{Trucked}})⋅ \textcolor{green}{π_{s}^{Storage}}\\\textcolor{red}{C^{TotalStorage}} = \sum\nolimits_{∀t∈T}\sum\nolimits_{∀s∈S}\textcolor{red}{C_{s,t}^{Storage}}\end{aligned}\end{align} \]

Storage Withdrawal Credit: ∀s ∈ S, t ∈ T

Credits from withdrawing from storage is equal to the total volume of water moved out from storage multiplied by the storage operation credit rate.

\[ \begin{align}\begin{aligned}\textcolor{red}{R_{s,t}^{Storage}} = (\sum\nolimits_{(l,l)∈{SNA,SCA,SKA,SRA,SOA}}\textcolor{red}{F_{l,l,t}^{Piped}}+\sum\nolimits_{(l,l)∈{SCT,SKT}}\textcolor{red}{F_{l,l,t}^{Trucked}})⋅ \textcolor{green}{ρ_{s}^{Storage}}\\\textcolor{red}{R^{TotalStorage}} = \sum\nolimits_{∀t∈T}\sum\nolimits_{∀s∈S}\textcolor{red}{R_{s,t}^{Storage}}\end{aligned}\end{align} \]

Pad Storage Cost: ∀l ∈ L, l ̃ ∈ L, t ∈ T

\[\textcolor{red}{C^{TotalPadStorage}} = \sum\nolimits_{∀t∈T}\sum\nolimits_{∀p∈CP}\textcolor{red}{z_{p,t}^{PadStorage}}⋅\textcolor{green}{π_{p,t}^{PadStorage}}\]

Trucking Cost (Simplified)

Trucking cost between two locations for time period is equal to the trucking volume between locations in time t divided by the truck capacity [this gets # of truckloads] multiplied by the lead time between two locations and hourly trucking cost.

\[ \begin{align}\begin{aligned}\textcolor{red}{C_{l,l ̃ ,t}^{Trucked}} = \textcolor{red}{F_{l,l ̃,t}^{Trucked}}⋅\textcolor{green}{1⁄δ^{Truck}}⋅\textcolor{green}{τ_{p,p}^{Trucking}}⋅\textcolor{green}{π_{l}^{Trucking}}\\\textcolor{red}{C^{TotalTrucking}} = \sum\nolimits_{∀t∈T}\sum\nolimits_{∀(l,l)∈{PPA,…,CCT}}\textcolor{red}{C_{l,l ̃ ,t}^{Trucked}}\end{aligned}\end{align} \]

Note

The constraints above explicitly consider freshwater trucking via FCT arcs.

Slack Costs:

Weighted sum of the slack variables. In the case that the model is infeasible, these slack variables are used to determine where the infeasibility occurs (e.g. pipeline capacity is not sufficient).

\[ \begin{align}\begin{aligned}\textcolor{red}{C^{Slack}} = \sum\nolimits_{p∈CP}\sum\nolimits_{t∈T}\textcolor{red}{S_{p,t}^{FracDemand}}⋅\textcolor{green}{ψ^{FracDemand}}+\sum\nolimits_{p∈PP}\sum\nolimits_{t∈T}\textcolor{red}{S_{p,t}^{Production}} ⋅\textcolor{green}{ψ^{Production}}\\ +\sum\nolimits_{p∈CP}\sum\nolimits_{t∈T}\textcolor{red}{S_{p,t}^{Flowback}}⋅\textcolor{green}{ψ^{Flowback}}+\sum\nolimits_{(l,l)∈{…}}\textcolor{red}{S_{l,l}^{PipelineCapacity}} ⋅\textcolor{green}{ψ^{PipeCapacity}}\\ +\sum\nolimits_{s∈S}\textcolor{red}{S_{s}^{StorageCapacity}} ⋅\textcolor{green}{ψ^{StorageCapacity}}+\sum\nolimits_{k∈K}\textcolor{red}{S_{k}^{DisposalCapacity}}⋅\textcolor{green}{ψ^{DisposalCapacity}}\\ +\sum\nolimits_{r∈R}\textcolor{red}{S_{r}^{TreatmentCapacity}} ⋅\textcolor{green}{ψ^{TreatmentCapacity}}+\sum\nolimits_{o∈O}\textcolor{red}{S_{o}^{BeneficialReuseCapacity}} ⋅\textcolor{green}{ψ^{BeneficialReuseCapacity}}\end{aligned}\end{align} \]
Operational Model Water Quality Extension

An extension to this operational optimization model measures the water quality across all locations over time. As of now, water quality is not a decision variable. It is calculated after optimization of the operational model. The process for calculating water quality is as follows: the operational model is first solved to optimality, water quality variables and constraints are added, flow rates and storage levels are fixed to the solved values at optimality, and the water quality is calculated.

Note

Fixed variables are denoted in purple in the documentation.

Assumptions:

  • Water quality at a production pad or completions pad remains the same across all time periods

  • When blending flows of different water quality, they blend linearly

  • Treatment does not affect water quality

Water Quality Sets

\(\textcolor{blue}{w ∈ W}\) Water Quality Components (e.g., TDS)

Water Quality Parameters

\(\textcolor{green}{v_{l,w,[t]}}\) = Water quality at well pad

\(\textcolor{green}{ξ_{l,w}}\) = Initial water quality at storage

Water Quality Variables

\(\textcolor{red}{Q_{l,w,t}}\) = Water quality at location

Disposal Site Water Quality ∀k ∈ K, w ∈ W, t ∈ T

The water quality of disposed water is dependent on the flow rates into the disposal site and the quality of each of these flows.

\[ \begin{align}\begin{aligned}\sum\nolimits_{(n,k)∈NKA}\textcolor{purple}{F_{l,l,t}^{Piped}}⋅\textcolor{red}{Q_{n,w,t}} +\sum\nolimits_{(s,k)∈SKA}\textcolor{purple}{F_{l,l,t}^{Piped}}⋅\textcolor{red}{Q_{s,w,t}}+\sum\nolimits_{(r,k)∈RKA}\textcolor{purple}{F_{l,l,t}^{Piped}}⋅\textcolor{red}{Q_{r,w,t}}\\+\sum\nolimits_{(s,k)∈SKT}\textcolor{purple}{F_{l,l,t}^{Trucked}}⋅\textcolor{red}{Q_{s,w,t}}+\sum\nolimits_{(p,k)∈PKT}\textcolor{purple}{F_{l,l,t}^{Trucked}}⋅\textcolor{red}{Q_{p,w,t}}\\+\sum\nolimits_{(p,k)∈CKT}\textcolor{purple}{F_{l,l,t}^{Trucked}}⋅\textcolor{red}{Q_{p,w,t}}+\sum\nolimits_{(r,k)∈RKT}\textcolor{purple}{F_{l,l,t}^{Trucked}}⋅\textcolor{red}{Q_{r,w,t}}\\=\textcolor{purple}{F_{k,t}^{DisposalDestination}}⋅\textcolor{red}{Q_{k,w,t}}\end{aligned}\end{align} \]

Storage Site Water Quality ∀s ∈ S, w ∈ W, t ∈ T

The water quality at storage sites is dependent on the flow rates into the storage site, the volume of water in storage in the previous time period, and the quality of each of these flows. Even mixing is assumed, so all outgoing flows have the same water quality. If it is the first time period, the initial storage level and initial water quality replaces the water stored and water quality in the previous time period respectively.

\[ \begin{align}\begin{aligned}\textcolor{green}{λ_{s,t=1}^{Storage}}⋅\textcolor{green}{ξ_{s,w}} +\textcolor{purple}{L_{s,t-1}^{Storage}}⋅\textcolor{red}{Q_{s,w,t-1}} +\sum\nolimits_{(n,s)∈NSA}\textcolor{purple}{F_{l,l,t}^{Piped}}⋅\textcolor{red}{Q_{n,w,t}}\\+\sum\nolimits_{(p,s)∈PST}\textcolor{purple}{F_{l,l,t}^{Trucked}}⋅\textcolor{red}{Q_{p,w,t}} +\sum\nolimits_{(p,s)∈CST}\textcolor{purple}{F_{l,l,t}^{Trucked}}⋅\textcolor{red}{Q_{p,w,t}}\\= \textcolor{red}{Q_{s,w,t}}⋅(\textcolor{purple}{L_{s,t}^{Storage}} +\sum\nolimits_{(s,n)∈SNA}\textcolor{purple}{F_{l,l,t}^{Piped}}+\sum\nolimits_{(s,p)∈SCA}\textcolor{purple}{F_{l,l,t}^{Piped}}+\sum\nolimits_{(s,k)∈SKA}\textcolor{purple}{F_{l,l,t}^{Piped}}\\+\sum\nolimits_{(s,r)∈SRA}\textcolor{purple}{F_{l,l,t}^{Piped}}+\sum\nolimits_{(s,o)∈SOA}\textcolor{purple}{F_{l,l,t}^{Piped}}+\sum\nolimits_{(s,p)∈SCT}\textcolor{purple}{F_{l,l,t}^{Trucked}}+\sum\nolimits_{(s,k)∈SKT}\textcolor{purple}{F_{l,l,t}^{Trucked}})\end{aligned}\end{align} \]

Treatment Site Water Quality ∀r ∈ R, w ∈ W, t ∈ T

The water quality at treatment sites is dependent on the flow rates into the treatment site, the efficiency of treatment, and the water quality of the flows. Even mixing is assumed, so all outgoing flows have the same water quality. The treatment process does not affect water quality

\[ \begin{align}\begin{aligned}\textcolor{green}{ϵ_{r,w}^{Treatment}}⋅(\sum\nolimits_{(n,r)∈NRA}\textcolor{purple}{F_{l,l,t}^{Piped}}⋅\textcolor{red}{Q_{n,w,t}} +\sum\nolimits_{(s,r)∈SRA}\textcolor{purple}{F_{l,l,t}^{Piped}}⋅\textcolor{red}{Q_{s,w,t}}\\+\sum\nolimits_{(p,r)∈PRT}\textcolor{purple}{F_{l,l,t}^{Trucked}}⋅\textcolor{red}{Q_{p,w,t}} +\sum\nolimits_{(p,r)∈CRT}\textcolor{purple}{F_{l,l,t}^{Trucked}}⋅\textcolor{red}{Q_{p,w,t}} )\\= \textcolor{red}{Q_{r,w,t}}⋅(\sum\nolimits_{(r,p)∈RCA}\textcolor{purple}{F_{l,l,t}^{Piped}} + \textcolor{purple}{F_{r,t}^{UnusedTreatedWater}})\end{aligned}\end{align} \]

where \(\textcolor{green}{ϵ_{r,w}^{Treatment}}\) <1

Network Node Water Quality ∀n ∈ N, w ∈ W, t ∈ T

The water quality at nodes is dependent on the flow rates into the node and the water quality of the flows. Even mixing is assumed, so all outgoing flows have the same water quality.

\[ \begin{align}\begin{aligned}\sum\nolimits_{(p,n)∈PNA}\textcolor{purple}{F_{l,l,t}^{Piped}}⋅\textcolor{red}{Q_{p,w,t}} +\sum\nolimits_{(p,n)∈CNA}\textcolor{purple}{F_{l,l,t}^{Piped}}⋅\textcolor{red}{Q_{p,w,t}}\\+\sum\nolimits_{(n ̃,n)∈NNA}\textcolor{purple}{F_{l,l,t}^{Piped}}⋅\textcolor{red}{Q_{n,w,t}}+\sum\nolimits_{(s,n)∈SNA}\textcolor{purple}{F_{l,l,t}^{Piped}}⋅\textcolor{red}{Q_{s,w,t}}\\= \textcolor{red}{Q_{n,w,t}}⋅(\sum\nolimits_{(n,n ̃)∈NNA}\textcolor{purple}{F_{l,l,t}^{Piped}} +\sum\nolimits_{(n,p)∈NCA}\textcolor{purple}{F_{l,l,t}^{Piped}}\\+\sum\nolimits_{(n,k)∈NKA}\textcolor{purple}{F_{l,l,t}^{Piped}} +\sum\nolimits_{(n,r)∈NRA}\textcolor{purple}{F_{l,l,t}^{Piped}}\\+\sum\nolimits_{(n,s)∈NSA}\textcolor{purple}{F_{l,l,t}^{Piped}} +\sum\nolimits_{(n,o)∈NOA}\textcolor{purple}{F_{l,l,t}^{Piped}})\end{aligned}\end{align} \]

Beneficial Reuse Water Quality ∀o ∈ O, w ∈ W, t ∈ T

The water quality at beneficial reuse sites is dependent on the flow rates into the site and the water quality of the flows.

\[ \begin{align}\begin{aligned}\sum\nolimits_{(n,o)∈NOA}\textcolor{purple}{F_{l,l,t}^{Piped}}⋅\textcolor{red}{Q_{n,w,t}} +\sum\nolimits_{(s,o)∈SOA}\textcolor{purple}{F_{l,l,t}^{Piped}}⋅\textcolor{red}{Q_{s,w,t}} +\sum\nolimits_{(p,o)∈POT}\textcolor{purple}{F_{l,l,t}^{Trucked}}⋅\textcolor{red}{Q_{p,w,t}}\\= \textcolor{red}{Q_{o,w,t}}⋅\textcolor{purple}{F_{o,t}^{BeneficialReuseDestination}}\end{aligned}\end{align} \]
Operational Model Terminology

Beneficial Reuse Options: This term refers to the reuse of water at mining facilities, farms, etc.

Completions Demand: Demand set by completions pads. This demand can be met by produced water, treated water, or freshwater.

Completions Reuse Water: Water that meets demand at a completions site. This does not include freshwater or water for beneficial reuse.

Network Nodes: These are branch points for pipelines only.

Note

Well pads are not a subset of network nodes.

[t]: This notation indicates that timing of capacity expansion has not yet been implemented.

Terminal Storage Level: These are goal storage levels for the final time period. Without this, the storage levels would likely be depleted in the last time period.

Strategic Water Management
Overview

Given a set of existing network components (completion pads, storage pads, production pads, and distribution options like trucks and/or pipelines) and capacity expansion options, the strategic water management model provides an insight into financial opportunities and mid-long term investment decisions to reduce operational costs or maximize reuse or reduce fresh water consumption.

Section

Terminology

Strategic Model Mathematical Notation

Strategic Model Mathematical Program Formulation

Strategic Model Water Quality Extension

Strategic Model Discrete Water Quality Extension

References

Terminology

Beneficial reuse options: This term refers to the reuse of water at mining facilities, farms, etc.

Completions demand: Demand set by completions pads. This demand can be met by produced water, treated water, or freshwater.

Completions reuse water: Water that meets demand at a completions site. This does not include freshwater or water for beneficial reuse.

Network Nodes: These are branch points for pipelines only.

Note

Well pads are not a subset of network nodes.

\([\textcolor{blue}{t}]\) or \([\textcolor{blue}{t \in T}]\) : This notation indicates that timing of capacity expansion has not yet been implemented.

Terminal storage level: These are goal storage levels for the final time period. Without this, the storage levels would likely be depleted in the last time period.

Water boosting: Moving large volumes of water requires water pumps. Water boosting refers to the infrastructure required to maintain water pressure.

Strategic Model Mathematical Notation

Sets

\(\textcolor{blue}{t \in T}\) Time periods (i.e. days)

\(\textcolor{blue}{p \in P}\) Well pads

\(\textcolor{blue}{p \in PP}\) Production pads (subset of well pads \(\textcolor{blue}{P}\))

\(\textcolor{blue}{p \in CP}\) Completions pads (subset of well pads \(\textcolor{blue}{P}\))

\(\textcolor{blue}{f \in F}\) Freshwater sources

\(\textcolor{blue}{k \in K}\) Disposal sites

\(\textcolor{blue}{s \in S}\) Storage sites

\(\textcolor{blue}{r \in R}\) Treatment sites

\(\textcolor{blue}{o \in O}\) Beneficial reuse options

\(\textcolor{blue}{n \in N}\) Network nodes

\(\textcolor{blue}{l \in L}\) Locations (superset of well pads, disposal sites, nodes, …)

\(\textcolor{blue}{d \in D}\) Pipeline diameters

\(\textcolor{blue}{c \in C}\) Storage capacities

\(\textcolor{blue}{j \in J}\) Treatment capacities

\(\textcolor{blue}{i \in I}\) Injection (i.e. disposal) capacities

Note

The sets for capacity sizes \(\textcolor{blue}{d \in D}\), \(\textcolor{blue}{c \in C}\), \(\textcolor{blue}{j \in J}\), \(\textcolor{blue}{i \in I}\) should also include the 0th case (e.g., 0 bbl) that indicates the choice to not expand capacity. Alternatively, if it is desired to only consider sizes to build, the 0th case can be left out.

\(\textcolor{blue}{b \in B}\) Treatment technologies

\(\textcolor{blue}{(p,p) \in PCA}\) Production-to-completions pipeline arcs

\(\textcolor{blue}{(p,n) \in PNA}\) Production-to-node pipeline arcs

\(\textcolor{blue}{(p,p) \in PPA}\) Production-to-production pipeline arcs

\(\textcolor{blue}{(p,n) \in CNA}\) Completions-to-node pipeline arcs

\(\textcolor{blue}{(p,p) \in CCA}\) Completions-to-completions pipeline arcs

\(\textcolor{blue}{(n,n) \in NNA}\) Node-to-node pipeline arcs

\(\textcolor{blue}{(n,p) \in NCA}\) Node-to-completions pipeline arcs

\(\textcolor{blue}{(n,k) \in NKA}\) Node-to-disposal pipeline arcs

\(\textcolor{blue}{(n,s) \in NSA}\) Node-to-storage pipeline arcs

\(\textcolor{blue}{(n,r) \in NRA}\) Node-to-treatment pipeline arcs

\(\textcolor{blue}{(n,o) \in NOA}\) Node-to-beneficial reuse pipeline arcs

\(\textcolor{blue}{(f,p) \in FCA}\) Freshwater-to-completions pipeline arcs

\(\textcolor{blue}{(r,n) \in RNA}\) Treatment-to-node pipeline arcs

\(\textcolor{blue}{(r,p) \in RCA}\) Treatment-to-completions pipeline arcs

\(\textcolor{blue}{(r,k) \in RKA}\) Treatment-to-disposal pipeline arcs

\(\textcolor{blue}{(r,s) \in RSA}\) Treatment-to-storage pipeline arcs

\(\textcolor{blue}{(s,n) \in SNA}\) Storage-to-node pipeline arcs

\(\textcolor{blue}{(s,p) \in SCA}\) Storage-to-completions pipeline arcs

\(\textcolor{blue}{(s,k) \in SKA}\) Storage-to-disposal pipeline arcs

\(\textcolor{blue}{(s,r) \in SRA}\) Storage-to-treatment pipeline arcs

\(\textcolor{blue}{(s,o) \in SOA}\) Storage-to-beneficial reuse pipeline arcs

\(\textcolor{blue}{(p,p) \in PCT}\) Production-to-completions trucking arcs

\(\textcolor{blue}{(p,k) \in PKT}\) Production-to-disposal trucking arcs

\(\textcolor{blue}{(p,s) \in PST}\) Production-to-storage trucking arcs

\(\textcolor{blue}{(p,r) \in PRT}\) Production-to-treatment trucking arcs

\(\textcolor{blue}{(p,o) \in POT}\) Production-to-beneficial reuse trucking arcs

\(\textcolor{blue}{(f,p) \in FCT}\) Freshwater-to-completions trucking arcs

\(\textcolor{blue}{(p,k) \in CKT}\) Completions-to-disposal trucking arcs

\(\textcolor{blue}{(p,s) \in CST}\) Completions-to-storage trucking arcs

\(\textcolor{blue}{(p,r) \in CRT}\) Completions-to-treatment trucking arcs

\(\textcolor{blue}{(p,p) \in CCT}\) Completions-to-completions trucking arcs (flowback reuse)

\(\textcolor{blue}{(s,p) \in SCT}\) Storage-to-completions trucking arcs

\(\textcolor{blue}{(s,k) \in SKT}\) Storage-to-disposal trucking arcs

\(\textcolor{blue}{(r,k) \in RKT}\) Treatment-to-disposal trucking arcs

Continuous Variables

\(\textcolor{red}{F_{l,\tilde{l},t}^{Piped}}\) = Produced water piped from one location to another location

\(\textcolor{red}{F_{l,\tilde{l},t}^{Trucked}}\) = Water trucked from one location to another location

\(\textcolor{red}{F_{f,p,t}^{Sourced}}\) = Fresh water sourced from source to completions

\(\textcolor{red}{F_{p,t}^{PadStorageIn}}\) = Water put into completions pad storage

\(\textcolor{red}{F_{p,t}^{PadStorageOut}}\) = Water removed from completions pad storage

\(\textcolor{red}{F_{r,t}^{DesalinatedWater}}\) = Water removed from system post desalination

\(\textcolor{red}{F_{s,t}^{StorageEvaporationStream}}\) = Water at storage lost to evaporation

\(\textcolor{red}{F_{r,t}^{ResidualWater}}\) = Flow of residual water out at a treatment site

\(\textcolor{red}{F_{r,t}^{TreatedWater}}\) = Flow of treated water out at a treatment site

\(\textcolor{red}{F_{p,t}^{CompletionsReuseDestination}}\) = Water delivered to completions pad for reuse

\(\textcolor{red}{F_{k,t}^{DisposalDestination}}\) = Water injected at disposal site

\(\textcolor{red}{F_{o,t}^{BeneficialReuseDestination}}\) = Water delivered to beneficial reuse

\(\textcolor{red}{F_{p,t}^{CompletionsDestination}}\) = All water delivered to completions pad

\(\textcolor{red}{F_{p,t}^{BeneficialReuseDestination}}\) = Water delivered to beneficial reuse site

\(\textcolor{red}{L_{s,t}^{Storage}}\) = Water level at storage site at the end of time period t

\(\textcolor{red}{L_{p,t}^{PadStorage}}\) = Water level in completions pad storage at the end of time period t

\(\textcolor{red}{F^{TotalTrucked}}\) = Total volume of water trucked

\(\textcolor{red}{F^{TotalSourced}}\) = Total volume of freshwater sourced

\(\textcolor{red}{F^{TotalDisposed}}\) = Total volume of produced water disposed

\(\textcolor{red}{F^{TotalCompletionsReuse}}\) = Total volume of produced water reused

\(\textcolor{red}{C_{l,\tilde{l},t}^{Piped}}\) = Cost of piping produced water from one location to another location

\(\textcolor{red}{C_{l,\tilde{l},t}^{Trucked}}\) = Cost of trucking produced water from one location to another location

\(\textcolor{red}{C_{f,p,t}^{Sourced}}\) = Cost of sourcing fresh water from source to completions pad

\(\textcolor{red}{C_{k,t}^{Disposal}}\) = Cost of injecting produced water at disposal site

\(\textcolor{red}{C_{r,t}^{Treatment}}\) = Cost of treating produced water at treatment site

\(\textcolor{red}{C_{p,t}^{CompletionsReuse}}\) = Cost of reusing produced water at completions site

\(\textcolor{red}{C_{s,t}^{Storage}}\) = Cost of storing produced water at storage site (incl. treatment)

\(\textcolor{red}{R_{s,t}^{Storage}}\) = Credit for retrieving stored produced water from storage site

\(\textcolor{red}{C^{TotalSourced}}\) = Total cost of sourcing freshwater

\(\textcolor{red}{C^{TotalDisposal}}\) = Total cost of injecting produced water

\(\textcolor{red}{C^{TotalTreatment}}\) = Total cost of treating produced water

\(\textcolor{red}{C^{TotalCompletionsReuse}}\) = Total cost of reusing produced water

\(\textcolor{red}{C^{TotalPiping}}\) = Total cost of piping produced water

\(\textcolor{red}{C^{TotalStorage}}\) = Total cost of storing produced water

\(\textcolor{red}{C^{TotalTrucking}}\) = Total cost of trucking produced water

\(\textcolor{red}{C^{Slack}}\) = Total cost of slack variables

\(\textcolor{red}{R^{TotalStorage}}\) = Total credit for withdrawing produced water

\(\textcolor{red}{D_{k,[t]}^{Capacity}}\) = Disposal capacity in a given time period at disposal site

\(\textcolor{red}{X_{s,[t]}^{Capacity}}\) = Storage capacity in a given time period at storage site

\(\textcolor{red}{T_{r,[t]}^{Capacity}}\) = Treatment capacity in a given time period at treatment site

\(\textcolor{red}{F_{l,\tilde{l},[t]}^{Capacity}}\) = Flow capacity in a given time period between two locations

\(\textcolor{red}{C_{[t]}^{DisposalCapEx}}\) = Capital cost of constructing or expanding disposal capacity

\(\textcolor{red}{C_{[t]}^{PipelineCapEx}}\) = Capital cost of constructing or expanding piping capacity

\(\textcolor{red}{C_{[t]}^{StorageCapEx}}\) = Capital cost of constructing or expanding storage capacity

\(\textcolor{red}{C_{[t]}^{TreatmentCapEx}}\) = Capital cost of constructing or expanding treatment capacity

\(\textcolor{red}{S_{p,t}^{FracDemand}}\) = Slack variable to meet the completions water demand

\(\textcolor{red}{S_{p,t}^{Production}}\) = Slack variable to process produced water production

\(\textcolor{red}{S_{p,t}^{Flowback}}\) = Slack variable to process flowback water production

\(\textcolor{red}{S_{l,\tilde{l}}^{Pipeline Capacity}}\) = Slack variable to provide necessary pipeline capacity

\(\textcolor{red}{S_{s}^{StorageCapacity}}\) = Slack variable to provide necessary storage capacity

\(\textcolor{red}{S_{k}^{DisposalCapacity}}\) = Slack variable to provide necessary disposal capacity

\(\textcolor{red}{S_{r}^{TreamentCapacity}}\) = Slack variable to provide necessary treatment capacity

\(\textcolor{red}{S_{o}^{BeneficialResueCapacity}}\) = Slack variable to provide necessary beneficial reuse capacity

Binary Variables

\(\textcolor{red}{y_{l,\tilde{l},d,[t]}^{Pipeline}}\) = New pipeline installed between one location and another location with specific diameter

\(\textcolor{red}{y_{s,c,[t]}^{Storage}}\) = New or additional storage facility installed at storage site with specific storage capacity

\(\textcolor{red}{y_{r,b,j,[t]}^{Treatment}}\) = New or additional treatment capacity installed at treatment site with specific treatment capacity and treatment technology

\(\textcolor{red}{y_{k,i,[t]}^{Disposal}}\) = New or additional disposal facility installed at disposal site with specific injection capacity

\(\textcolor{red}{y_{l,\tilde{l},t}^{Flow}}\) = Directional flow between two locations

Parameters

\(\textcolor{green}{\gamma_{p,t}^{Completions}}\) = Completions demand at a completions site in a time period

\(\textcolor{green}{\gamma^{TotalDemand}}\) = Total water demand over the planning horizon

\(\textcolor{green}{\beta_{p,t}^{Production}}\) = Produced water supply forecast for a production pad

\(\textcolor{green}{\beta_{p,t}^{Flowback}}\) = Flowback supply forecast for a completions pad

\(\textcolor{green}{\beta^{TotalProd}}\) = Total water production (production & flowback) over the planning horizon

\(\textcolor{green}{\sigma_{l,\tilde{l}}^{Pipeline}}\) = Initial pipeline capacity between two locations

\(\textcolor{green}{\sigma_{k}^{Disposal}}\) = Initial disposal capacity at disposal site

\(\textcolor{green}{\sigma_{s}^{Storage}}\) = Initial storage capacity at storage site

\(\textcolor{green}{\sigma_{p,t}^{PadStorage}}\) = Storage capacity at completions site

\(\textcolor{green}{\sigma_{r,b}^{Treatment}}\) = Initial treatment capacity at treatment site

\(\textcolor{green}{\sigma_{o}^{BeneficialReuse}}\) = Initial reuse capacity at reuse site

\(\textcolor{green}{\sigma_{f,t}^{Freshwater}}\) = Freshwater sourcing capacity at freshwater source

\(\textcolor{green}{\sigma_{p}^{Offloading,Pad}}\) = Truck offloading sourcing capacity per pad

\(\textcolor{green}{\sigma_{s}^{Offloading,Storage}}\) = Truck offloading sourcing capacity per storage site

\(\textcolor{green}{\sigma_{p}^{Processing,Pad}}\) = Processing (e.g. clarification) capacity per pad

\(\textcolor{green}{\sigma_{s}^{Processing,Storage}}\) = Processing (e.g. clarification) capacity at storage site

\(\textcolor{green}{\sigma_{n}^{Node}}\) = Capacity per network node

\(\textcolor{green}{W_{r}^{TreatmentComponent}}\) = Water quality component treated for at treatment site

\(\textcolor{green}{\epsilon_{r, b}^{Treatment}}\) = Treatment efficiency for technology \(\textcolor{blue}{b}\) at treatment site

\(\textcolor{green}{\epsilon_{k,t}^{DisposalOperatingCapacity}}\) = Operating capacity of disposal site [%]

\(\textcolor{green}{\alpha^{AnnualizationRate}}\) = Annualization Rate [%]

\(\textcolor{green}{\chi_{p}^{OutsideCompletionsPad}}\) = Binary parameter designating the completion pads that are outside the system

\(\textcolor{green}{\chi_{b}^{DesalinationTechnology}}\) = Binary parameter designating which treatment technologies are for desalination (1) and which are not (0)

\(\textcolor{green}{\chi_{r}^{DesalinationSites}}\) = Binary parameter designating which treatment sites are for desalination (1) and which are not (0)

\(\textcolor{green}{\chi_{k}^{DisposalExpansionAllowed}}\) = Binary parameter indicating if expansion is allowed at site \(k\)

\(\textcolor{green}{\omega^{EvaporationRate}}\) = Evaporation rate per week

\(\textcolor{green}{\delta_{i}^{Disposal}}\) = Increments for installation/expansion of disposal capacity

\(\textcolor{green}{\delta_{c}^{Storage}}\) = Increments for installation/expansion of storage capacity

\(\textcolor{green}{\delta_{b, j}^{Treatment}}\) = Increments for installation/expansion of treatment capacity

\(\textcolor{green}{\delta^{Truck}}\) = Truck capacity

\(\textcolor{green}{\tau_{k}^{Disposal}}\) = Disposal construction or expansion lead time

\(\textcolor{green}{\tau_{s}^{Storage}}\) = Storage construction or expansion lead time

\(\textcolor{green}{\tau_{l,\tilde{l}}^{Pipeline}}\) = Pipeline construction or expansion lead time

\(\textcolor{green}{\tau_{l,\tilde{l}}^{Trucking}}\) = Drive time between two locations

\(\textcolor{green}{\lambda_{s}^{Storage}}\) = Initial storage level at storage site

\(\textcolor{green}{\lambda_{p}^{PadStorage}}\) = Initial storage level at completions site

\(\textcolor{green}{\theta_{s}^{Storage}}\) = Terminal storage level at storage site

\(\textcolor{green}{\theta_{p}^{PadStorage}}\) = Terminal storage level at completions site

\(\textcolor{green}{\kappa_{k,i}^{Disposal}}\) = Disposal construction or expansion capital cost for selected capacity increment

\(\textcolor{green}{\kappa_{s,c}^{Storage}}\) = Storage construction or expansion capital cost for selected capacity increment

\(\textcolor{green}{\kappa_{r,b,j}^{Treatment}}\) = Treatment construction or expansion capital cost for selected capacity increment

The cost parameter for expanding or constructing new pipeline capacity is structured differently depending on model configuration settings. If the pipeline cost configuration is distance based:

\(\textcolor{green}{\kappa^{Pipeline}}\) = Pipeline construction or expansion capital cost [currency/(diameter-distance)]

\(\textcolor{green}{\mu_{d}^{Pipeline}}\) = Pipeline diameter installation or expansion increments [diameter]

\(\textcolor{green}{\lambda_{l,\tilde{l}}^{Pipeline}}\) = Pipeline segment length [distance]

Otherwise, if the pipeline cost configuration is capacity based:

\(\textcolor{green}{\kappa_{l,\tilde{l},d}^{Pipeline}}\) = Pipeline construction or expansion capital cost for selected diameter capacity [currency/(volume/time)]

\(\textcolor{green}{\delta_{d}^{Pipeline}}\) = Increments for installation/expansion of pipeline capacity [volume/time]

\(\textcolor{green}{\pi_{k}^{Disposal}}\) = Disposal operational cost

\(\textcolor{green}{\pi_{r, b}^{Treatment}}\) = Treatment operational cost

\(\textcolor{green}{\pi_{p}^{CompletionReuse}}\) = Completions reuse operational cost

\(\textcolor{green}{\pi_{s}^{Storage}}\) = Storage deposit operational cost

\(\textcolor{green}{\rho_{s}^{Storage}}\) = Storage withdrawal operational credit

\(\textcolor{green}{\pi_{l,\tilde{l}}^{Pipeline}}\) = Pipeline operational cost

\(\textcolor{green}{\pi_{l}^{Trucking}}\) = Trucking hourly cost (by source)

\(\textcolor{green}{\pi_{f}^{Sourcing}}\) = Fresh sourcing cost

\(\textcolor{green}{M^{Flow}}\) = Big-M flow parameter

\(\textcolor{green}{\psi^{FracDemand}}\) = Slack cost parameter

\(\textcolor{green}{\psi^{Production}}\) = Slack cost parameter

\(\textcolor{green}{\psi^{Flowback}}\) = Slack cost parameter

\(\textcolor{green}{\psi^{PipelineCapacity}}\) = Slack cost parameter

\(\textcolor{green}{\psi^{StorageCapacity}}\) = Slack cost parameter

\(\textcolor{green}{\psi^{DisposalCapacity}}\) = Slack cost parameter

\(\textcolor{green}{\psi^{TreamentCapacity}}\) = Slack cost parameter

\(\textcolor{green}{\psi^{BeneficialReuseCapacity}}\) = Slack cost parameter

Strategic Model Mathematical Program Formulation

Objectives

Two objective functions can be considered for the optimization of a produced water system: first, the minimization of costs, which includes operational costs associated with procurement of fresh water, the cost of disposal, trucking and piping produced water between well pads and treatment facilities, and the cost of storing, treating and reusing produced water. Capital costs are also considered due to infrastructure build out such as the installation of pipelines, treatment, and storage facilities. A credit for (re)using treated water is also considered, and additional slack variables are included to facilitate the identification of potential issues with input data. The second objective is the maximization of water reused which is defined as the ratio between the treated produced water that is used in completions operations and the total produced water coming to surface.

\[ \begin{align}\begin{aligned}\min \ \textcolor{red}{C^{TotalSourced}}+\textcolor{red}{C^{TotalDisposal}}+\textcolor{red}{C^{TotalTreatment}}\\ + \textcolor{red}{C^{TotalCompletionsReuse}}+\textcolor{red}{C^{TotalPiping}}+\textcolor{red}{C^{TotalStorage}}\\ + \textcolor{red}{C^{TotalTrucking}}+\textcolor{green}{\alpha^{AnnualizationRate}} \cdot (\textcolor{red}{C^{DisposalCapEx}}\\ + \textcolor{red}{C^{StorageCapEx}}+\textcolor{red}{C^{TreatmentCapEx}}+\textcolor{red}{C^{PipelineCapEx}})\\ + \textcolor{red}{C^{Slack}}-\textcolor{red}{R^{TotalStorage}}\end{aligned}\end{align} \]
\[\max \ \textcolor{red}{F^{TotalCompletionsReuse}}/\textcolor{green}{\beta^{TotalProd}}\]

Annualization Rate Calculation:

The annualization rate is calculated using the formula described at this website: https://www.investopedia.com/terms/e/eac.asp. The annualization rate takes the discount rate (rate) and the number of years the CAPEX investment is expected to be used (life) as input.

\[\textcolor{green}{\alpha^{AnnualizationRate}} = \frac{\textcolor{green}{rate}}{(1-{(1+\textcolor{green}{rate})}^{-\textcolor{green}{life}})}\]

Completions Pad Demand Balance: \(\forall \textcolor{blue}{p \in CP}, \textcolor{blue}{t \in T}\)

If the completions pad lies outside the system, the demand is optional. Otherwise, if the completions pad is within the system, completions demand must be met. Demand can be met by trucked or piped water moved into the pad in addition to water in completions pad storage.

If \(\textcolor{green}{\chi_{p}^{OutsideCompletionsPad}} = 1\):

\[ \begin{align}\begin{aligned}\textcolor{green}{\gamma_{p,t}^{Completions}} \geq \sum_{n \in N | (n, p) \in NCA}\textcolor{red}{F_{n,p,t}^{Piped}} + \sum_{\tilde{p} \in PP | (\tilde{p}, p) \in PCA}\textcolor{red}{F_{\tilde{p},p,t}^{Piped}} + \sum_{s \in S | (s, p) \in SCA}\textcolor{red}{F_{s,p,t}^{Piped}}\\ + \sum_{\tilde{p} \in CP | (\tilde{p}, p) \in CCA}\textcolor{red}{F_{\tilde{p},p,t}^{Piped}} + \sum_{r \in R | (r, p) \in RCA}\textcolor{red}{F_{r,p,t}^{Piped}} + \sum_{f \in F | (f, p) \in FCA}\textcolor{red}{F_{f,p,t}^{Sourced}}\\ + \sum_{\tilde{p} \in PP | (\tilde{p}, p) \in PCT}\textcolor{red}{F_{\tilde{p},p,t}^{Trucked}} + \sum_{\tilde{p} \in CP | (\tilde{p}, p) \in CCT}\textcolor{red}{F_{\tilde{p},p,t}^{Trucked}} + \sum_{s \in S | (s, p) \in SCT}\textcolor{red}{F_{s,p,t}^{Trucked}}\\ + \sum_{f \in F | (f, p) \in FCT}\textcolor{red}{F_{f,p,t}^{Trucked}} + \textcolor{red}{F_{p,t}^{PadStorageOut}} - \textcolor{red}{F_{p,t}^{PadStorageIn}} + \textcolor{red}{S_{p,t}^{FracDemand}}\end{aligned}\end{align} \]

Else if \(\textcolor{green}{\chi_{p}^{OutsideCompletionsPad}} = 0\):

\[ \begin{align}\begin{aligned}\textcolor{green}{\gamma_{p,t}^{Completions}} = \sum_{n \in N | (n, p) \in NCA}\textcolor{red}{F_{n,p,t}^{Piped}} + \sum_{\tilde{p} \in PP | (\tilde{p}, p) \in PCA}\textcolor{red}{F_{\tilde{p},p,t}^{Piped}} + \sum_{s \in S | (s, p) \in SCA}\textcolor{red}{F_{s,p,t}^{Piped}}\\ + \sum_{\tilde{p} \in CP | (\tilde{p}, p) \in CCA}\textcolor{red}{F_{\tilde{p},p,t}^{Piped}} + \sum_{r \in R | (r, p) \in RCA}\textcolor{red}{F_{r,p,t}^{Piped}} + \sum_{f \in F | (f, p) \in FCA}\textcolor{red}{F_{f,p,t}^{Sourced}}\\ + \sum_{\tilde{p} \in PP | (\tilde{p}, p) \in PCT}\textcolor{red}{F_{\tilde{p},p,t}^{Trucked}} + \sum_{\tilde{p} \in CP | (\tilde{p}, p) \in CCT}\textcolor{red}{F_{\tilde{p},p,t}^{Trucked}} + \sum_{s \in S | (s, p) \in SCT}\textcolor{red}{F_{s,p,t}^{Trucked}}\\ + \sum_{f \in F | (f, p) \in FCT}\textcolor{red}{F_{f,p,t}^{Trucked}} + \textcolor{red}{F_{p,t}^{PadStorageOut}} - \textcolor{red}{F_{p,t}^{PadStorageIn}} + \textcolor{red}{S_{p,t}^{FracDemand}}\end{aligned}\end{align} \]

Completions Pad Storage Balance: \(\forall \textcolor{blue}{p \in CP}, \textcolor{blue}{t \in T}\)

Sets the storage level at the completions pad. For each completions pad and for each time period, completions pad storage is equal to storage in last time period plus water put in minus water removed. If it is the first time period, the pad storage is the initial pad storage.

For \(t = 1\):

\[\textcolor{red}{L_{p,t}^{PadStorage}} = \textcolor{green}{\lambda_{p,t=1}^{PadStorage}} + \textcolor{red}{F_{p,t}^{PadStorageIn}} - \textcolor{red}{F_{p,t}^{PadStorageOut}}\]

For \(t > 1\):

\[\textcolor{red}{L_{p,t}^{PadStorage}} = \textcolor{red}{L_{p,t-1}^{PadStorage}} + \textcolor{red}{F_{p,t}^{PadStorageIn}} - \textcolor{red}{F_{p,t}^{PadStorageOut}}\]

Completions Pad Storage Capacity: \(\forall \textcolor{blue}{p \in CP}, \textcolor{blue}{t \in T}\)

The storage at each completions pad must always be at or below its capacity in every time period.

\[\textcolor{red}{L_{p,t}^{PadStorage}} \leq \textcolor{green}{\sigma_{p}^{PadStorage}}\]

Terminal Completions Pad Storage Level: \(\forall \textcolor{blue}{p \in CP}\)

The storage in the last period must be at or below its terminal storage level.

\[\textcolor{red}{L_{p,t=T}^{PadStorage}} \leq \textcolor{green}{\theta_{p}^{PadStorage}}\]

The storage in the last period must be at or below its terminal storage level.

Freshwater Sourcing Capacity: \(\forall \textcolor{blue}{f \in F}, \textcolor{blue}{t \in T}\)

For each freshwater source and each time period, the outgoing water from the freshwater source is below the freshwater capacity.

\[\sum_{p \in P | (f, p) \in FCA}\textcolor{red}{F_{f,p,t}^{Sourced}} + \sum_{p \in P | (f, p) \in FCT}\textcolor{red}{F_{f,p,t}^{Trucked}} \leq \textcolor{green}{\sigma_{f,t}^{Freshwater}}\]

Completions Pad Truck Offloading Capacity: \(\forall \textcolor{blue}{p \in CP}, \textcolor{blue}{t \in T}\)

For each completions pad and time period, the volume of water being trucked into the completions pad must be below the trucking offloading capacity.

\[ \begin{align}\begin{aligned}\sum_{\tilde{p} \in P | (\tilde{p}, p) \in PCT}\textcolor{red}{F_{\tilde{p},p,t}^{Trucked}} + \sum_{s \in S | (s, p) \in SCT}\textcolor{red}{F_{s,p,t}^{Trucked}} + \sum_{f \in F | (f, p) \in FCT}\textcolor{red}{F_{f,p,t}^{Trucked}}\\ + \sum_{\tilde{p} \in P | (\tilde{p}, p) \in CCT}\textcolor{red}{F_{\tilde{p},p,t}^{Trucked}} \leq \textcolor{green}{\sigma_{p}^{Offloading,Pad}}\end{aligned}\end{align} \]

Completions Pad Processing Capacity: \(\forall \textcolor{blue}{p \in CP}, \textcolor{blue}{t \in T}\)

For each completions pad and time period, the volume of water (excluding freshwater) coming in must be below the processing limit.

\[ \begin{align}\begin{aligned}\sum_{n \in N | (n, p) \in NCA}\textcolor{red}{F_{n,p,t}^{Piped}} + \sum_{\tilde{p} \in P | (\tilde{p}, p) \in PCA}\textcolor{red}{F_{\tilde{p},p,t}^{Piped}} + \sum_{s \in S | (s, p) \in SCA}\textcolor{red}{F_{s,p,t}^{Piped}}\\ + \sum_{\tilde{p} \in P | (\tilde{p}, p) \in CCA}\textcolor{red}{F_{\tilde{p},p,t}^{Piped}} + \sum_{r \in R | (r, p) \in RCA}\textcolor{red}{F_{r,p,t}^{Piped}} + \sum_{\tilde{p} \in P | (\tilde{p}, p) \in PCT}\textcolor{red}{F_{\tilde{p},p,t}^{Trucked}}\\ + \sum_{s \in S | (s, p) \in SCT}\textcolor{red}{F_{s,p,t}^{Trucked}} + \sum_{\tilde{p} \in P | (\tilde{p}, p) \in CCT}\textcolor{red}{F_{\tilde{p},p,t}^{Trucked}} \leq \textcolor{green}{\sigma_{p}^{Processing,Pad}}\end{aligned}\end{align} \]

Note

This constraint has not actually been implemented yet.

Storage Site Truck Offloading Capacity: \(\forall \textcolor{blue}{s \in S}, \textcolor{blue}{t \in T}\)

For each storage site and each time period, the volume of water being trucked into the storage site must be below the trucking offloading capacity for that storage site.

\[\sum_{p \in P | (p, s) \in PST}\textcolor{red}{F_{p,s,t}^{Trucked}} + \sum_{p \in P | (p, s) \in CST}\textcolor{red}{F_{p,s,t}^{Trucked}} \leq \textcolor{green}{\sigma_{s}^{Offloading,Storage}}\]

Storage Site Processing Capacity: \(\forall \textcolor{blue}{s \in S}, \textcolor{blue}{t \in T}\)

For each storage site and each time period, the volume of water being piped and trucked into the storage site must be less than the processing capacity for that storage site.

\[ \begin{align}\begin{aligned}\sum_{n \in N | (n, s) \in NSA}\textcolor{red}{F_{n,s,t}^{Piped}} + \sum_{r \in R | (r, s) \in RSA}\textcolor{red}{F_{r,s,t}^{Piped}} + \sum_{p \in P | (p, s) \in PST}\textcolor{red}{F_{p,s,t}^{Trucked}}\\ + \sum_{p \in P | (p, s) \in CST}\textcolor{red}{F_{p,s,t}^{Trucked}} \leq \textcolor{green}{\sigma_{s}^{Processing,Storage}}\end{aligned}\end{align} \]

Production Pad Supply Balance: \(\forall \textcolor{blue}{p \in PP}, \textcolor{blue}{t \in T}\)

All produced water must be accounted for. For each production pad and for each time period, the volume of outgoing water must be equal to the forecasted produced water for the production pad.

\[ \begin{align}\begin{aligned}\textcolor{green}{\beta_{p,t}^{Production}} = \sum_{n \in N | (p, n) \in PNA}\textcolor{red}{F_{p,n,t}^{Piped}} + \sum_{\tilde{p} \in P | (p, \tilde{p}) \in PCA}\textcolor{red}{F_{p,\tilde{p},t}^{Piped}} + \sum_{\tilde{p} \in P | (p, \tilde{p}) \in PPA}\textcolor{red}{F_{p,\tilde{p},t}^{Piped}}\\ + \sum_{\tilde{p} \in P | (p, \tilde{p}) \in PCT}\textcolor{red}{F_{p,\tilde{p},t}^{Trucked}} + \sum_{k \in K | (p,k) \in PKT}\textcolor{red}{F_{p,k,t}^{Trucked}} + \sum_{s \in S | (p,s) \in PST}\textcolor{red}{F_{p,s,t}^{Trucked}}\\ + \sum_{r \in R | (p,r) \in PRT}\textcolor{red}{F_{p,r,t}^{Trucked}} + \sum_{o \in O | (p,o) \in POT}\textcolor{red}{F_{p,o,t}^{Trucked}} + \textcolor{red}{S_{p,t}^{Production}}\end{aligned}\end{align} \]

Completions Pad Supply Balance (i.e. Flowback Balance): \(\forall \textcolor{blue}{p \in CP}, \textcolor{blue}{t \in T}\)

All flowback water must be accounted for. For each completions pad and for each time period, the volume of outgoing water must be equal to the forecasted flowback produced water for the completions pad.

\[ \begin{align}\begin{aligned}\textcolor{green}{\beta_{p,t}^{Flowback}} = \sum_{n \in N | (p, n) \in CNA}\textcolor{red}{F_{p,n,t}^{Piped}} + \sum_{c \in C | (p, c) \in CCA}\textcolor{red}{F_{p,c,t}^{Piped}} + \sum_{\tilde{p} \in P | (p, \tilde{p}) \in CCT}\textcolor{red}{F_{p,\tilde{p},t}^{Trucked}}\\ + \sum_{k \in K | (p, k) \in CKT}\textcolor{red}{F_{p,k,t}^{Trucked}} + \sum_{s \in S | (p, s) \in CST}\textcolor{red}{F_{p,s,t}^{Trucked}} + \sum_{r \in R | (p, r) \in CRT}\textcolor{red}{F_{p,r,t}^{Trucked}} + \textcolor{red}{S_{p,t}^{Flowback}}\end{aligned}\end{align} \]

Network Node Balance: \(\forall \textcolor{blue}{n \in N}, \textcolor{blue}{t \in T}\)

Flow balance constraint (i.e., inputs are equal to outputs). For each pipeline node and for each time period, the volume water into the node is equal to the volume of water out of the node.

\[ \begin{align}\begin{aligned}\sum_{p \in P | (p, n) \in PNA}\textcolor{red}{F_{p,n,t}^{Piped}} + \sum_{p \in P | (p, n) \in CNA}\textcolor{red}{F_{p,n,t}^{Piped}} + \sum_{\tilde{n} \in N | (\tilde{n}, n) \in NNA}\textcolor{red}{F_{\tilde{n},n,t}^{Piped}}\\ + \sum_{s \in S | (s, n) \in SNA}\textcolor{red}{F_{s,n,t}^{Piped}} + \sum_{r \in R | (r, n) \in RNA}\textcolor{red}{F_{r,n,t}^{Piped}}\\ = \sum_{\tilde{n} \in N | (n, \tilde{n}) \in NNA}\textcolor{red}{F_{n,\tilde{n},t}^{Piped}} + \sum_{p \in P | (n, p) \in NCA}\textcolor{red}{F_{n,p,t}^{Piped}} + \sum_{k \in K | (n, k) \in NKA}\textcolor{red}{F_{n,k,t}^{Piped}}\\ + \sum_{r \in R | (n, r) \in NRA}\textcolor{red}{F_{n,r,t}^{Piped}} + \sum_{s \in S | (n, s) \in NSA}\textcolor{red}{F_{n,s,t}^{Piped}} + \sum_{o \in O | (n, o) \in NOA}\textcolor{red}{F_{n,o,t}^{Piped}}\end{aligned}\end{align} \]

Bi-Directional Flow: \(\forall \textcolor{blue}{(l, \tilde{l}) \in \{PCA,PNA,PPA,CNA,NNA,NCA,NKA,NSA,NRA, \ldots ,SOA\}}, \textcolor{blue}{t \in T}\)

There can only be flow in one direction for a given pipeline arc in a given time period. Flow is only allowed in a given direction if the binary indicator for that direction is “on”.

\[\textcolor{red}{y_{l,\tilde{l},t}^{Flow}}+\textcolor{red}{y_{\tilde{l},l,t}^{Flow}} = 1\]

Note

Technically this constraint should only be enforced for truly reversible arcs (e.g. NCA and CNA); and even then it only needs to be defined per one reversible arc (e.g. NCA only and not NCA and CNA).

\[\textcolor{red}{F_{l,\tilde{l},t}^{Piped}} \leq \textcolor{red}{y_{l,\tilde{l},t}^{Flow}} \cdot \textcolor{green}{M^{Flow}}\]

Storage Site Balance: \(\forall \textcolor{blue}{s \in S}, \textcolor{blue}{t \in T}\)

For each storage site and for each time period, if it is the first time period, the storage level is determined by the initial storage and storage inputs and outputs. Otherwise, the storage level is determined by the storage level in the previous time period and storage inputs and outputs. Water outputs include other system nodes (i.e., pipeline nodes and completions pads) and an evaporation stream.

For \(t = 1\):

\[ \begin{align}\begin{aligned}\textcolor{red}{L_{s,t}^{Storage}} = \textcolor{green}{\lambda_{s,t=1}^{Storage}} + \sum_{n \in N | (n, s) \in NSA}\textcolor{red}{F_{n,s,t}^{Piped}} + \sum_{r \in R | (r, s) \in RSA}\textcolor{red}{F_{r,s,t}^{Piped}} + \sum_{p \in P | (p, s) \in PST}\textcolor{red}{F_{p,s,t}^{Trucked}}\\ + \sum_{p \in P | (p, s) \in CST}\textcolor{red}{F_{p,s,t}^{Trucked}} - \sum_{n \in N | (s, n) \in SNA}\textcolor{red}{F_{s,n,t}^{Piped}} - \sum_{p \in P | (s, p) \in SCA}\textcolor{red}{F_{s,p,t}^{Piped}} - \sum_{k \in K | (s, k) \in SKA}\textcolor{red}{F_{s,k,t}^{Piped}}\\ - \sum_{r \in R | (s, r) \in SRA}\textcolor{red}{F_{s,r,t}^{Piped}} - \sum_{o \in O | (s, o) \in SOA}\textcolor{red}{F_{s,o,t}^{Piped}} - \sum_{p \in P | (s, p) \in SCT}\textcolor{red}{F_{s,p,t}^{Trucked}} - \sum_{k \in K | (s, k) \in SKT}\textcolor{red}{F_{s,k,t}^{Trucked}} - \textcolor{red}{F_{s,t}^{StorageEvaporationStream}}\end{aligned}\end{align} \]

For \(t > 1\):

\[ \begin{align}\begin{aligned}\textcolor{red}{L_{s,t}^{Storage}} = \textcolor{red}{L_{s,t-1}^{Storage}} + \sum_{n \in N | (n, s) \in NSA}\textcolor{red}{F_{n,s,t}^{Piped}} + \sum_{r \in R | (r, s) \in RSA}\textcolor{red}{F_{r,s,t}^{Piped}} + \sum_{p \in P | (p, s) \in PST}\textcolor{red}{F_{p,s,t}^{Trucked}}\\ + \sum_{p \in P | (p, s) \in CST}\textcolor{red}{F_{p,s,t}^{Trucked}} - \sum_{n \in N | (s, n) \in SNA}\textcolor{red}{F_{s,n,t}^{Piped}} - \sum_{p \in P | (s, p) \in SCA}\textcolor{red}{F_{s,p,t}^{Piped}} - \sum_{k \in K | (s, k) \in SKA}\textcolor{red}{F_{s,k,t}^{Piped}}\\ - \sum_{r \in R | (s, r) \in SRA}\textcolor{red}{F_{s,r,t}^{Piped}} - \sum_{o \in O | (s, o) \in SOA}\textcolor{red}{F_{s,o,t}^{Piped}} - \sum_{p \in P | (s, p) \in SCT}\textcolor{red}{F_{s,p,t}^{Trucked}} - \sum_{k \in K | (s, k) \in SKT}\textcolor{red}{F_{s,k,t}^{Trucked}} - \textcolor{red}{F_{s,t}^{StorageEvaporationStream}}\end{aligned}\end{align} \]

Terminal Storage Level: \(\forall \textcolor{blue}{s \in S}, \textcolor{blue}{t \in T}\)

For each storage site, the storage in the last time period must be less than or equal to the predicted/set terminal storage level.

\[\textcolor{red}{L_{s,t=T}^{Storage}} \leq \textcolor{green}{\theta_{s}^{Storage}}\]

Network Node Capacity: \(\forall \textcolor{blue}{n \in N}, \textcolor{blue}{t \in T}\)

Flow capacity constraint. For each pipeline node and for each time period, the volume should not exceed the node capacity.

\[ \begin{align}\begin{aligned}\sum_{p \in P | (p, n) \in PNA}\textcolor{red}{F_{p,n,t}^{Piped}} + \sum_{p \in P | (p, n) \in CNA}\textcolor{red}{F_{p,n,t}^{Piped}} + \sum_{\tilde{n} \in N | (\tilde{n}, n) \in NNA}\textcolor{red}{F_{\tilde{n},n,t}^{Piped}}\\ + \sum_{s \in S | (s, n) \in SNA}\textcolor{red}{F_{s,n,t}^{Piped}} + \sum_{r \in R | (r, n) \in RNA}\textcolor{red}{F_{r,n,t}^{Piped}} \leq \textcolor{green}{\sigma_{n}^{Node}}\end{aligned}\end{align} \]

Pipeline Capacity Construction/Expansion: \(\forall \textcolor{blue}{(l,\tilde{l}) \in \{PCA,PNA,PPA,NKA,CNA,NCA,NSA,NOA,FCA,RCA,SKA,SOA,RSA,SRA\}}, [\textcolor{blue}{t \in T}]\)

Sets the flow capacity in a given pipeline during a given time period. Different constraints apply depending on if the pipeline is reversible or not. The set \(\textcolor{blue}{D}\) should also include the 0th case (e.g. 0 bbl/day) that indicates the choice to not expand capacity.

\[\textcolor{red}{F_{l,\tilde{l},[t]}^{Capacity}} = \textcolor{green}{\sigma_{l,\tilde{l}}^{Pipeline}}+\sum_{d \in D}\textcolor{green}{\delta_{d}^{Pipeline}} \cdot \textcolor{red}{y_{l,\tilde{l},d}^{Pipeline}}+\textcolor{red}{S_{l,\tilde{l}}^{PipelineCapacity}}\]

\(\forall \textcolor{blue}{(l,\tilde{l}) \in \{PPA,CNA,NNA,NCA,NSA,NRA,RNA,RKA,SNA,SCA\}},[\textcolor{blue}{t \in T}]\)

\[\textcolor{red}{F_{l,\tilde{l},[t]}^{Capacity}} = \textcolor{green}{\sigma_{l,\tilde{l}}^{Pipeline}}+\sum_{d \in D}\textcolor{green}{\delta_{d}^{Pipeline}} \cdot (\textcolor{red}{y_{l,\tilde{l},d}^{Pipeline}}+\textcolor{red}{y_{\tilde{l},l,d}^{Pipeline}} )+\textcolor{red}{S_{l,\tilde{l}}^{PipelineCapacity}}\]

Note

\(\textcolor{green}{\delta_{d}^{Pipeline}}\) can be input by user or calculated. If the user chooses to calculate pipeline capacity, the parameter will be calculated by the equation below where \({\textcolor{green}{\kappa_{l,\tilde{l}}}}\) is Hazen-Williams constant and \(\omega\) is Hazen-Williams exponent as per Cafaro & Grossmann (2021) and d represents the pipeline diameter as per the set \(\textcolor{blue}{d \in D}\).

See equation:

\[\textcolor{green}{\delta_{d}^{Pipeline}} = {\textcolor{green}{\kappa_{l,\tilde{l}}}} \cdot \textcolor{blue}{d}^{\omega}\]

\(\forall \textcolor{blue}{(l,\tilde{l})} \in \textcolor{blue}{\{PCA,PNA,PPA,CNA,RCA NNA,NCA,NKA,NSA,NRA, \ldots, SOA\}}, \textcolor{blue}{t \in T}\)

\[\textcolor{red}{F_{l,\tilde{l},t}^{Piped}} \leq \textcolor{red}{F_{l,\tilde{l},[t]}^{Capacity}}\]

Storage Capacity Construction/Expansion: \(\forall \textcolor{blue}{s \in S}, [\textcolor{blue}{t \in T}]\)

This constraint accounts for the expansion of available storage capacity or installation of storage facilities. If expansion/construction is selected, expand the capacity by the set expansion amount. The water level at the storage site must be less than this capacity. As of now, the model considers that a storage facility is expanded or built at the beginning of the planning horizon. The set \(\textcolor{blue}{C}\) should also include the 0th case (0 bbl) that indicates the choice to not expand capacity.

\[\textcolor{red}{X_{s,[t]}^{Capacity}} = \textcolor{green}{\sigma_{s}^{Storage}}+\sum_{c \in C}\textcolor{green}{\delta_{c}^{Storage}} \cdot \textcolor{red}{y_{s,c}^{Storage}}+\textcolor{red}{S_{s}^{StorageCapacity}}\]

\(\forall \textcolor{blue}{s \in S}, \textcolor{blue}{t \in T}\)

\[\textcolor{red}{L_{s,t}^{Storage}} \leq \textcolor{red}{X_{s,[t]}^{Capacity}}\]

Disposal Capacity Construction/Expansion: \(\forall \textcolor{blue}{k \in K}, [\textcolor{blue}{t \in T}]\)

This constraint accounts for the expansion of available disposal sites or installation of new disposal sites. If expansion/construction is selected, expand the capacity by the set expansion amount. The total disposed water in a given time period must be less than this new capacity. The set \(\textcolor{blue}{I}\) should also include the 0th case (e.g. 0 bbl/day) that indicates the choice to not expand capacity.

\[\textcolor{red}{D_{k,[t]}^{Capacity}} = \textcolor{green}{\sigma_{k}^{Disposal}}+\sum_{i \in I}\textcolor{green}{\delta_{i}^{Disposal}} \cdot \textcolor{red}{y_{k,i}^{Disposal}}+\textcolor{red}{S_{k}^{DisposalCapacity}}\]

\(\forall \textcolor{blue}{k \in K}, \textcolor{blue}{t \in T}\)

\[ \begin{align}\begin{aligned}\sum_{n \in N | (n, k) \in NKA}\textcolor{red}{F_{n,k,t}^{Piped}} + \sum_{s \in S | (s, k) \in SKA}\textcolor{red}{F_{s,k,t}^{Piped}} + \sum_{r \in R | (r, k) \in RKA}\textcolor{red}{F_{r,k,t}^{Trucked}} + \sum_{s \in S | (s, k) \in SKT}\textcolor{red}{F_{s,k,t}^{Trucked}}\\ + \sum_{p \in P | (p, k) \in PKT}\textcolor{red}{F_{p,k,t}^{Trucked}} + \sum_{p \in P | (p, k) \in CKT}\textcolor{red}{F_{p,k,t}^{Trucked}} + \sum_{r \in R | (r, k) \in RKT}\textcolor{red}{F_{r,k,t}^{Trucked}} \leq \textcolor{red}{D_{k,[t]}^{Capacity}}\end{aligned}\end{align} \]

Treatment Capacity Construction/Expansion: \(\forall \textcolor{blue}{r \in R}\)

Similarly to disposal and storage capacity construction/expansion constraints, the current treatment capacity can be expanded as required or new facilities may be installed. The set \(\textcolor{blue}{J}\) should also include the 0th case (e.g. 0 bbl/day) that indicates the choice to not expand capacity.

\[\sum_{b \in B, j \in J} (\textcolor{green}{\sigma_{r,b}^{Treatment}} \cdot \textcolor{red}{y_{r,b,j}^{Treatment}} + \textcolor{green}{\delta_{b, j}^{Treatment}} \cdot \textcolor{red}{y_{r,b,j}^{Treatment}}) = \textcolor{red}{T_{r}^{Capacity}}\]

\(\forall \textcolor{blue}{r \in R}, \textcolor{blue}{t \in T}\)

\[ \begin{align}\begin{aligned}\sum_{n \in N | (n, r) \in NRA}\textcolor{red}{F_{n,r,t}^{Piped}} + \sum_{s \in S | (s, r) \in SRA}\textcolor{red}{F_{s,r,t}^{Piped}} + \sum_{p \in P | (p, r) \in PRT}\textcolor{red}{F_{p,r,t}^{Trucked}}\\ + \sum_{p \in P | (p, r) \in CRT}\textcolor{red}{F_{p,r,t}^{Trucked}} \leq \textcolor{red}{T_{r,[t]}^{Capacity}}\end{aligned}\end{align} \]

Treatment Balance: \(\forall \textcolor{blue}{r \in R}, \textcolor{blue}{t \in T}\)

At a treatment facility, the inlet raw produced water is treated and separated into treated water and residual water.

\[ \begin{align}\begin{aligned}\sum_{n \in N | (n, r) \in NRA}\textcolor{red}{F_{n,r,t}^{Piped}} + \sum_{s \in S | (s, r) \in SRA}\textcolor{red}{F_{s,r,t}^{Piped}} + \sum_{p \in P | (p, r) \in PRT}\textcolor{red}{F_{p,r,t}^{Trucked}} + \sum_{p \in P | (p, r) \in CRT}\textcolor{red}{F_{p,r,t}^{Trucked}}\\= \textcolor{red}{F_{r,t}^{ResidualWater}} + \textcolor{red}{F_{r,t}^{TreatedWater}}\end{aligned}\end{align} \]

Residual Water: \(\forall \textcolor{blue}{r \in R}, \textcolor{blue}{b \in B}, \textcolor{blue}{t \in T}\)

The efficiency of a treatment technology determines the amount of residual water produced.

\[ \begin{align}\begin{aligned}(\sum_{n \in N | (n, r) \in NRA}\textcolor{red}{F_{n,r,t}^{Piped}} + \sum_{s \in S | (s, r) \in SRA}\textcolor{red}{F_{s,r,t}^{Piped}} + \sum_{p \in P | (p, r) \in PRT}\textcolor{red}{F_{p,r,t}^{Trucked}} + \sum_{p \in P | (p, r) \in CRT}\textcolor{red}{F_{p,r,t}^{Trucked}})\\\cdot (1 - \textcolor{green}{\epsilon_{r, b}^{Treatment}}) - \textcolor{green}{M^{Flow}} \cdot (1 - \sum_{j \in J}\textcolor{red}{y_{r,b,j}^{Treatment}}) \leq \textcolor{red}{F_{r,t}^{ResidualWater}}\end{aligned}\end{align} \]
\[ \begin{align}\begin{aligned}(\sum_{n \in N | (n, r) \in NRA}\textcolor{red}{F_{n,r,t}^{Piped}} + \sum_{s \in S | (s, r) \in SRA}\textcolor{red}{F_{s,r,t}^{Piped}} + \sum_{p \in P | (p, r) \in PRT}\textcolor{red}{F_{p,r,t}^{Trucked}} + \sum_{p \in P | (p, r) \in CRT}\textcolor{red}{F_{p,r,t}^{Trucked}})\\\cdot (1 - \textcolor{green}{\epsilon_{r, b}^{Treatment}}) + \textcolor{green}{M^{Flow}} \cdot (1 - \sum_{j \in J}\textcolor{red}{y_{r,b,j}^{Treatment}}) \geq \textcolor{red}{F_{r,t}^{ResidualWater}}\end{aligned}\end{align} \]

Treated Water: \(\forall \textcolor{blue}{r \in R}, \textcolor{blue}{b \in B}, \textcolor{blue}{t \in T}\)

Treated water is either reused in the completion pads or stored in ponds or removed for beneficial reuse (if desalinated).

\[\textcolor{red}{F_{r,t}^{TreatedWater}} = \sum_{p \in CP | (r, p) \in RCA}\textcolor{red}{F_{r,p,t}^{Piped}} + \sum_{s \in S | (r, s) \in RSA}\textcolor{red}{F_{r,s,t}^{Piped}} + \textcolor{red}{F_{r,t}^{DesalinatedWater}}\]

Beneficial Reuse Capacity: \(\forall \textcolor{blue}{o \in O}, \textcolor{blue}{t \in T}\)

For each beneficial reuse site and for each time period, water sent to a site must be less than or equal to the capacity.

\[ \begin{align}\begin{aligned}\sum_{n \in N | (n, o) \in NOA}\textcolor{red}{F_{n,o,t}^{Piped}} + \sum_{s \in S | (s, o) \in SOA}\textcolor{red}{F_{s,o,t}^{Piped}} + \sum_{p \in P | (p, o) \in POT}\textcolor{red}{F_{p,o,t}^{Trucked}}\\ \leq \textcolor{green}{\sigma_{o}^{BeneficialReuse}} + \textcolor{red}{S_{o}^{BeneficialReuseCapacity}}\end{aligned}\end{align} \]

Fresh Sourcing Cost: \(\forall \textcolor{blue}{f \in F}, \textcolor{blue}{p \in CP}, \textcolor{blue}{t \in T}\)

For each freshwater source, for each completions pad, and for each time period, the freshwater sourcing cost is equal to all output from the freshwater source times the freshwater sourcing cost.

\[\textcolor{red}{C_{f,p,t}^{Sourced}} = (\textcolor{red}{F_{f,p,t}^{Sourced}} + \textcolor{red}{F_{f,p,t}^{Trucked}}) \cdot \textcolor{green}{\pi_{f}^{Sourcing}}\]
\[\textcolor{red}{C^{TotalSourced}} = \sum_{t \in T}\sum_{(f,p) \in FCA}\textcolor{red}{C_{f,p,t}^{Sourced}}\]

Total Fresh Sourced Volume: \(\forall \textcolor{blue}{f \in F}, \textcolor{blue}{p \in CP}, \textcolor{blue}{t \in T}\)

The total fresh sourced volume is the sum of freshwater movements by truck and pipeline over all time periods, completions pads, and freshwater sources.

\[\textcolor{red}{F^{TotalSourced}} = \sum_{t \in T}\sum_{f \in F}\sum_{p \in CP}(\textcolor{red}{F_{f,p,t}^{Sourced}} + \textcolor{red}{F_{f,p,t}^{Trucked}})\]

Disposal Cost: \(\forall \textcolor{blue}{k \in K}, \textcolor{blue}{t \in T}\)

For each disposal site, for each time period, the disposal cost is equal to all water moved into the disposal site multiplied by the operational disposal cost. Total disposal cost is the sum of disposal costs over all time periods and all disposal sites.

\[\textcolor{red}{C_{k,t}^{Disposal}} = (\sum_{l \in L | (l, k) \in \{NKA,RKA,SKA\}}\textcolor{red}{F_{l,k,t}^{Piped}} + \sum_{l \in L | (l, k) \in \{PKT,CKT,SKT,RKT\}}\textcolor{red}{F_{l,k,t}^{Trucked}}) \cdot \textcolor{green}{\pi_{k}^{Disposal}}\]
\[\textcolor{red}{C^{TotalDisposal}} = \sum_{t \in T}\sum_{k \in K}\textcolor{red}{C_{k,t}^{Disposal}}\]

Total Disposed Volume:

Total disposed volume over all time is the sum of all piped and trucked water to disposal summed over all time periods.

\[\textcolor{red}{F^{TotalDisposed}} = \sum_{t \in T}(\sum_{(l,k) \in \{NKA,RKA,SKA\}}\textcolor{red}{F_{l,k,t}^{Piped}} + \sum_{(l,k) \in \{PKT,CKT,SKT,RKT\}}\textcolor{red}{F_{l,k,t}^{Trucked}})\]

Treatment Cost: \(\forall \textcolor{blue}{r \in R}, \textcolor{blue}{t \in T}\)

For each treatment site, for each time period, the treatment cost is equal to all water moved to the treatment site multiplied by the operational treatment cost. The total treatments cost is the sum of treatment costs over all time periods and all treatment sites.

\[ \begin{align}\begin{aligned}\textcolor{red}{C_{r,t}^{Treatment}} \geq (\sum_{n \in N | (n, r) \in NRA}\textcolor{red}{F_{n,r,t}^{Piped}} + \sum_{s \in S | (s, r) \in SRA}\textcolor{red}{F_{s,r,t}^{Piped}} + \sum_{p \in PP | (p, r) \in PRT}\textcolor{red}{F_{p,r,t}^{Trucked}} + \sum_{p \in CP | (p, r) \in CRT}\textcolor{red}{F_{p,r,t}^{Trucked}}\\ - \textcolor{green}{M^{Flow}} \cdot (1 - \sum_{j \in J}\textcolor{red}{y_{r,b,j}^{Treatment}}))\end{aligned}\end{align} \]
\[ \begin{align}\begin{aligned}\textcolor{red}{C_{r,t}^{Treatment}} \leq (\sum_{n \in N | (n, r) \in NRA}\textcolor{red}{F_{n,r,t}^{Piped}} + \sum_{s \in S | (s, r) \in SRA}\textcolor{red}{F_{s,r,t}^{Piped}} + \sum_{p \in PP | (p, r) \in PRT}\textcolor{red}{F_{p,r,t}^{Trucked}} + \sum_{p \in CP | (p, r) \in CRT}\textcolor{red}{F_{p,r,t}^{Trucked}}\\ + \textcolor{green}{M^{Flow}} \cdot (1 - \sum_{j \in J}\textcolor{red}{y_{r,b,j}^{Treatment}}))\end{aligned}\end{align} \]
\[\textcolor{red}{C^{TotalTreatment}} = \sum_{t \in T}\sum_{r \in R}\textcolor{red}{C_{r,t}^{Treatment}}\]

Completions Reuse Cost: \(\forall \textcolor{blue}{p \in P}, \textcolor{blue}{t \in T}\)

Completions reuse water is all water that meets completions pad demand, excluding freshwater. Completions reuse cost is the volume of completions reused water multiplied by the cost for reuse.

\[ \begin{align}\begin{aligned}\textcolor{red}{C_{p,t}^{CompletionsReuse}} = (\sum_{n \in N | (n, p) \in NCA}\textcolor{red}{F_{n,p,t}^{Piped}} + \sum_{\tilde{p} \in P | (\tilde{p}, p) \in PCA}\textcolor{red}{F_{\tilde{p},p,t}^{Piped}} + \sum_{r \in R | (r, p) \in RCA}\textcolor{red}{F_{r,p,t}^{Piped}}\\ + \sum_{s \in S | (s, p) \in SCA}\textcolor{red}{F_{s,p,t}^{Piped}} + \sum_{\tilde{p} \in P | (\tilde{p}, p) \in CCA}\textcolor{red}{F_{\tilde{p},p,t}^{Piped}} + \sum_{\tilde{p} \in P | (\tilde{p}, p) \in CCT}\textcolor{red}{F_{\tilde{p},p,t}^{Trucked}}\\ + \sum_{\tilde{p} \in P | (\tilde{p}, p) \in PCT}\textcolor{red}{F_{\tilde{p},p,t}^{Trucked}} + \sum_{s \in S | (s, p) \in SCT}\textcolor{red}{F_{s,p,t}^{Trucked}}) \cdot \textcolor{green}{\pi_{p}^{CompletionsReuse}}\end{aligned}\end{align} \]

Note

Freshwater sourcing is excluded from completions reuse costs.

\[\textcolor{red}{C^{TotalReuse}} = \sum_{t \in T}\sum_{p \in CP}\textcolor{red}{C_{p,t}^{Reuse}}\]

Total Completions Reuse Volume:

The total reuse volume is the total volume of produced water reused, or the total water meeting completions pad demand over all time periods, excluding freshwater.

\[ \begin{align}\begin{aligned}\textcolor{red}{F^{TotalCompletionsReused}} = \sum_{t \in T}(\sum_{(n,p) \in NCA}\textcolor{red}{F_{n,p,t}^{Piped}} + \sum_{(p, \tilde{p}) \in PCA}\textcolor{red}{F_{p,\tilde{p},t}^{Piped}}\\ + \sum_{(s, p) \in SCA}\textcolor{red}{F_{s,p,t}^{Piped}} + \sum_{(r, p) \in RCA}\textcolor{red}{F_{r,p,t}^{Piped}} + \sum_{(p, \tilde{p}) \in PCT}\textcolor{red}{F_{p,\tilde{p},t}^{Trucked}}\\ + \sum_{(p, \tilde{p}) \in CCA}\textcolor{red}{F_{p,\tilde{p},t}^{Piped}} + \sum_{(p, \tilde{p}) \in CCT}\textcolor{red}{F_{p,\tilde{p},t}^{Trucked}} + \sum_{(s, p) \in SCT}\textcolor{red}{F_{s,p,t}^{Trucked}})\end{aligned}\end{align} \]

Piping Cost: \(\forall \textcolor{blue}{(l,\tilde{l}) \in \{PPA, \ldots, CCA\}}, \textcolor{blue}{t \in T}\)

Piping cost is the total volume of piped water multiplied by the cost for piping.

\[\textcolor{red}{C_{l,\tilde{l},t}^{Piped}} = (\textcolor{red}{F_{l,\tilde{l},t}^{Piped}} + \textcolor{red}{F_{l,\tilde{l},t}^{Sourced})} \cdot \textcolor{green}{\pi_{l,\tilde{l}}^{Pipeline}}\]
\[\textcolor{red}{C^{TotalPiping}} = \sum_{t \in T}\sum_{(l,\tilde{l}) \in \{PPA, \ldots\}}\textcolor{red}{C_{l,\tilde{l},t}^{Piped}}\]

Note

The constraints above explicitly consider freshwater piping via \(\textcolor{blue}{FCA}\) arcs.

Storage Deposit Cost: \(\forall \textcolor{blue}{s \in S}, \textcolor{blue}{t \in T}\)

Cost of depositing into storage is equal to the total volume of water moved into storage multiplied by the storage operation cost rate.

\[ \begin{align}\begin{aligned}\textcolor{red}{C_{s,t}^{Storage}} = (\sum_{n \in N | (n, s) \in {NSA}}\textcolor{red}{F_{n,s,t}^{Piped}} + \sum_{r \in R | (r, s) \in {RSA}}\textcolor{red}{F_{r,s,t}^{Piped}}\\ + \sum_{p \in P | (p, s) \in {CST}}\textcolor{red}{F_{p,s,t}^{Trucked}} + \sum_{p \in P | (p, s) \in {PST}}\textcolor{red}{F_{p,s,t}^{Trucked}}) \cdot \textcolor{green}{\pi_{s}^{Storage}}\end{aligned}\end{align} \]
\[\textcolor{red}{C^{TotalStorage}} = \sum_{t \in T}\sum_{s \in S}\textcolor{red}{C_{s,t}^{Storage}}\]

Storage Withdrawal Credit: \(\forall \textcolor{blue}{s \in S}, \textcolor{blue}{t \in T}\)

Credits from withdrawing from storage is equal to the total volume of water moved out from storage multiplied by the storage operation credit rate.

\[\textcolor{red}{R_{s,t}^{Storage}} = (\sum_{l \in L | (s, l) \in \{SNA,SCA,SKA,SRA,SOA\}}\textcolor{red}{F_{s,l,t}^{Piped}} + \sum_{l \in L | (s, l) \in \{SCT,SKT\}}\textcolor{red}{F_{s,l,t}^{Trucked}}) \cdot \textcolor{green}{\rho_{s}^{Storage}}\]
\[\textcolor{red}{R^{TotalStorage}} = \sum_{t \in T}\sum_{s \in S}\textcolor{red}{R_{s,t}^{Storage}}\]

Trucking Cost (Simplified)

Trucking cost between two locations for time period is equal to the trucking volume between locations in time \(\textcolor{blue}{t}\) divided by the truck capacity [this gets # of truckloads] multiplied by the lead time between two locations and hourly trucking cost.

\[ \begin{align}\begin{aligned}\textcolor{red}{C_{l,\tilde{l},t}^{Trucked}} = \textcolor{red}{F_{l,\tilde{l},t}^{Trucked}} \cdot \textcolor{green}{1 / \delta^{Truck}} \cdot\textcolor{green}{\tau_{l,\tilde{l}}^{Trucking}} \cdot \textcolor{green}{\pi_{l}^{Trucking}}\\\textcolor{red}{C^{TotalTrucking}} = \sum_{t \in T}\sum_{(l, \tilde{l}) \in \{PCT, \ldots, RKT\}}\textcolor{red}{C_{l,\tilde{l},t}^{Trucked}}\end{aligned}\end{align} \]

Note

The constraints above explicitly consider freshwater trucking via \(\textcolor{blue}{FCT}\) arcs.

Total Trucking Volume: \(\forall \textcolor{blue}{t \in T}\)

The total trucking volume is estimated as the summation of trucking movements over all time periods and locations.

\[\textcolor{red}{F^{TotalTrucking}} = \sum_{t \in T}\sum_{(l,\tilde{l}) \in \{PCT, \ldots, RKT\}}\textcolor{red}{F_{l,\tilde{l},t}^{Trucked}}\]

Disposal Construction or Capacity Expansion Cost:

Cost related to expanding or constructing new disposal capacity. Takes into consideration capacity increment, cost for selected capacity increment, and if the construction/expansion is selected to occur.

\[\textcolor{red}{C^{DisposalCapEx}} = \sum_{i \in I} \sum_{k \in K}\textcolor{green}{\kappa_{k,i}^{Disposal}} \cdot\textcolor{green}{\delta_{i}^{Disposal}} \cdot \textcolor{red}{y_{k,i}^{Disposal}}\]

Storage Construction or Capacity Expansion Cost:

Cost related to expanding or constructing new storage capacity. Takes into consideration capacity increment, cost for selected capacity increment, and if the construction/expansion is selected to occur.

\[\textcolor{red}{C^{StorageCapEx}} = \sum_{s \in S} \sum_{c \in C}\textcolor{green}{\kappa_{s,c}^{Storage}} \cdot \textcolor{green}{\delta_{c}^{Storage}} \cdot \textcolor{red}{y_{s,c}^{Storage}}\]

Treatment Construction or Capacity Expansion Cost:

Cost related to expanding or constructing new treatment capacity. Takes into consideration capacity increment, cost for selected capacity increment, and if the construction/expansion is selected to occur.

\[\textcolor{red}{C^{TreatmentCapEx}} = \sum_{r \in R}\sum_{j \in J}\sum_{b \in B}\textcolor{green}{\kappa_{r,b,j}^{Treatment}} \cdot \textcolor{green}{\delta_{b, j}^{Treatment}} \cdot \textcolor{red}{y_{r,b,j}^{Treatment}}\]

Pipeline Construction or Capacity Expansion Cost:

Cost related to expanding or constructing new pipeline capacity is calculated differently depending on model configuration settings.

If the pipeline cost configuration is capacity based, pipeline expansion cost is calculated using capacity increments, cost for selected capacity increment, and if the construction/expansion is selected to occur.

\[\textcolor{red}{C^{PipelineCapEx}} = \sum_{l \in L}\sum_{\tilde{l} \in L}\sum_{d \in D}\textcolor{green}{\kappa_{l,\tilde{l},d}^{Pipeline}} \cdot \textcolor{green}{\delta_{d}^{Pipeline}} \cdot \textcolor{red}{y_{l,\tilde{l},d}^{Pipeline}}\]

If the pipeline cost configuration is distance based, pipeline expansion cost is calculated using pipeline distances, pipeline diameters, cost per inch mile, and if the construction/expansion is selected to occur.

\[\textcolor{red}{C^{PipelineCapEx}} = \sum_{l \in L}\sum_{\tilde{l} \in L}\sum_{d \in D}\textcolor{green}{\kappa^{Pipeline} \cdot }\textcolor{green}{\mu_{d}^{Pipeline}} \cdot \textcolor{green}{\lambda_{l,\tilde{l}}^{Pipeline}} \cdot \textcolor{red}{y_{l,\tilde{l},d}^{Pipeline}}\]

Seismic Response Area - Disposal Operating Capacity Reduction: \(\forall \textcolor{blue}{k \in K} \textcolor{blue}{t \in T}\)

Seismic Response Areas (SRAs) can reduce the operating capacity at disposal wells. The operating capacity is set by the full built capacity and the max percentage of capacity the disposal site is allowed to use.

\[\textcolor{red}{F_{k,t}^{DisposalDestination}} \leq \textcolor{green}{\epsilon_{k,t}^{DisposalOperatingCapacity}} \cdot \textcolor{red}{D_{k}^{Capacity}}\]

Slack Costs:

Weighted sum of the slack variables. In the case that the model is infeasible, these slack variables are used to determine where the infeasibility occurs (e.g. pipeline capacity is not sufficient).

\[ \begin{align}\begin{aligned}\textcolor{red}{C^{Slack}} = \sum_{p \in CP}\sum_{t \in T}\textcolor{red}{S_{p,t}^{FracDemand}} \cdot \textcolor{green}{\psi^{FracDemand}} + \sum_{p \in PP}\sum_{t \in T}\textcolor{red}{S_{p,t}^{Production}} \cdot \textcolor{green}{\psi^{Production}}\\ + \sum_{p \in CP}\sum_{t \in T}\textcolor{red}{S_{p,t}^{Flowback}} \cdot \textcolor{green}{\psi^{Flowback}} + \sum_{(l, \tilde{l}) \in { \ldots }}\textcolor{red}{S_{l,\tilde{l}}^{PipelineCapacity}} \cdot \textcolor{green}{\psi^{PipeCapacity}}\\ + \sum_{s \in S}\textcolor{red}{S_{s}^{StorageCapacity}} \cdot \textcolor{green}{\psi^{StorageCapacity}} + \sum_{k \in K}\textcolor{red}{S_{k}^{DisposalCapacity}} \cdot \textcolor{green}{\psi^{DisposalCapacity}}\\ + \sum_{r \in R}\textcolor{red}{S_{r}^{TreatmentCapacity}} \cdot \textcolor{green}{\psi^{TreatmentCapacity}} + \sum_{o \in O}\textcolor{red}{S_{o}^{BeneficialReuseCapacity}} \cdot \textcolor{green}{\psi^{BeneficialReuseCapacity}}\end{aligned}\end{align} \]

Logic Constraints:

New pipeline or facility capacity constraints: e.g., only one injection capacity can be used for a given site. The sets for capacity sizes should also include the 0th case (e.g., 0 bbl) that indicates the choice to not expand capacity. Alternatively, if it is desired to only consider sizes to build, the 0th case can be left out.

\(\forall \textcolor{blue}{k \in K}\)

\[\sum_{i \in I}\textcolor{red}{y_{k,i,[t]}^{Disposal}} = 1\]

\(\forall \textcolor{blue}{s \in S}\)

\[\sum_{c \in C}\textcolor{red}{y_{s,c,[t]}^{Storage}} = 1\]

\(\forall \textcolor{blue}{l \in L}, \textcolor{blue}{\tilde{l} \in L}\)

\[\sum_{d \in D}\textcolor{red}{y_{l,\tilde{l},d,[t]}^{Pipeline}} = 1\]

\(\forall \textcolor{blue}{r \in R}\)

\[\sum_{j \in J, b \in B}\textcolor{red}{y_{r,b,j}^{Treatment}} = 1\]

Logic Constraints for Desalination:

Desalinated water is not reused for completions pad demand or stored in the storage

\(\forall \textcolor{blue}{r \in R}, \textcolor{blue}{t \in T}\)

\[\sum_{p \in CP | (r, p) \in RCA}\textcolor{red}{F_{r,p,t}^{Piped}} + \sum_{s \in S | (r, s) \in RSA}\textcolor{red}{F_{r,s,t}^{Piped}} \leq \textcolor{green}{M^{Flow}} \cdot (1 - \sum_{j \in J, b \in B | \textcolor{green}{\chi_{b}^{DesalinationTechnology}}} \textcolor{red}{y_{r,b,j}^{Treatment}})\]

Treated water (but not desalinated) is reused for completions pad demand or stored in the storage. For, this if desalination technology is not selected then amount of desalinated water is set to zero.

\(\forall \textcolor{blue}{r \in R}, \textcolor{blue}{t \in T}\)

\[\textcolor{red}{F_{r,t}^{DesalinatedWater}} \leq \textcolor{green}{M^{Flow}} \cdot (1 - \sum_{j \in J, b \in B | \textcolor{green}{\chi_{b}^{DesalinationTechnology}}} \textcolor{red}{y_{r,b,j}^{Treatment}})\]

Desalination technology is assigned to a pre-determined site.

\(\forall \textcolor{blue}{r \in R}\)

if \(\textcolor{green}{\chi_{r}^{DesalinationSite}}\)

\[\sum_{j \in J, b \in B | \textcolor{green}{\chi_{b}^{DesalinationTechnology}}}\textcolor{red}{y_{r,b,j}^{Treatment}} = 1\]

Clean brine technology is assigned to a non-desalination site.

\(\forall \textcolor{blue}{r \in R}\)

if NOT \(\textcolor{green}{\chi_{r}^{DesalinationSite}}\)

\[\sum_{j \in J, b \notin B | \textcolor{green}{\chi_{b}^{DesalinationTechnology}}}\textcolor{red}{y_{r,b,j}^{Treatment}} = 1\]

Evaporation Flow Constraint Evaporation flow for a given time period and storage site is 0 if it is the first time period. Otherwise, evaporation is a constant flow set by the parameter \(\textcolor{green}{\omega^{EvaporationRate}}\).

For \(t = 1\):

\[\textcolor{red}{F_{s,t}^{StorageEvaporationStream}} = 0\]

For \(t > 1\):

\[\textcolor{red}{F_{s,t}^{StorageEvaporationStream}} = \textcolor{green}{\omega^{EvaporationRate}} \cdot \sum_{j \in J, r \in R | (r,s) \in RSA} \textcolor{red}{y_{r,'CB-EV',j}^{Treatment}}\]

Deliveries Destination Constraints:

Completions reuse deliveries at a completions pad in time period \(\textcolor{blue}{t}\) is equal to all piped and trucked water moved into the completions pad, excluding freshwater. \(\forall \textcolor{blue}{p \in CP}, \textcolor{blue}{t \in T}\)

\[\textcolor{red}{F_{p,t}^{CompletionsReuseDestination}} = \sum_{l \in L | (l, p) \in \{PCA, CCA, NCA, RCA, SCA, PCT, CCT, SCT\}}\textcolor{red}{F_{l,p,t}^{Piped}} + \textcolor{red}{F_{l,p,t}^{Trucked}}\]

Disposal deliveries for disposal site \(\textcolor{blue}{k}\) at time \(\textcolor{blue}{t}\) is equal to all piped and trucked water moved to the disposal site \(\textcolor{blue}{k}\). \(\forall \textcolor{blue}{k \in K}, \textcolor{blue}{t \in T}\)

\[\textcolor{red}{F_{k,t}^{DisposalDestination}} = \sum_{l \in L | (l, k) \in \{NKA, RKA, SKA, PKT, CKT, SKT, RKT\}}\textcolor{red}{F_{l,k,t}^{Piped}} + \textcolor{red}{F_{l,k,t}^{Trucked}}\]

Beneficial reuse deliveries for beneficial reuse site \(\textcolor{blue}{o}\) at time \(\textcolor{blue}{t}\) is equal to all piped and trucked water moved to the beneficial reuse site \(\textcolor{blue}{o}\). \(\forall \textcolor{blue}{o \in O}, \textcolor{blue}{t \in T}\)

\[\textcolor{red}{F_{o,t}^{BeneficialReuseDestination}} = \sum_{l \in L | (l, o) \in \{NOA, SOA, POT\}}\textcolor{red}{F_{l,o,t}^{Piped}} + \textcolor{red}{F_{l,o,t}^{Trucked}}\]

Completions deliveries destination for completions pad \(\textcolor{blue}{p}\) at time \(\textcolor{blue}{t}\) is equal to all piped and trucked water moved to the completions pad. \(\forall \textcolor{blue}{p \in CP}, \textcolor{blue}{t \in T}\)

\[ \begin{align}\begin{aligned}\textcolor{red}{F_{p,t}^{CompletionsDestination}} = \sum_{n \in N | (n, p) \in NCA}\textcolor{red}{F_{n,p,t}^{Piped}} + \sum_{\tilde{p} \in P | (\tilde{p}, p) \in PCA}\textcolor{red}{F_{\tilde{p},p,t}^{Piped}} + \sum_{s \in S | (s, p) \in SCA}\textcolor{red}{F_{s,p,t}^{Piped}}\\ + \sum_{\tilde{p} \in P | (\tilde{p}, p) \in CCA}\textcolor{red}{F_{\tilde{p},p,t}^{Piped}} + \sum_{r \in R | (r, p) \in RCA}\textcolor{red}{F_{r,p,t}^{Piped}} + \sum_{f \in F | (f, p) \in FCA}\textcolor{red}{F_{f,p,t}^{Sourced}}\\ + \sum_{\tilde{p} \in P | (\tilde{p}, p) \in PCT}\textcolor{red}{F_{\tilde{p},p,t}^{Trucked}} + \sum_{s \in S | (s, p) \in SCT}\textcolor{red}{F_{s,p,t}^{Trucked}} + \sum_{\tilde{p} \in P | (\tilde{p}, p) \in CCT}\textcolor{red}{F_{\tilde{p},p,t}^{Trucked}}\\ + \sum_{f \in F | (f, p) \in FCT}\textcolor{red}{F_{f,p,t}^{Trucked}} + \textcolor{red}{F_{p,t}^{PadStorageOut}}-\textcolor{red}{F_{p,t}^{PadStorageIn}}\end{aligned}\end{align} \]
Strategic Model Water Quality Extension

An extension to this strategic optimization model measures the water quality across all locations over time. As of now, water quality is not a decision variable. It is calculated after optimization of the strategic model. The process for calculating water quality is as follows: the strategic model is first solved to optimality, water quality variables and constraints are added, flow rates and storage levels are fixed to the solved values at optimality, and the water quality is calculated.

Note

Fixed variables are colored purple in the documentation.

Assumptions:

  • Water quality of produced water from production pads and completions pads remains the same across all time periods

  • When blending flows of different water quality, they blend linearly

  • Treatment does not affect water quality

Water Quality Sets

\(\textcolor{blue}{w \in W}\) Water Quality Components (e.g., TDS)

\(\textcolor{blue}{p^{IntermediateNode} \in CP}\) Intermediate Completions Pad Nodes

\(\textcolor{blue}{p^{PadStorage} \in CP}\) Pad Storage

\(\textcolor{blue}{r^{TreatedWaterIntermediateNode} \in R}\) Treated Water Intermediate Node

Water Quality Parameters

\(\textcolor{green}{\nu_{p,w,[t]}}\) = Water quality at well pad

\(\textcolor{green}{\xi_{s,w}^{StorageSite}}\) = Initial water quality at storage

\(\textcolor{green}{\xi_{p,w}^{PadStorage}}\) = Initial water quality at pad storage

Water Quality Variables

\(\textcolor{red}{Q_{l,w,t}}\) = Water quality at location

Disposal Site Water Quality \(\forall \textcolor{blue}{k \in K}, \textcolor{blue}{w \in W}, \textcolor{blue}{t \in T}\)

The water quality of disposed water is dependent on the flow rates into the disposal site and the quality of each of these flows.

\[ \begin{align}\begin{aligned}\sum_{n \in N | (n, k) \in NKA}\textcolor{purple}{F_{n,k,t}^{Piped}} \cdot \textcolor{red}{Q_{n,w,t}} + \sum_{s \in S | (s, k) \in SKA}\textcolor{purple}{F_{s,k,t}^{Piped}} \cdot \textcolor{red}{Q_{s,w,t}} + \sum_{r \in R | (r, k) \in RKA}\textcolor{purple}{F_{r,k,t}^{Piped}} \cdot \textcolor{red}{Q_{r,w,t}}\\ + \sum_{s \in S | (s, k) \in SKT}\textcolor{purple}{F_{s,k,t}^{Trucked}} \cdot \textcolor{red}{Q_{s,w,t}} + \sum_{p \in P | (p, k) \in PKT}\textcolor{purple}{F_{p,k,t}^{Trucked}} \cdot \textcolor{green}{\nu_{p,w,[t]}}\\ + \sum_{p \in P | (p, k) \in CKT}\textcolor{purple}{F_{p,k,t}^{Trucked}} \cdot \textcolor{green}{\nu_{p,w,[t]}} + \sum_{r \in R | (r, k) \in RKT}\textcolor{purple}{F_{r,k,t}^{Trucked}} \cdot \textcolor{red}{Q_{r,w,t}}\\ = \textcolor{purple}{F_{k,t}^{DisposalDestination}} \cdot \textcolor{red}{Q_{k,w,t}}\end{aligned}\end{align} \]

Storage Site Water Quality \(\forall \textcolor{blue}{s \in S}, \textcolor{blue}{w \in W}, \textcolor{blue}{t \in T}\)

The water quality at storage sites is dependent on the flow rates into the storage site, the volume of water in storage in the previous time period, and the quality of each of these flows. Even mixing is assumed, so all outgoing flows have the same water quality. If it is the first time period, the initial storage level and initial water quality, respectively, replace the water stored and water quality in the previous time period.

For \(t = 1\):

\[ \begin{align}\begin{aligned}\textcolor{green}{\lambda_{s,t=1}^{Storage}} \cdot \textcolor{green}{\xi_{s,w}^{StorageSite}} + \sum_{n \in N | (n, s) \in NSA}\textcolor{purple}{F_{n,s,t}^{Piped}} \cdot \textcolor{red}{Q_{n,w,t}}\\ + \sum_{r \in R | (r, s) \in RSA}\textcolor{purple}{F_{r,s,t}^{Piped}} \cdot \textcolor{red}{Q_{r,w,t}} + \sum_{p \in P | (p, s) \in PST}\textcolor{purple}{F_{p,s,t}^{Trucked}} \cdot \textcolor{green}{\nu_{p,w,[t]}} + \sum_{p \in P | (p, s) \in CST}\textcolor{purple}{F_{p,s,t}^{Trucked}} \cdot \textcolor{green}{\nu_{p,w,[t]}}\\ = \textcolor{red}{Q_{s,w,t}} \cdot (\textcolor{purple}{L_{s,t}^{Storage}} + \sum_{n \in N | (s, n) \in SNA}\textcolor{purple}{F_{s,n,t}^{Piped}} + \sum_{p \in P | (s, p) \in SCA}\textcolor{purple}{F_{s,p,t}^{Piped}} + \sum_{k \in K | (s, k) \in SKA}\textcolor{purple}{F_{s,k,t}^{Piped}}\\ + \sum_{r \in R | (s, r) \in SRA}\textcolor{purple}{F_{s,r,t}^{Piped}} + \sum_{o \in O | (s, o) \in SOA}\textcolor{purple}{F_{s,o,t}^{Piped}} + \sum_{p \in P | (s, p) \in SCT}\textcolor{purple}{F_{s,p,t}^{Trucked}} + \sum_{k \in K | (s, k) \in SKT}\textcolor{purple}{F_{s,k,t}^{Trucked}} + \textcolor{purple}{F_{s,t}^{StorageEvaporationStream}})\end{aligned}\end{align} \]

For \(t > 1\):

\[ \begin{align}\begin{aligned}\textcolor{purple}{L_{s,t-1}^{Storage}} \cdot \textcolor{red}{Q_{s,w,t-1}} + \sum_{n \in N | (n, s) \in NSA}\textcolor{purple}{F_{n,s,t}^{Piped}} \cdot \textcolor{red}{Q_{n,w,t}}\\ + \sum_{r \in R | (r, s) \in RSA}\textcolor{purple}{F_{r,s,t}^{Piped}} \cdot \textcolor{red}{Q_{r,w,t}} + \sum_{p \in P | (p, s) \in PST}\textcolor{purple}{F_{p,s,t}^{Trucked}} \cdot \textcolor{green}{\nu_{p,w,[t]}} + \sum_{p \in P | (p, s) \in CST}\textcolor{purple}{F_{p,s,t}^{Trucked}} \cdot \textcolor{green}{\nu_{p,w,[t]}}\\ = \textcolor{red}{Q_{s,w,t}} \cdot (\textcolor{purple}{L_{s,t}^{Storage}} + \sum_{n \in N | (s, n) \in SNA}\textcolor{purple}{F_{s,n,t}^{Piped}} + \sum_{p \in P | (s, p) \in SCA}\textcolor{purple}{F_{s,p,t}^{Piped}} + \sum_{k \in K | (s, k) \in SKA}\textcolor{purple}{F_{s,k,t}^{Piped}}\\ + \sum_{r \in R | (s, r) \in SRA}\textcolor{purple}{F_{s,r,t}^{Piped}} + \sum_{o \in O | (s, o) \in SOA}\textcolor{purple}{F_{s,o,t}^{Piped}} + \sum_{p \in P | (s, p) \in SCT}\textcolor{purple}{F_{s,p,t}^{Trucked}} + \sum_{k \in K | (s, k) \in SKT}\textcolor{purple}{F_{s,k,t}^{Trucked}} + \textcolor{purple}{F_{s,t}^{StorageEvaporationStream}})\end{aligned}\end{align} \]

Treatment Site Water Quality \(\forall \textcolor{blue}{r \in R}, \textcolor{blue}{w \in W}, \textcolor{blue}{t \in T}\)

The water quality at treatment sites is dependent on the flow rates into the treatment site and the water quality of the flows. Even mixing is assumed, so all outgoing flows have the same water quality. The treatment process does not affect water quality.

\[ \begin{align}\begin{aligned}\sum_{n \in N | (n, r) \in NRA}\textcolor{purple}{F_{n,r,t}^{Piped}} \cdot \textcolor{red}{Q_{n,w,t}} + \sum_{s \in S | (s, r) \in SRA}\textcolor{purple}{F_{s,r,t}^{Piped}} \cdot \textcolor{red}{Q_{s,w,t}}\\+ \sum_{p \in P | (p, r) \in PRT}\textcolor{purple}{F_{p,r,t}^{Trucked}} \cdot \textcolor{green}{\nu_{p,w,[t]}} + \sum_{p \in P | (p, r) \in CRT}\textcolor{purple}{F_{p,r,t}^{Trucked}} \cdot \textcolor{green}{\nu_{p,w,[t]}}\\= \textcolor{red}{Q_{r,w,t}} \cdot (\textcolor{purple}{F_{r,t}^{ResidualWater}} + \textcolor{purple}{F_{r,t}^{TreatedWater}})\end{aligned}\end{align} \]

Treated Water Quality Rule \(\forall \textcolor{blue}{r \in R}, \textcolor{blue}{w \in W}, \textcolor{blue}{t \in T}\)

All treated water from a single treatment site and single time period will have the same water quality. This constraint allows us to easily track the water quality at treated water end points like desalinated water.

\[\textcolor{purple}{F_{r,t}^{TreatedWater}} = \textcolor{red}{Q_{r,w,t}} \cdot ( \sum_{p \in CP | (r, p) \in RCA}\textcolor{purple}{F_{r,p,t}^{Piped}} + \sum_{s \in S | (r, s) \in RSA}\textcolor{purple}{F_{r,s,t}^{Piped}} + \textcolor{purple}{F_{r,t}^{DesalinatedWater}})\]

Network Node Water Quality \(\forall \textcolor{blue}{n \in N}, \textcolor{blue}{w \in W}, \textcolor{blue}{t \in T}\)

The water quality at nodes is dependent on the flow rates into the node and the water quality of the flows. Even mixing is assumed, so all outgoing flows have the same water quality.

\[ \begin{align}\begin{aligned}\sum_{p \in P | (p, n) \in PNA}\textcolor{purple}{F_{p,n,t}^{Piped}} \cdot \textcolor{green}{\nu_{p,w,[t]}} + \sum_{p \in P | (p, n) \in CNA}\textcolor{purple}{F_{p,n,t}^{Piped}} \cdot \textcolor{green}{\nu_{p,w,[t]}}\\ + \sum_{\tilde{n} \in N | (\tilde{n}, n) \in NNA}\textcolor{purple}{F_{\tilde{n},n,t}^{Piped}} \cdot \textcolor{red}{Q_{\tilde{n},w,t}} + \sum_{s \in S | (s, n) \in SNA}\textcolor{purple}{F_{s,n,t}^{Piped}} \cdot \textcolor{red}{Q_{s,w,t}}\\ + \sum_{r \in R | (r, n) \in RNA}\textcolor{purple}{F_{r,n,t}^{Piped}} \cdot \textcolor{red}{Q_{r,w,t}}\\ = \textcolor{red}{Q_{n,w,t}} \cdot (\sum_{\tilde{n} \in N | (n, \tilde{n}) \in NNA}\textcolor{purple}{F_{n,\tilde{n},t}^{Piped}} + \sum_{p \in P | (n, p) \in NCA}\textcolor{purple}{F_{n,p,t}^{Piped}}\\ + \sum_{k \in K | (n, k) \in NKA}\textcolor{purple}{F_{n,k,t}^{Piped}} + \sum_{r \in R | (n, r) \in NRA}\textcolor{purple}{F_{n,r,t}^{Piped}}\\ + \sum_{s \in S | (n, s) \in NSA}\textcolor{purple}{F_{n,s,t}^{Piped}} + \sum_{o \in O | (n, o) \in NOA}\textcolor{purple}{F_{n,o,t}^{Piped}})\end{aligned}\end{align} \]

Completions Pad Intermediate Node Water Quality \(\forall \textcolor{blue}{p \in P}, \textcolor{blue}{w \in W}, \textcolor{blue}{t \in T}\)

Water Quality at Completions Pads

Water that is piped and trucked to a completions pad is mixed and split into two output streams: Stream (1) goes to the completions pad and stream (2) is input to the completions storage. This mixing happens at an intermediate node. Finally, water that meets completions demand comes from two inputs: The first input is output stream (1) from the intermediate step. The second is outgoing flow from the storage tank.

The water quality at the completions pad intermediate node is dependent on the flow rates of water from outside of the pad to the pad. Even mixing is assumed, so the water to storage and water to completions input have the same water quality.

\[ \begin{align}\begin{aligned}\sum_{n \in N | (n, p) \in NCA}\textcolor{purple}{F_{n,p,t}^{Piped}} \cdot \textcolor{red}{Q_{n,w,t}} + \sum_{\tilde{p} \in P | (\tilde{p}, p) \in PCA}\textcolor{purple}{F_{\tilde{p},p,t}^{Piped}} \cdot \textcolor{green}{\nu_{\tilde{p},w,[t]}} + \sum_{s \in S | (s, p) \in SCA}\textcolor{purple}{F_{s,p,t}^{Piped}} \cdot \textcolor{red}{Q_{s,w,t}}\\ + \sum_{\tilde{p} \in P | (\tilde{p}, p) \in CCA}\textcolor{purple}{F_{\tilde{p},p,t}^{Piped}} \cdot \textcolor{green}{\nu_{\tilde{p},w,[t]}} + \sum_{r \in R | (r, p) \in RCA}\textcolor{purple}{F_{r,p,t}^{Piped}} \cdot \textcolor{red}{Q_{r,w,t}} + \sum_{f \in F | (f, p) \in FCA}\textcolor{purple}{F_{f,p,t}^{Sourced}} \cdot \textcolor{red}{Q_{f,w,t}}\\ + \sum_{\tilde{p} \in P | (\tilde{p}, p) \in PCT}\textcolor{purple}{F_{\tilde{p},p,t}^{Trucked}} \cdot \textcolor{green}{\nu_{\tilde{p},w,[t]}} + \sum_{s \in S | (s, p) \in SCT}\textcolor{purple}{F_{s,p,t}^{Trucked}} \cdot \textcolor{red}{Q_{s,w,t}} + \sum_{\tilde{p} \in P | (\tilde{p}, p) \in CCT}\textcolor{purple}{F_{\tilde{p},p,t}^{Trucked}} \cdot \textcolor{green}{\nu_{\tilde{p},w,[t]}}\\ + \sum_{f \in F | (f, p) \in FCT}\textcolor{purple}{F_{f,p,t}^{Trucked}} \cdot \textcolor{red}{Q_{f,w,t}} = \textcolor{red}{Q_{p^{IntermediateNode},w,t}} \cdot (\textcolor{purple}{F_{p,t}^{PadStorageIn}} + \textcolor{purple}{F_{p,t}^{CompletionsDestination}})\end{aligned}\end{align} \]

Completions Pad Input Node Water Quality \(\forall \textcolor{blue}{p \in P}, \textcolor{blue}{w \in W}, \textcolor{blue}{t \in T}\)

The water quality at the completions pad input is dependent on the flow rates of water from pad storage and water from the intermediate node. Even mixing is assumed, so all water into the pad is of the same water quality.

\[\textcolor{purple}{F_{p,t}^{PadStorageOut}} \cdot \textcolor{red}{Q_{p^{PadStorage},w,t}}+\textcolor{purple}{F_{p,t}^{CompletionsDestination}} \cdot \textcolor{red}{Q_{p^{IntermediateNode},w,t}} = \textcolor{red}{Q_{p,w,t}} \cdot \textcolor{green}{\gamma_{p,t}^{Completions}}\]

Completions Pad Storage Node Water Quality \(\forall \textcolor{blue}{p \in P}, \textcolor{blue}{w \in W}, \textcolor{blue}{t \in T}\)

The water quality at pad storage sites is dependent on the flow rates into the pad storage site, the volume of water in pad storage in the previous time period, and the quality of each of these flows. Even mixing is assumed, so the outgoing flow to completions pad and water in storage at the end of the period have the same water quality. If it is the first time period, the initial storage level and initial water quality, respectively, replace the water stored and water quality in the previous time period.

For \(t = 1\):

\[ \begin{align}\begin{aligned}\textcolor{green}{\lambda_{s,t=1}^{PadStorage}} \cdot \textcolor{green}{\xi_{p,w}^{PadStorage}} + \textcolor{purple}{F_{p,t}^{PadStorageIn}} \cdot \textcolor{red}{Q_{p^{IntermediateNode},w}}\\ = \textcolor{red}{Q_{p^{PadStorage},w,t}} \cdot (\textcolor{purple}{L_{s,t}^{PadStorage}} + \textcolor{purple}{F_{p,t}^{PadStorageOut}})\end{aligned}\end{align} \]

For \(t > 1\):

\[ \begin{align}\begin{aligned}\textcolor{purple}{L_{s,t-1}^{PadStorage}} \cdot \textcolor{red}{Q_{p^{PadStorage},w,t-1}} + \textcolor{purple}{F_{p,t}^{PadStorageIn}} \cdot \textcolor{red}{Q_{p^{IntermediateNode},w}}\\ = \textcolor{red}{Q_{p^{PadStorage},w,t}} \cdot (\textcolor{purple}{L_{s,t}^{PadStorage}} + \textcolor{purple}{F_{p,t}^{PadStorageOut}})\end{aligned}\end{align} \]

Beneficial Reuse Water Quality \(\forall \textcolor{blue}{o \in O}, \textcolor{blue}{w \in W}, \textcolor{blue}{t \in T}\)

The water quality at beneficial reuse sites is dependent on the flow rates into the site and the water quality of the flows.

\[ \begin{align}\begin{aligned}\sum_{n \in N | (n, o) \in NOA}\textcolor{purple}{F_{n,o,t}^{Piped}} \cdot \textcolor{red}{Q_{n,w,t}} + \sum_{s \in S | (s, o) \in SOA}\textcolor{purple}{F_{s,o,t}^{Piped}} \cdot \textcolor{red}{Q_{s,w,t}} + \sum_{p \in P | (p, o) \in POT}\textcolor{purple}{F_{p,o,t}^{Trucked}} \cdot \textcolor{green}{\nu_{p,w,[t]}}\\ = \textcolor{red}{Q_{o,w,t}} \cdot \textcolor{purple}{F_{o,t}^{BeneficialReuseDestination}}\end{aligned}\end{align} \]
Strategic Model Discrete Water Quality Extension

In the previous chapter a model for tracking the water quality was shown. Without fixing the flows this model is non-linear. By discretizing the number of water qualities for all locations over time we can make the model linear again.

The discretization works as follows.

Take for example this term from the Disposal Site Water Quality:

\[\textcolor{red}{F_{k,t}^{DisposalDestination}} \cdot \textcolor{red}{Q_{k,w,t}}\]

Both terms are continuous, so this is non-linear.

First we introduce a set, parameter, variables and constraints

Discrete Water Quality Sets

\(\textcolor{blue}{q \in Q}\) Discrete Water Qualities

Discrete Water Quality Parameters

\(\textcolor{green}{Q_{w,q}^{DiscreteQuality}}\) = Values for discrete Water Qualities

Discrete Water Quality Variables

\(\textcolor{red}{Z_{l,t,w,q}}\) = Binary decision variable for which discrete quality chosen

\(\textcolor{red}{F_{k,t,w,q}^{DiscreteDisposalDestination}}\) = Water injected at disposal site for each discrete quality

Only One Discrete Quality Per Location ∀l in L, t in T, w in W

For each location in time only one discrete water quality can be chosen for a water quality component.

\[\sum_{(q) \in Q}\textcolor{red}{Z_{l,t,w,q}} = 1\]

Discrete Max Disposal Destination ∀l in L, t in T, w in W, q in Q

For each location in time only for one discrete quality there can be water injected at the disposal site and at most the capacity for that disposal site. For all the others it is equal to zero.

\[\textcolor{red}{F_{k,t,w,q}^{DiscreteDisposalDestination}} \leq \textcolor{green}{D_{k,[t]}^{Capacity}} \cdot \textcolor{red}{Z_{l,t,w,q}}\]

Sum Flow Discrete Disposal Destinations is Flow Disposal Destination ∀l in L, t in T, w in W

For each location in time the sum of the flows for all the discrete qualities is equal to the actual flow going to the disposal site.

\[\sum_{(q) \in Q}\textcolor{red}{F_{k,t,w,q}^{DiscreteDisposalDestination}} = \textcolor{red}{F_{k,t}^{DisposalDestination}}\]

We can now rewrite the non linear equation showed before to:

\[\sum_{(q) \in Q}\textcolor{red}{F_{k,t,w,q}^{DiscreteDisposalDestination}} \cdot \textcolor{green}{Q_{w,q}^{DiscreteQuality}}\]

Rewriting the whole constraints goes as follows:

Disposal Site Water Quality ∀k in K, w in W, t in T

The water quality of disposed water is dependent on the flow rates into the disposal site and the quality of each of these flows.

\[ \begin{align}\begin{aligned}\sum_{n \in N | (n,k) \in NKA}\textcolor{red}{F_{n,k,t}^{Piped}} \cdot \textcolor{red}{Q_{n,w,t}} +\sum_{s \in S | (s,k) \in SKA}\textcolor{red}{F_{s,k,t}^{Piped}} \cdot \textcolor{red}{Q_{s,w,t}}+\sum_{r \in R | (r,k) \in RKA}\textcolor{red}{F_{r,k,t}^{Piped}} \cdot \textcolor{red}{Q_{r,w,t}}\\+\sum_{s \in S | (s,k) \in SKT}\textcolor{red}{F_{s,k,t}^{Trucked}} \cdot \textcolor{red}{Q_{s,w,t}}+\sum_{p \in P | (p,k) \in PKT}\textcolor{red}{F_{p,k,t}^{Trucked}} \cdot \textcolor{green}{v_{p,w,[t]}}\\+\sum_{p \in P | (p,k) \in CKT}\textcolor{red}{F_{p,k,t}^{Trucked}} \cdot \textcolor{green}{v_{p,w,[t]}}+\sum_{r \in R | (r,k) \in RKT}\textcolor{red}{F_{r,k,t}^{Trucked}} \cdot \textcolor{red}{Q_{r,w,t}}\\=\textcolor{red}{F_{k,t}^{DisposalDestination}} \cdot \textcolor{red}{Q_{k,w,t}}\end{aligned}\end{align} \]

Can be rewritten as

Discrete Disposal Site Water Quality ∀k in K, w in W, t in T

The water quality of disposed water is dependent on the flow rates into the disposal site and the quality of each of these flows.

\[ \begin{align}\begin{aligned}\sum_{n \in N | (n,k) \in NKA}\sum_{(q) \in Q}\textcolor{red}{F_{n,k,t,q}^{DiscretePiped}} \cdot \textcolor{green}{Q_{w,q}^{DiscreteQuality}}\\+\sum_{s \in S | (s,k) \in SKA}\sum_{(q) \in Q}\textcolor{red}{F_{s,k,t,q}^{DiscretePiped}} \cdot \textcolor{green}{Q_{w,q}^{DiscreteQuality}}\\+\sum_{r \in R | (r,k) \in RKA}\sum_{(q) \in Q}\textcolor{red}{F_{r,k,t,q}^{DiscretePiped}} \cdot \textcolor{green}{Q_{w,q}^{DiscreteQuality}}\\+\sum_{s \in S | (s,k) \in SKT}\sum_{(q) \in Q}\textcolor{red}{F_{s,k,t,q}^{DiscreteTrucked}} \cdot \textcolor{green}{Q_{w,q}^{DiscreteQuality}}\\+\sum_{p \in P | (p,k) \in PKT}\textcolor{red}{F_{p,k,t}^{Trucked}} \cdot \textcolor{green}{v_{p,w,[t]}}\\+\sum_{p \in P | (p,k) \in CKT}\textcolor{red}{F_{p,k,t}^{Trucked}} \cdot \textcolor{green}{v_{p,w,[t]}}\\+\sum_{r \in R | (r,k) \in RKT}\sum_{(q) \in Q}\textcolor{red}{F_{r,k,t,q}^{DiscreteTrucked}} \cdot \textcolor{green}{Q_{w,q}^{DiscreteQuality}}\\\leq \sum_{(q) \in Q}\textcolor{red}{F_{k,t,w,q}^{DiscreteDisposalDestination}} \cdot \textcolor{green}{Q_{w,q}^{DiscreteQuality}}\end{aligned}\end{align} \]

The constraints for the DiscretePiped and DiscreteTrucked are similar to the DiscreteDisposalDestination.

Note

The = sign in the original constraint is changed to \(\leq\) sign in the discretized version.

References

Cafaro, D. C., & Grossmann, I. (2021). Optimal design of water pipeline networks for the development of shale gas resources. AIChE Journal, 67(1), e17058.

Tutorials

PARETO tutorials are currently under development and will be made publicly available as soon as possible.

Since PARETO project is an open source project and we are in collaboration with WaterTAP and IDAES projects, the IDAES tutorials and WaterTAP tutorials are good learning materials.

In particular, new users should be familiar with Python and Pyomo. Because PARETO and IDAES share this common base, we refer users unfamiliar with Python or Pyomo to the IDAES tutorials Short Introduction to Python and Pyomo or the Longer Introduction to Python and Pyomo.

PARETO will leverage WaterTAP models for desalination technologies, therefore, WaterTAP tutorials can be found here: https://watertap.readthedocs.io/en/latest/tutorials/index.html

The IDAES documentation and tutorials can be found here: https://idaes-pse.readthedocs.io/en/stable/

Utilities

PARETO project provides a set of user-friendly utility methods to display and analyze results. These methods include debugging tools, plotting utilities, and Python-Excel interfaces.

Get Data Functions

The following functions are used to conveniently acquire data.

Function

Section

get_data

Get Data

set_consistency_check

Set Consistency Check

od_matrix

Origin/Destination Matrix

Get Data

Method Description:

This method uses Pandas methods to read data for sets and parameters from an Excel spreadsheet. Sets are assumed to not have neither a header nor an index column. In addition, the data should be placed in column A, row 2, for example:

_images/get_data_1.png

Figure 1. get_data Set Setup Format

Parameters can be in either table or column format. Table format requires a header (usually time periods) and index columns whose elements should be contained in a set. Each index column should be labeled with a header starting in cell A2. Spreadsheet names for sets should be used as headers; however, generic keywords “NODES” and “INDEX” can also be used. Column format requires that each set be placed in one column, starting from cell A3. Spreadsheet names for sets should be used as headers in row 2 for each column “NODES” and “INDEX” can also be used. Data should be provided in the last column, and the keyword “VALUE” should be used as header.

_images/get_data_2.png

Figure 2. get_data Parameter Setup Format

This method outputs a dictionary that contains a list for each set and a dictionary that contains parameters in the following format: {‘param1’: {(set1, set2): value}, ‘param1’: {(set1, set2): value}}

How to Use:

set_list = ['ProductionPads','CompletionsPads'], parameter_list = ['DriveTimes', 'CompletionsDemand]
fpath = 'path\\to\\excel\\file.xlsx’
[df_sets, df_parameters] = get_data(fpath, set_list, parameter_list)
Set Consistency Check

Method Description:

This method checks if the elements included in a table or parameter have been defined as part of the Sets that index such parameter. set_consistency_check() raises a TypeError exception If there are entries in the Parameter that are not contained in the Sets, and prints out a list with all the entries that require revision.

How to Use:

The method requires one specified parameter (e.g. ProductionRates) AND one OR several sets over which the aforementioned parameter is declared (e.g.ProductionPads, ProductionTanks, TimePeriods). In general, the method can be run as follows: set_consistency_check(Parameter, set_1, set_2, etc)

Origin/Destination Matrix

Method Description:

This method allows the user to request drive distances and drive times using Bing maps API and Open Street Maps API. The method accept the following input arguments: - origin:

REQUIRED. Data containing information regarding location name, and coordinates latitude and longitude. Two formats are acceptable:

  • {(origin1,”latitude”): value1, (origin1,”longitude”): value2} or

  • {origin1:{“latitude”:value1, “longitude”:value2}}

The first format allows the user to include a tab with the corresponding data in a table format as part of the workbook casestudy.

  • destination:

    OPTIONAL. If no data for destination is provided, it is assumed that the origins are also destinations.

  • api:

    OPTIONAL. Specify the type of API service, two options are supported:

    If no API is selected, Open Street Maps is used by default

  • api_key:

    An API key should be provided in order to use Bing maps. The key can be obtained at: https://www.microsoft.com/en-us/maps/create-a-bing-maps-key

  • output:

    OPTIONAL. Define the parameters that the method will output. The user can select:

    • ‘time’: A list containing the drive times between the locations is returned

    • ‘distance’: A list containing the drive distances between the locations is returned

    • ‘time_distance’: Two lists containing the drive times and drive distances between the locations is returned

    If not output is specified, ‘time_distance’ is the default

  • fpath:

    OPTIONAL. od_matrix() will ALWAYS output an Excel workbook with two tabs, one that contains drive times, and another that contains drive distances. If not path is specified, the excel file is saved with the name ‘od_output.xlsx’ in the current directory.

  • create_report:

    OPTIONAL. if True an Excel report with drive distances and drive times is created

Results Functions

The following functions are used to conveniently display and analyze data.

Function

Section

generate_report

Generate Report

generate_sankey

Generate Sankey

plot_sankey

Plot Sankey

plot_bars

Plot Bars

plot_scatter

Plot Scatter

Generate Report

Method Description:

This method identifies the type of model: [strategic, operational], creates a printing list based on is_print, and creates a dictionary that contains headers for all the variables that will be included in an Excel report. The dictionaries are used to create separate excel sheets which categorize the data by variable name or type. This same data is put into excel sheets named after each variable as well as an overview sheet which contains totals and Key Performance Indicators (KPI) information.

Warning

If an indexed variable is added or removed from a model, the printing lists and headers should be updated accordingly.

The output of this method prints out each variable’s information in the terminal as specified by the user, as shown below.

_images/generate_report_1.png

Figure 1. Example of Terminal Output

_images/generate_report_2.png

Figure 2. Example of Excel Output

How to Use:

This method requires two parameters:

1.) The model that is being returned from the create_model() method after a solution is found

2.) An array of an “enum” class value specifying which variables to print which are chosen by the user. These values are:

“PrintValues.Essential” – Specifies that the overview information will be printed

“PrintValues.Nominal” – Specifies that all information from PrintValues.Essential + Trucked, Piped, and Sourced water information will be printed

“PrintValues.Detailed” – Specifies that all information including slack information will be printed

Example of how this method is used:

strategic_model = create_model(df_sets, df_parameters)
results = opt.solve(strategic_model, tee=True)
[model, results] = generate_report(strategic_model, is_print=[PrintValues.Detailed], fname="..\\..\\PARETO_report.xlsx")
Generate Sankey

Method Description:

Sankey diagrams are a graphic tool used to easily visualize supply-sink flows across a given infrastructure (source/destination). The relative width of each “flow” is proportional to the amount of water that is being transported between locations. Such diagrams are commonly used to visualize the complex nature of money, energy or material flows.

This method receives the final lists for source, destination, value, and labels to be used in generating the Sankey diagram. It also receives arguments that determine font size and plot titles. The user can save the Sankey diagram in the following formats: jpg, jpeg, pd, png, svg, and html. Html format is set by default.

How to Use:

# Creating links and nodes based on the passed in lists to be used as the data for generating the Sankey diagram
  link = dict(source=source, target=destination, value=value)
  node = dict(label=label, pad=30, thickness=15, line=dict(color="black", width=0.5))
  data = go.Sankey(link=link, node=node)

  # Assigning sankey diagram to fig variable
  fig = go.Figure(data)
  fig.write_html("first_figure.html", auto_open=True)
Plot Sankey

Method Description:

This method receives data in the form of 3 seperate lists (origin, destination, value lists), generate_report dictionary output format, or get_data dictionary output format. It then places this data into 4 lists of unique elements so that proper indexes can be assigned for each list so that the elements will correspond with each other based off of the indexes. These lists are then passed into the outlet_flow method which gives an output which is passed into the method to generate the sankey diagram.

_images/plot_sankey_1.png

Figure 3. Example of Sankey Diagram Showing Water Production Flows

How to Use:

This method requires two parameters:

1.) An input data dictionary that includes the time periods requested as well as said data. The data is passed in as ‘pareto_var’ and can be in get_data() format, which requires labels, generate_report() format, or 3 separate lists:

“pareto_var” – This parameter can be variable data returned from the get_data() or generate_report() format

“time_period” – This is used to specify which time periods from the data that the user wants shown in the diagram. If the user passes no time periods in, then all time periods are used in the data.

“labels” – This is only required if the data being passed in is in get_data() format. The labels are used to distinguish between the columns.

2.) A dictionary of arguments that include formatting options like font size, title of the plot and output file:

output_file – This parameter is used for creating the file that contains the Sankey Diagram created by this method

Example of how this method is used:

args = {"font_size": 15,
       "plot_title": "Completion Storage",
       "output_file": "..\\first_sankey.png"}

input_data = {"pareto_var": df_parameters["v_f_Trucked"]
               "labels": [("Origin", "Destination", "Time", "Trucked Water")]}

plot_sankey(input_data, args)
Plot Bars

Method Description:

This method generates a bar chart based on the variable data that the user passes in. It automatically creates either an animated bar chart (if the variable is indexed by time) or a static bar chart.

_images/plot_bars_1.png

Figure 4. Animated Bar Chart

How to Use

This method requires two parameters:

1.) A dictionary including the data and labels that are being used, either in get_data() output format or generate_report() output format. (Labels only required for get_data() format).

“pareto_var”– This parameter contains the data that the user wants to use

“labels”– This is a tuple that contains the labels for each column of the data provided.

2.) A dictionary of arguments that include the title of the plot, a group by parameter, and an output file. Here is an example of the arguments:

“group_by” - This specifies what field will be used as the x axis in the plot

“output_file” - This parameter is used for creating the file that contains the Bar Chart created by this method.

“y_axis” - This specifies if the user wants to take the logarithm of the y axis. If not provided, then the y axis remains the default(linear).

Example of how this method is used:

args = {"plot_title": "Completion Storage",
          "y_axis": "log",
          "group_by": "Destination",
          "output_file": "first_bar.html"}

input_data = {"pareto_var": df_parameters["v_f_PadStorage"]
              "labels": [("Completion Pad", "Time", "Storage Levels")]}

plot_bars(input_data, args)
Plot Scatter

Method Description:

This method creates the scatter plot that is generated from the variable data that the user passes in. It creates either an animated scatter plot(if the variable is indexed by time) or a static scatter plot.

_images/plot_scatter_1.png

Figure 5. Animated Scatter Chart. Notice the time period slider at the bottom.

How to Use

This method requires two parameters:

1.) An input data dictionary that include the variables for x and y axis, a size parameter, and labels parameters that provides a tuple of labels (only required for get_data() format) for x, y, and size variables.

“pareto_var”– This parameter contains the data that the user wants to use.

“labels”– This is a tuple that contains the labels for each column of the data provided.

“size”- This specifies what will be used for the size of each individual marker on the plot. If the size parameter is not provided, a default size is given to all the markers. There are 3 options for the size parameter:

  • “x/y” - This specifies that size will be calculated as a ratio of the x variable data over the y variable data

  • “y/x” - This specifies that size will be calculated as a ratio of the y variable data over the x variable data

  • A Pareto variable that contains data for the size of the bubbles. The data must match the column used for grouping the data in the option “group_by”.

_images/plot_scatter_4.png

Figure 6. Options for specifying the bubbles size.

2.) A dictionary of arguments that include the title of the plot, a group by parameter, and an output file. Here is an example of the arguments:

“group_by” - This specifies what field will be used as the x axis in the plot. The column name should be used to indicate how to group the data. If “group_by” is not specified, then first column is used.

“output_file” - This parameter is used to name a file that the figure will be output to. It can be a file path such as “..\first_figure.html” or just the file name itself “first_figure.html”. There will always need to be a specified extension to the file. The accepted file extensions are as follows: .html, .png, .jpg, .jpeg, .svg, .pdf

“print_data” - The PARETO methods allow the user to specify if they want the plotted data to be printed in the console (default is False):

  • True: The dataframe used for creating the figure is printed in the console

_images/plot_scatter_2.png

Figure 7. Setting print_data to True will print out a dataframe for easy inspection.

“group_by_category” - This specifies how the color of the nodes will be assigned for easy visualization. There are 3 options:

  • True: This will cause the color of the chart markers to be grouped based on the names of the nodes. For example: PP, CP, N, R, S, K, etc will be assigned a unique color.

  • False: The data won’t be categorized by color, therefore one color will be used for the chart markers.

  • A Pareto variable containing a custom categorization. The method will recognize the variable automatically and the values in this variable will be used for assigning colors to the categories that are provided. An excel sheet should be created with all Node names, removing all duplicates, and assigning a numerical value to each specific node with the category the user would like it to be associated with. This approach is best for the situations where nodes of different types are to be categorized together.

_images/plot_scatter_3.png

Figure 8. Data used for custom categories.

Example of how this method can be used:

args = {"plot_title": "Trucked Water",
          "y_axis": "log",
          "group_by": "Origin",
          "output_file": "first_bar.html",
          "print_data": True,
          "group_by_category": df_parameters["plot_scatter_categories"]}

input_data = {"pareto_var_x": df_parameters["plot_scatter_vFPiped"],
              "pareto_var_y": df_parameters["plot_scatter_vCPiped"],
              "size": df_parameters["plot_scatter_vSize"], # 'x/y', 'y/x'
              "labels_x": [("Origin", "Destination", "Time", "Trucked Water")],
              "labels_y": [("Origin", "Destination", "Time", "Cost of Trucked Water")],
              "labels_size": [("Origin", "Destination", "Time", "Size")],
              }

plot_scatter(input_data, args)

Frequently Asked Questions

How to …

… Run examples?

PARETO project provides examples to run the operational produced water management model and the strategic produced water management model (see pareto/case_studies/). To run the examples, go to:

  • pareto/operatinal_water_management/run_operational_model.py

  • pareto/strategic_water_management/run_strategic_model.py

… Get more help?

Use the website to register for the PARETO support mailing list. Then you can send questions to pareto-support@pareto.org. For more specific technical questions, we recommend our new PARETO discussions board on Github.

Troubleshooting

Missing win32api DLL

For Python 3.8 and maybe others, you can get an error when running Jupyter on Windows 10 about missing the win32api DLL. There is a relatively easy fix:

pip uninstall pywin32
pip install pywin32==225

License Agreement

PARETO Copyright (c) 2021, by the software owners: The Regents of the University of California, through Lawrence Berkeley National Laboratory, et al. All rights reserved.

Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:

  1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.

  2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.

  3. Neither the name of the Produced Water Application for Beneficial Reuse Environmental Impact and Treatment Optimization (PARETO), University of California, Lawrence Berkeley National Laboratory, U.S. Dept. of Energy, nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.

THIS SOFTWARE S PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS “AS IS” AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES: LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

You are under no obligation whatsoever to provide any bug fixes, patches, or upgrades to the features, functionality or performance of the source code (“Enhancements”) to anyone; however, if you choose to make your Enhancements available either publicly, or directly to Lawrence Berkeley National Laboratory, without imposing a separate written license agreement for such Enhancements, then you hereby grant Lawrence Berkeley National Laboratory the following license: a non-exclusive, royalty-free perpetual license to install, use, modify, prepare derivative works, incorporate into other computer software, distribute, and sublicense such enhancements or derivative works thereof, in binary and source code form

Indices and tables