Next Article in Journal
Evaluation of a Blended Career Education Course during the COVID-19 Pandemic on Students’ Career Awareness
Next Article in Special Issue
Teaching Spatial Planning Using Elements of Design Thinking as an Example of Heuristic in Urban Planning
Previous Article in Journal
A Meta-Synthesis of Bibliometric Reviews of Research on Managing for Sustainability, 1982–2019
Previous Article in Special Issue
Behavior of Online Prosumers in Organic Product Market as Determinant of Sustainable Consumption
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Binary Linear Programming as a Tool of Cost Optimization for a Water Supply Operator

by
Przemysław Kowalik
1 and
Magdalena Rzemieniak
2,*
1
Department of Quantitative Methods in Management, Faculty of Management, Lublin University of Technology, 20-618 Lublin, Poland
2
Department of Marketing, Faculty of Management, Lublin University of Technology, 20-618 Lublin, Poland
*
Author to whom correspondence should be addressed.
Sustainability 2021, 13(6), 3470; https://doi.org/10.3390/su13063470
Submission received: 19 February 2021 / Revised: 10 March 2021 / Accepted: 17 March 2021 / Published: 21 March 2021

Abstract

:
The problem of scheduling pumps is widely discussed in the literature in the context of improving energy efficiency, production costs, emissions, and reliability. In some studies, the authors analyze the available case studies and compare the results; others present their own computational methods. In the paper, a problem of pump scheduling in regular everyday operations of a water supply operator is considered. The issues of water production optimization and energy savings are part of the topic of sustainable development. The objective of the article is the minimization of the cost of electric power used by the pumps supplying water. It is achieved thanks to the variability of both the demand for water and the price of electric power during the day combined with the possibility of storing water. The formulation of an existing electric power cost optimization problem as a binary linear programming problem was improved. An essential extension of the above mathematical model, which enables more flexible management of the pump system, was also proposed. An example containing real-world input data was successfully solved using Microsoft Excel with a free OpenSolver add-in.

1. Introduction

Supplying high-quality water at a competitive cost is a major challenge for water utilities worldwide, especially with ever-increasing water quality standards and energy prices [1,2]. Water supply systems are among the most important parts of infrastructure necessary to provide suitable quality of life for human beings. Those systems must comply with many requirements of various kinds. They must meet the demand of customers, which varies over time, be prepared for emergency increases of the demand, and provide the reliability of their (performed non-stop) operations. Moreover, operators of such systems should care about the financial aspects of their activities even if they are public-owned companies or they are subsidized because of their importance to society. In addition, minimizing costs is a part of positive action for sustainable development. For reasons of environmental responsibility, enterprises try to reuse, refurbish, and recycle used products to reduce the negative impact on the environment [3,4,5,6]. There are many kinds of costs connected with water supplies. Among them, costs of electric power make an important share of operating costs because of using many electric-powered pumps necessary to bring water from its source or sources to customers [7,8,9]. In order to optimize operational costs, smart control systems, which govern the operations of all elements in water supply systems, were developed [10,11,12,13]. In order to optimize the operation of a water pumping station itself, it is necessary to create a pump schedule for some period of time (e.g., 24 h) that states when a given pump should be turned on and, if it is controllable, with what efficiency it should work (full capacity or below). Correct optimization requires defining many necessary constraints, including taking into account the predicted demand for water, which varies throughout the day, capacities of reservoir tanks and minimal volumes of water stored in them, costs of electrical power, etc. [8,14,15,16,17,18,19,20]. Decision variables express explicitly or implicitly amounts of water that flow through parts of the systems (usually the pumps).
Pump scheduling has been a subject of study for several decades [21,22,23,24]. It mainly focuses on the optimization of operations of pumping stations considered jointly with reservoir tanks [25,26,27,28]. Various optimization methods are employed, including genetic algorithms (GA) [29,30,31,32]. Whereas early studies considered single-objective optimization, multi-objective genetic algorithms were also applied [18,33]. In [34], a review of methods useful in pump scheduling was presented, including linear and nonlinear (real-valued, integer, and mixed) programming as well as dynamic programming. The application of linear programming was also shown in [20,35,36]. It is necessary to say, however, that the abovementioned results still do not solve all the issues related to the efficient functioning of waterworks [11,12,37,38,39,40]. One of such challenging issues in decision-making performed by operators of waterworks is the large influence of uncertainty of parameters of water supply systems. The safe and efficient operation of these systems is crucial. This study does not concern uncertainty in water supply systems and prediction of water consumption, however. Instead, it focuses on the analysis of estimated volumes of water consumption in order to reduce the cost of electricity.
This paper is directly inspired by [41] in which a simple mathematical model of pump scheduling that minimizes the cost of electrical power subject to constraints regarding demand, technical parameters of the system, and the reliability regulations was presented. The model was formulated as a binary linear programming problem. In this paper, the mathematical notation of the model from [41] was improved, and a new group of optional constraints connected with limited electric power supplies is added. Next, an essential extension of the abovementioned model, which enables more flexible pump scheduling, is proposed.
An example instance in [41] was solved using MATLAB. In this paper, as an alternative tool for solving specific problems based on the model under consideration, Microsoft Excel, with its optimization features, is used. The main reason for creating this implementation is purely practical. Whereas MATLAB is advanced and very expensive software for scientific and engineering calculations, Microsoft Excel is cheaper and widely available in many companies as a part of the Microsoft Office package. This means that if a water supply operator has at least one Microsoft Office license, it can use the presented implementation at no extra software cost. Microsoft Excel turned out to be useful in optimization both in the case of the simple and the extended model.

2. Materials and Methods

The water supply system under consideration is that of a water supply operator based in a town with a population of about 25,000 inhabitants, located in Eastern Poland. The main parts of the system are wells, pumps, a reservoir tank, and the distribution pipeline network. Below there is a brief description of the most essential rules of functioning and parameters of the system. Along with proceeding with the description, a symbolic notation for parameters will be introduced.
Supplied water is groundwater pumped from 7 wells. The capacities and values of the electric power of the pumps are presented in Table 1. Water is pumped from the wells to a single reservoir tank with the capacity of V m a x = 1500 m3 (the maximal volume of stored water).
The demand for water varies over time. The outflow of water from the reservoir tank via the distribution network to customers is a continuous process. For practical reasons, predictions of demand are made for 24 one-hour timeslots. The accuracy of those predictions obviously requires using statistical methods. However, predicting the demand for water is not considered in this paper, and predicted values are just fixed-valued parameters of an optimization model without taking into account uncertainty.
Controlling the pumps must obey the following requirements. The pumps can operate with their nominal capacities only, and the amount of water pumped by any pump depends on the time of operation only. Each pump must operate for at least one hour per day. Additionally, at least one well and the pump integrated with it must be kept as a reserve at any moment of the day. The water inside the tank should be replaced at least once per day. During standard operational conditions, the volume of water in the reservoir tank cannot be less than V m i n = 523.5 m3. It is the firefighting reserve, which is kept in order to satisfy an extra demand when a fire is extinguished by using water supplied from hydrants.
In addition to the abovementioned technical and safety conditions, there is also an economical aspect of controlling the water intake system. Namely, the supplier of electric power does not use the same rate per MWh in its pricing policy all day long. Instead, it uses three tariff levels (see Table 2). Because prices of electric power may change relatively often to compare with technical parameters of the water supply system, which are constant for years, data used in the example calculations are the following (as of August 2015, PLN stands for Polish zlotys):
Various prices of electric power make efficient controlling of the pumps much more difficult because the requirements resulting from the demand levels as well as technical and safety conditions should be satisfied at the lowest cost.
As it has already been mentioned above, a basically continuous process of water distribution is approximately described in a discrete form, namely by specifying 24 predicted values of the demand for 24 one-hour times slots. Demand predictions vary depending on the day of the week, holidays, and month/season of the year. So, the example numerical data of the demand values for 24 timeslots of just one specific day are presented in Table 3 (along with corresponding electric power prices).
Analysis of the data presented so far shows that in each timeslot, each pump can either be used or not. Obviously, the time of operating each pump (expressed in hours) in a one-hour timeslot can be any non-negative value not larger than 1. However, for simplicity of the model, we assume that each pump either operates one hour during each timeslot or does not operate at all. The above approach suggests that the decision whether to use the pump j in the timeslot i can be described as a logical value (TRUE or FALSE) or numerically as a binary variable x i j . The binary variable is equal to 1 if the pump j is used in the timeslot i and is equal to 0 if it is not used. Because there are 24 timeslots and 7 pumps, then there are 24 × 7 = 168 different pairs of timeslot-pumps, and this is also the number of variables. To each of those pairs, a cost c i j of operating the pump j in the timeslot i is also assigned. Such cost parameters will be used in the final version of the cost optimization model. They are calculated from parameters already described in the following way
c i j = p i · P j 1000 · 1
where 1000 (kW/MW) is a coefficient used to change power units from kilowatts to megawatts and 1 stands for one hour (the duration of operation of the pump, which is equal to the duration of the timeslot; the coefficient is obviously not necessary from the mathematical point of view but it is added for compliance of units). For example,
c 12 = p 1 · P 2 1000 · 1 = 169   PLN MWh · 37   kW 1000   kW MW · 1   h = 169   PLN MWh · 0.037   MWh = 6.253   PLN ,
which means that using pump 2 during time slot 1 costs 6.253 PLN.
In order to create a cost optimization model, one more parameter is required. It is an initial volume of water in the reservoir tank at midnight, which is denoted by V i n i t . In the example, it is equal to 550 m3.
In case of restrictions in power supplies, limits on maximal power usage below the contracted values may be applied to some users. Then, optional parameters L i (maximal power of all the pumps operating during the timeslot i ) are introduced.
Finally, the following simple mathematical model—a binary linear programming problem—can be formulated. Its solution is an optimal schedule of the pump operation for 24 h.
Variables
  • x i j binary—if equal to 1, the pump j is operating during the timeslot i ; if equal to 0, the pump j is idle during the timeslot i ( i = 1 ,   2 , ,   24 ; j = 1 ,   2 , ,   7 )
Auxiliary variables
  • v i —volume of water in the reservoir tank after the timeslot i ends, expressed in m3 i = 1 ,   2 , ,   24
Parameters
  • c i j —cost of electric power used by the pump j operating during the timeslot i , in PLN i = 1 ,   2 , ,   24 ;   j = 1 ,   2 , ,   7
  • b j —capacity of the pump j in m3/h ( j = 1 ,   2 , ,   7 )
  • d i —predicted demand for water in the timeslot i in m3 i = 1 ,   2 , ,   24
  • V m i n —minimal allowed volume of water in the reservoir tank (firefighting reserve) in m3
  • V m a x —the capacity of the reservoir tank, i.e., the maximal volume of water that can be stored in the reservoir tank in m3
  • V i n i t —the initial volume of water in the reservoir tank at midnight in m3
  • L i —maximal power of all the pumps operating during the timeslot i , expressed in kW (optional parameters)
Optimization problem
i = 1 24 j = 1 7 c i j x i j min
The total cost of electric power used by all the pumps operating during all the timeslots all the day is minimized.
Subject to the constraints
j = 1 7 x i j 6 ,   i = 1 ,   2 , ,   24
i = 1 24 x i j 1 ,   j = 1 ,   2 , ,   7 .  
v i = j = 1 7 b j x i j + V i n i t d i ,   i = 1 v i = j = 1 7 b j x i j + v i 1 d i ,   i = 2 ,   3 , ,   24
V m i n v i V m a x ,   i = 1 ,   2 , ,   24
x i j   binary ,   i = 1 ,   2 , ,   24 ;   j = 1 ,   2 , ,   7
j = 1 7 P j x i j L i ,   i indices   of   timeslots   with   power   limits   ( optional )
The group of constraints (1) means that at most, six pumps can operate simultaneously during the same timeslot (at least one pump must be idle in the timeslot as a backup for failure incidents).
The group of constraints (2) stands for the requirement that each pump must be used at least one hour per day, which is equivalent to operating at least one timeslot per day.
The group of constraints (3) is a recursive formulation of the volume of water in the reservoir tank at the end of the timeslot i . In detail, it is the sum of the volume of water pumped by all the operating pumps in the timeslot i and the volume of water left after the end of the previous timeslot (timeslot i 1 ) minus the predicted demand for the timeslot i . For i = 1 , the initial volume V i n i t (a constant parameter) is used as the volume of water at the end instead of the analogical value for the previous timeslot.
The group of constraints (4) states the condition that the volume of water cannot be smaller than the minimal value resulting from the level of firefighting reserve and larger than the capacity of the reservoir tank.
The group of constraints (5) is a formal statement of the fact that x i j are binary variables. Those constraints are mandatory and cannot be omitted. Whereas there are linear programming problems (usually network optimization and assignment problems) in which forcing variables to be integers or, in special cases, binary is not necessary since the existence of integer/binary problems is guaranteed by the mathematical structure of the problem (see [42]), unfortunately, the considered problem does not belong to that class.
The group of constraints (6) is the only optional group in the model. It describes handling the situation of imposing power usage limits in case of limited power supplies.
To summarize, the above model of pump scheduling contains 168 variables, a linear objective function, 168 binary constraints imposed on those variables, 79 mandatory inequality linear constraints resulting from (1), (2) and (4), as well as 0 to 24 optional inequality linear constraint resulting from (6). The auxiliary variables v i are not actual variables since they are fully dependent on true variables x i j via the group of constraints (3). The reason for introducing both v i and the group of constraints (3) is the simplicity of notation that can be easily implemented in a spreadsheet.
The next step is to extend the considered model by removing a restriction of the 0–1 pump operation scheme (any pump operates during the full timeslot or it does not operate at all).
The extended model is described below. All the parameters defined earlier for the simple model remain valid, and no new parameters are required. A new group of variables is introduced.
Variables
  • x i j binary—if equal to 1, the pump j is operating during the timeslot i (during the entire timeslot, i.e., one hour or shorter); if equal to 0, the pump j is idle during the timeslot i ( i = 1 ,   2 , ,   24 ; j = 1 ,   2 , ,   7 )
  • y i j —a number from the interval [0, 1] denoting a fraction of one hour, i.e., the time during the timeslot i when the pump j operating; if equal to 0, the pump j is idle during the timeslot i ( i = 1 , 2 , ,   24 ; j = 1 ,   2 , ,   7 ) The entire model now changes to the following
    i = 1 24 j = 1 7 c i j y i j min
The total cost of electric power used by all the pumps operating during all the timeslots all the day (the entire timeslots— y i j = 1 or parts of the timeslots— y i j < 1 ) is minimized.
Subject to the constraints
j = 1 7 x i j 6 ,   i = 1 ,   2 , ,   24
i = 1 24 y i j 1 ,   j = 1 ,   2 , ,   7
v i = j = 1 7 b j y i j + V i n i t d i ,   i = 1 v i = j = 1 7 b j y i j + v i 1 d i ,   i = 2 ,   3 , ,   24
V m i n v i V m a x ,   i = 1 ,   2 , ,   24
x i j   binary ,   i = 1 ,   2 , ,   24 ;   j = 1 ,   2 , ,   7
j = 1 7 P j x L i ,   i indices   of   timeslots   with   power   limits   ( optional )
y i j 0 ,   i = 1 ,   2 , ,   24 ;   j = 1 ,   2 , ,   7
y i j x i j ,   i = 1 ,   2 , ,   24 ;   j = 1 ,   2 , ,   7
The groups of constraints (7), (10), (11) and (12) are identical to the groups of constraints (1), (4), (5) and (6), respectively.
The group of constraints (8) stands like (2) for the requirement that each pump must be used at least one hour per day. However, these constraints are no longer equivalent to operate during at least one timeslot per day but possibly to operate in shorter periods whose total duration is at least one hour.
The group of constraints (9) is the group of constraints (3) adjusted to calculate correctly the amount of water that is pumped if any pump is not operating during all the timeslot but shorter (less than one hour).
The group of constraints (13) and (14) force that each y i j is the actual time of operating the pump j during the timeslot i can be any value from 0 to 1 if the x i j is equal to 1 and is forced to be 0 otherwise.
To summarize, the extended model of pump scheduling contains 336 variables in two groups, a linear objective function of 168 variables from the second group, 168 binary constraints imposed on the variables from the first group, 415 mandatory inequality linear constraints resulting from (7), (8), (10), (13), and (14) as well as 0 to 24 optional inequality linear constraint resulting from (12). The auxiliary variables v i are used for the same reason as in the simple model, but they are fully dependent on true variables y i j , not x i j via the group of constraints (9).
The first simple model is based on the model presented in [41], but it uses clearer notation, especially in the case of the group of constraints (3). It was improved by adding optional constraints for maximal power values used by all the pumps simultaneously. The model in [41] was implemented in MATLAB for purposes of numerical solving. In this paper, optimization features of Microsoft Excel were used instead, namely a free optimization add-in OpenSolver (built-in solver turned out to fail). The extended model is implemented in Excel, too. The choice of Excel to perform the implementation of the model is motivated by the convenience of potential users of that optimization tool: employees of the water supply operator. They are more likely to be familiar with Excel than with MATLAB, but there is one more reason for the above choice, connected with the cost of software licenses. Whereas MATLAB is advanced but very expensive software for scientific and engineering calculations, Microsoft Excel is cheaper and widely available in many companies as a part of the Microsoft Office package. This means that if a water supply operator has at least one Microsoft Office license, it can use the presented implementation at no extra software cost, whereas the time of calculating an optimal solution is acceptably short. It is worth mentioning that the implementation of both models, as shown in Appendix A and Appendix B, respectively, can be considered ready-to-run. Once an Excel file with any of the two models is created, it can easily be reused by entering 25 new values into the 25 cells (24 predictions of water consumption for the 24 timeslots and V i n i t —the volume of water in the reservoir tank at midnight) and calculating a new pump schedule for the next day in a few seconds.

3. Results

The calculations were performed in Microsoft Excel 2019 with OpenSolver 2.9.0 (the latest stable version as of December 2020) add-on on an HP 250 G6 laptop with Intel Core i3-6006U 2.0 GHz processor, 8 GB RAM running on Windows 10 64 bit. The default solver engine used by OpenSolver was COIN OR CBC (linear solver).
First, the simple model was tested. Because the input data for the numerical example were identical with those in [41], the minimal cost of the electrical power used calculated for the first model was also identical and equal to 81.97 PLN (it was 81.865 rounded to 2 decimal places because 0.01 PLN is the minimal monetary unit in circulation).
The time of calculation was about 6 s. The details of the Excel implementation of the first simple model are presented in Appendix A.
The solution for the simple model obtained by Excel with OpenSolver is shown in Table 4.
Conclusions resulting from the optimal solution are listed below.
(1)
Usage of pumps is not scheduled at all during peak timeslots (with medium and high energy prices).
(2)
Pump 7 is scheduled to be used during all the timeslots with non-zero usage of pumps. It results from the fact that it has the largest capacity-to-power ratio, i.e., its capacity in m3/h divided by power in kW is the largest (5.4545 m3/h per kW). Because the cost of the power supply is the same for all the pumps, pump 7 is the most cost-efficient.
(3)
The largest usage of pumps (the number of pumps used) is scheduled right after the morning peak (peak refers to the level of power prices), i.e., between 13:00 and 14:00 (timeslot 14), when four pumps are scheduled to work simultaneously. It is caused by the coincidence between peaks in water usage and electric power usage (the latter peak is reflected by the price level 2).
Next, the numerical example was applied to the extended model. The minimal cost of the electrical power used was slightly lower, at -81.75 PLN (it was 81.74582107 before rounding).
The time of calculation was between 1 and 2 s. The details of the Excel implementation of the problem are presented in Appendix B.
The solution of the extended problem obtained by Excel with OpenSolver is shown in Table 5.
Conclusions resulting from the optimal solution are the same as in the simple model case, but also some new ones can be added:
(4)
The total cost turned out to be slightly lower (0.27%) than in the case of the simple model. It cannot be larger for any valid input data because the simple model is the worst case of the extended model.
(5)
Two timeslots turned out to be partially used: timeslot 16 by pump 4 (0.071023 h, i.e., 4 min 15.7 s) and timeslot 24 by pump 7 (0.516333 h, i.e., 30 min 58.8 s).
As to the technical aspect of calculations, it is obvious that a built-in solver cannot be considered as an appropriate tool for optimization of the pump schedule. Tests showed that the time of calculation of several minutes for the simple model is basically acceptable, but since an integer optimization is involved, even a slight change to some parameters may make it longer. Moreover, a built-in solver works near its computational limits; it can handle at most 200 variables and at most 100 formula-based constraints, i.e., different from the lower limit/upper limit/integer constraint imposed on a variable (see [43]). The abovementioned limits also make a built-in solver useless in the optimization of the extended model. For the above reasons, OpenSolver should be used instead. It can be used with Excel 2007 or later. It has no limitations of the numbers of variables and constraints imposed in Excel Solver and seems to be much faster in solving integer programming problems. What is also important, it is free (open source) software (developed in the Department of Engineering Science at the University of Auckland, New Zealand [44]). This is why using OpenSolver instead of Excel Solver will boost computational efficiency without extra cost.

4. Discussion

The safe and efficient operation of water supply systems is crucial, where digital tools, such as monitoring, hydro-informatics, and optimization algorithms, are key approaches that can play an important role in support decisions [45]. Turci, Wang, and Brahmia, based on traditional multi-population-based nature-inspired optimization algorithms, such as genetic algorithm (GA), ant colony optimization (ACO), and particle swarm optimization (PSO), adapted and improved the models to fit the complex constraints and characteristics of the system [21]. Cimorelli and others also investigated genetic algorithms to approximate solutions to optimal pump scheduling problems (OPS) [22]. Hyung, Seo Kim, and Koo used a genetic algorithm, a representative optimization technique, to develop an optimal pump operation method that enables the supply of stable water quantity and safe water quality. To propose the optimal pump operation method, the objective of minimizing the costs incurred from water intake to supply was considered, and the pump switching, the water level range of distribution reservoirs and clearwell, which should be considered in actual pump operation, were set as constraints [46]. Oh, Eom and Kim focused on pump scheduling optimization using sensors of water temperature and real-time pump efficiency monitoring. The hybrid hydraulic and thermodynamic calculation approach could provide flow rate and pump efficiency for individual pumps [25]. Muhammed and Farmani presented a fully dynamic tool that can handle four different types of fixed-speed pump schedule representations (on and off, time control, time-length control, and simple control (water levels in tanks)). The PST (Pump Scheduling Tool) has been developed using Visual Basic programming language and has a linkage between the EPANET hydraulic solver with the GANetXL optimization algorithm [26].
A successful formulation of the pump scheduling problem and its implementation in easily available optimization software obviously does not exclude further improvements and extensions. It might be, for example, modeling systems in which pumps have adjustable capacities (they can work below their nominal power) or taking into account operating below the target capacity when the pump starts and stops.

5. Conclusions

Water supply systems have a significant environmental and energetic impact due to the large amount of energy consumed in water pumping and water losses. Pump scheduling in water distribution networks is important, especially with current high energy prices. Water distribution management system is a costly practice, and with the growth of the population, the needs for creating more cost-effective solutions are vital. The presented problem shows that applying mathematical optimization methods in real-world management confronts one very important issue: those methods are usually useless for practitioners without the availability of appropriate IT support. IT support is understood here as a combination of software and hardware that allows for performing necessary calculations. Obviously, using any IT solutions cannot be conducted at no cost. Future benefits resulting from IT-supported mathematical optimization must take into account IT costs. Before proper optimization occurs, IT-related cost optimization must be conducted first. That is why implementation of a mathematical problem in the world of IT may be almost as important as a formulation of a real-world decision problem in the language of mathematics. If the optimization problem is solvable just by using hardware and software (possibly including using some new but free software) already possessed by a decision-maker, it is more advantageous than if some extra IT purchase is needed. In this paper, the goal of optimization without unnecessary IT costs in case of a pump scheduling problem of a water supply operator was achieved.

Author Contributions

Conceptualization, P.K. and M.R.; methodology, P.K.; software, P.K.; validation, P.K. and M.R.; formal analysis, P.K. and M.R.; investigation, P.K.; resources, P.K.; data curation, P.K. and M.R.; writing—original draft preparation, P.K.; writing—review and editing, P.K. and M.R..; visualization, P.K.; supervision, P.K. and M.R.; project administration, P.K.; funding acquisition, P.K. and M.R. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement.

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

Edward Kozłowski of the Lublin University of Technology, Lublin, Poland as a co-author of the cost optimization model that was an inspiration to create this paper, provided many valuable remarks about the technical aspects of the modeled decision problem.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

The relationship between the mathematical model and its Excel implementation is described below.
Variables
  • x i j —B5:J28 (initially they can be left empty)
Auxiliary variables (as mentioned in Section 2, they are not actual variables but rather symbols to simplify the notation of the problem. This is why they are implemented as formulas)
  • v 1 —M5: =SUMPRODUCT(D5:J5,D$2:J$2)+N1-B5
  • v 2 —M6: =SUMPRODUCT(D6:J6,D$2:J$2)+M5-B6
  • v 3 ,   v 4 , ,   v 24 —obtained by copying M6 to M7:M28
Parameters
  • c i j —not specified explicitly, calculated implicitly by formulas in L5:L28
  • b j —D2:J2
  • d i —B5:B28
  • V i n i t —N1
  • V m i n —N2
  • V m a x —N3
The formula for the objective function
  • i = 1 24 j = 1 7 c i j x i j —L2: =SUM(L5:L28) (because of the necessity of calculating c i j parameters, the objective function is implemented not directly as a SUMPRODUCT-based but rather as SUM of SUMPRODUCT-based formulas)
The formulas for the constraints, except for the group (3) defined as auxiliary variables above
  • j = 1 7 x 1 j 6 —L5: =SUMPRODUCT(D5:J5,D$3:J$3)*C5/1000
  • j = 1 7 x i j 6 ;   i = 2 ,   3 , ,   24 —obtained by copying L5 to L6:L28
  • i = 1 24 x i 1 1 —D30: =SUM(D5:D28)
  • i = 1 24 x i j 1 ; j = 2 ,   3 , ,   7 —obtained by copying D30 to E30:J30
Figure A1. The problem definition (the simple model) in the OpenSolver main window (OpenSolver-Model).
Figure A1. The problem definition (the simple model) in the OpenSolver main window (OpenSolver-Model).
Sustainability 13 03470 g0a1

Appendix B

The relationship between the mathematical model and its Excel implementation is described below.
Variables
  • x i j —B5:J28 (initially they can be left empty)
  • y i j —P5:V28 (initially they can be left empty)
Auxiliary variables (as mentioned in Section 2, they are not actual variables but rather symbols to simplify the notation of the problem, this is why they are implemented as formulas)
  • v 1 —M5: =SUMPRODUCT(P5:V5,D$2:J$2)+N1-B5
  • v 2 —M6: =SUMPRODUCT(P6:V6,D$2:J$2)+M5-B6
  • v 3 ,   v 4 , ,   v 24 —obtained by copying M6 to M7:M28
Parameters and the formula for the objective function are located exactly in the same cells as in Appendix A
The formulas for the constraints (except for the group (9) defined as auxiliary variables above)
  • j = 1 7 x 1 j 6 —L5: =SUMPRODUCT(P5:V5,D$3:J$3)*C5/1000
  • j = 1 7 x i j 6 ;   i = 2 ,   3 , ,   24 —obtained by copying L5 to L6:L28
  • i = 1 24 y i 1 1 —P30: =SUM(P5:P28)
  • i = 1 24 y i j 1 ; j = 2 ,   3 , ,   7 —obtained by copying P30 to Q30:V30
Figure A2. The problem definition (the extended model) in the OpenSolver main window (OpenSolver-Model).
Figure A2. The problem definition (the extended model) in the OpenSolver main window (OpenSolver-Model).
Sustainability 13 03470 g0a2

References

  1. Abdallah, M.; Kapelan, Z. Fast Pump Scheduling Method for Optimum Energy Cost and Water Quality in Water Distribution Networks with Fixed and Variable Speed Pumps. J. Water Resour. Plan. Manag. 2019, 145, 13. [Google Scholar] [CrossRef] [Green Version]
  2. Bonvin, G.; Demassey, S.; Lodi, A. Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound. Optim. Eng. 2021, 39. [Google Scholar] [CrossRef]
  3. Vrchota, J.; Pech, M.; Rolinek, L.; Bednar, J. Sustainability Outcomes of Green Processes in Relation to Industry 4.0 in Manufacturing: Systematic Review. Sustainability 2020, 12, 5968. [Google Scholar] [CrossRef]
  4. Lai, K.H.; Wong, C.W.V. Green logistics management and performance: Some empirical evidence from Chinese manufacturing exporters. Omega 2012, 40, 267–282. [Google Scholar] [CrossRef]
  5. Rajput, S.P.S.; Datta, S. Sustainable and green manufacturing? A narrative literature review. Mater. Today Proc. 2020, 26, 2515–2520. [Google Scholar] [CrossRef]
  6. Abdelmoez, W.; Ashour, E.; Naguib, S.M. A Review on Green Trend for Oil Extraction Using Subcritical Water Technology and Biodiesel Production. J. Oleo Sci. 2015, 64, 467–478. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  7. Abkenar, S.M.S.; Stanley, S.D.; Miller, C.J.; Chase, D.V.; McElmurry, S.P. Evaluation of genetic algorithms using discrete and continuous method for pump optimization of water distribution system. Sustain. Comput. Inform. Syst. 2015, 8, 18–23. [Google Scholar]
  8. Bohórques, J.; Saldarriaga, J.; Vallejo, D. Pumping pattern optimization in order to reduce WDS operation costs. Procedia Eng. 2015, 119, 1069–1077. [Google Scholar] [CrossRef] [Green Version]
  9. Alrheeh, M.; Mahmoud, H. Using Genetics Algorithms in Pump Scheduling to Reduce the Pumping Cost. Damascous Univ. J. 2009, 25, 95–105. [Google Scholar]
  10. Kosicka, E.; Kozłowski, E.; Mazurkiewicz, D. The use of stationary tests for analysis of monitored residual processes. Maint. Reliab. 2015, 17, 604–609. [Google Scholar] [CrossRef]
  11. Rojek, I.; Studziński, J. Comparison of different types of neuronal nets for failures location within water-supply networks. Maint. Reliab. 2014, 16, 42–47. [Google Scholar]
  12. Romaniuk, M. On simulation of maintenance costs for water distribution system with fuzzy parameters. Maint. Reliab. 2016, 18, 514–527. [Google Scholar] [CrossRef]
  13. Mazurkiewicz, D.; Rudawska, A. (Eds.) Inspirations for Innovation the Causes and Effects of Progress in Production Engineering; Lublin University of Technology: Lublin, Poland, 2016. [Google Scholar]
  14. Jowitt, P.W.; Germanopolous, G. Optimal pump scheduling in water-supply networks. J. Water Resour. Plan. Manag. 1992, 118, 406–422. [Google Scholar] [CrossRef]
  15. Yu, G.; Powell, R.S.; Sterling, M.J.H. Optimized pump scheduling in water distribution system. J. Optim. Theory Appl. 1994, 83, 463–488. [Google Scholar] [CrossRef]
  16. Lansey, K.E.; Awumah, K. Optimal pump operations considering pump switches. J. Water Resour. Plan. Manag. 1994, 120, 17–35. [Google Scholar] [CrossRef]
  17. Ormsbee, L.E.; Reddy, S.L. Nonlinear heuristic for pump operations. J. Water Resour. Plan. Manag. 1995, 121, 302–309. [Google Scholar] [CrossRef]
  18. Wang, J.Y.; Chang, T.P.; Chen, J.S. An enhanced genetic algorithm for bi-objective pump scheduling in water supply. Expert Syst. Appl. 2009, 36, 10249–10258. [Google Scholar] [CrossRef]
  19. Baran, B.; Lücken, C.; Sotelo, A. Multi-objective pump scheduling optimisation using evolutionary strategies. Adv. Eng. Softw. 2005, 36, 39–47. [Google Scholar] [CrossRef]
  20. Puleo, V.; Morley, M.; Freni, G.; Savić, D. Multi-stage linear programming optimization for pump scheduling. Procedia Eng. 2014, 70, 1378–1385. [Google Scholar] [CrossRef] [Green Version]
  21. Turci, L.D.; Wang, J.C.; Brahmia, I. Adaptive and Improved Multi-population Based Nature-inspired Optimization Algorithms for Water Pump Station Scheduling. Water Resour. Manag. 2020, 34, 2869–2885. [Google Scholar] [CrossRef]
  22. Cimorelli, L.; D’Aniello, A.; Cozzolino, L. Boosting Genetic Algorithm Performance in Pump Scheduling Problems with a Novel Decision-Variable Representation. J. Water Resour. Plan. Manag. 2020, 146, 11. [Google Scholar] [CrossRef]
  23. Carpitella, S.; Brentan, B.; Montalvo, I.; Izquierdo, J.; Certa, A. Multi-criteria analysis applied to multi-objective optimal pump scheduling in water systems. Water Supply 2019, 19, 2338–2346. [Google Scholar] [CrossRef] [Green Version]
  24. Fooladivanda, D.; Taylor, J.A. Energy-Optimal Pump Scheduling and Water Flow. IEEE Trans. Control Netw. Syst. 2018, 5, 1016–1026. [Google Scholar] [CrossRef]
  25. Oh, H.; Eom, J.; Kim, T. Case study of pump scheduling using sensor-based real-time pump efficiency monitoring. Desalination Water Treat. 2020, 181, 141–150. [Google Scholar] [CrossRef]
  26. Muhammed, K.A.; Farmani, R. Energy Optimization Using a Pump Scheduling Tool in Water Distribution Systems. ARO Sci. J. Koya Univ. 2020, 8, 112–123. [Google Scholar] [CrossRef]
  27. Gutierrez-Bahamondes, J.H.; Salgueiro, Y.; Mora-Melia, D.; Alsina, M.A.; Silva-Rubio, S.A.; Iglesias-Rey, P.L. Multi-objective Evolutionary Algorithms Assessment for Pump Scheduling Problems. In Proceedings of the IEEE Chilean Conference on Electrical, Electronics Engineering, Information and Communication Technologies (Chilecon), Valparaiso, Chile, 13–27 November 2019; p. 6. [Google Scholar]
  28. Turci, L.D.; Sun, H.B.; Bai, M.S.; Wang, J.C.; Hu, P. Water pump station scheduling optimization using an improved genetic algorithm approach. In Proceedings of the IEEE Congress on Evolutionary Computation (CEC), Wellington, New Zealand, 10–13 June 2019; pp. 944–951. [Google Scholar]
  29. Walters, G.A.; Savić, D.A. Recent applications of genetic algorithms to water system design. Trans. Ecol. Environ. 1996, 12. [Google Scholar] [CrossRef]
  30. Borkowski, D.; Wetula, A.; Bień, A. Design, optimization, and deployment of waterworks pumping station control system. ISA Trans. 2012, 51, 539–549. [Google Scholar] [CrossRef] [PubMed]
  31. Behandish, M.; Wu, Z.Y. Concurrent pump scheduling and storage level optimization using meta-models and evolutionary algorithms. Procedia Eng. 2014, 70, 103–112. [Google Scholar] [CrossRef] [Green Version]
  32. Niu, D.; Kuang, Z.G.; Chen, X.S.; Wei, S.; Yang, J.; Wang, X.Y. Optimizing Pump Scheduling for Water Supply through Improved Multiple Population Genetic Algorithm. In Proceedings of the 24th IEEE International Conference on Automation and Computing (ICAC ’18), Newcastle Upon Tyne, UK, 6–7 September 2018; pp. 632–637. [Google Scholar]
  33. Savić, D.A.; Walters, G.A.; Schwab, M. Multiobjective genetic algorithms for pump scheduling in water supply. Evol. Comput. Lect. Notes Comput. Sci. 1997, 1305, 227–235. [Google Scholar]
  34. Ormsbee, L.E.; Lansey, K.E. Optimal Control of Water Supply Pumping Systems. J. Water Resour. Plan. Manag. 1994, 120, 237–252. [Google Scholar] [CrossRef] [Green Version]
  35. Pasha, M.F.K.; Lansey, K. Optimal pump scheduling by linear programming. In Proceedings of the World Environmental and Water Resources Congress, Kansas City, MO, USA, 17–21 May 2009; pp. 395–404. [Google Scholar]
  36. Giacomello, C.; Kapelan, Z.; Nicolini, M. Fast Hybrid optimization method for effective pump scheduling. J. Water Resour. Plan. Manag. 2013, 139, 175–183. [Google Scholar] [CrossRef]
  37. Jasiulewicz-Kaczmarek, M. Practical aspects of the application of RCM to select optimal maintenance policy of the production line, in Safety and Reliability Methodology and Applications. In Proceedings of the European Safety and Reliability Conference, ESREL, Wroclaw, Poland, 14–18 September 2014; pp. 1187–1195. [Google Scholar]
  38. Kłos, S.; Patalas-Maliszewska, J.; Trebuna, P. Improving manufacturing processes using simulation methods. Appl. Comput. Sci. 2016, 12, 42–53. [Google Scholar]
  39. Loska, A. Methodology of variant assessment of exploitation policy using numerical taxonomy tools. Manag. Syst. Prod. Eng. 2015, 2, 98–104. [Google Scholar]
  40. Valis, D.; Pietrucha-Urbanik, K. Utilization of diffusion processes and fuzzy logic for vulnerability assessment. Maint. Reliab. 2014, 16, 48–55. [Google Scholar]
  41. Kozłowski, E.; Mazurkiewicz, D.; Kowalska, B.; Kowalski, D. Binary Linear Programming as a Decision-Making Aid for Water Intake Operators, Proceedings of the Intelligent Systems Production, Engineering and Maintenance (ISPEM 2017), Wroclaw, Poland, 28–29 September 2017; Burduk, A., Mazurkiewicz, D., Eds.; Springer: Berlin/Heidelberg, Germany, 2018; pp. 199–208. [Google Scholar] [CrossRef]
  42. Walukiewicz, S. Integer Programming; PWN: Warsaw, Poland, 1991; pp. 60–61. [Google Scholar]
  43. Standard Excel Solver - Dealing with Problem Size Limits—Continued. Available online: https://www.solver.com/standard-excel-solver-dealing-problem-size-limits-continued (accessed on 3 December 2020).
  44. Mason, A.J. OpenSolver—An Open Source Add-in to Solve Linear and Integer Progammes in Excel. In Operations Research Proceedings 2011, Proceedings of the International Conference on Operations Research, Zurich, Switzerland, August 30–2 September 2011; Klatte, D., Lüthi, H.-J., Schmedders, K., Eds.; Springer: Berlin/Heidelberg, Germany, 2012; pp. 401–406. [Google Scholar] [CrossRef]
  45. Luna, T.; Ribau, J.; Figueiredo, D.; Alves, R. Improving energy efficiency in water supply systems with pump scheduling optimization. J. Clean. Prod. 2019, 213, 342–356. [Google Scholar] [CrossRef]
  46. Hyung, J.; Seo, J.; Kim, K.; Kim, T.; Koo, J. Optimal water intake and supply pump scheduling considering water quality safety in multiple water intake system. Desalination Water Treat. 2020, 182, 49–60. [Google Scholar] [CrossRef]
Table 1. Parameters of the pumps.
Table 1. Parameters of the pumps.
Number of Well
( j )
Capacity (m3/h)
( b j )
Power (kW)
( P j )
17515
213337
315733
417633
55922
66933
712022
Table 2. Three tariff levels.
Table 2. Three tariff levels.
Level 1 (Afternoon/Evening peak) 16:00–21:00
[PLN/MWh]
Level 2 (Morning Peak) 7:00–13:00
[PLN/MWh]
Level 3 (Off-Peak) 0:00–7:00, 13:00–16:00, 21:00–24:00
[PLN/MWh]
336.00283.00169.00
Table 3. Demand values and electric power prices (data valid for 1 August 2015).
Table 3. Demand values and electric power prices (data valid for 1 August 2015).
Number of Timeslot
( i )
Demand per Timeslot (m3)
( d i )
Power Price (PLN/MWh)
( p i )
144.62169
231.27169
326.22169
427.51169
531.50169
646.18169
769.47169
8100.36283
9131.85283
10148.51283
11149.89283
12142.21283
13132.09283
14129.29169
15124.06169
16114.68169
17109.33336
18115.76336
19126.95336
20131.48336
21138.86336
22131.91169
23111.53169
24 70.43169
Table 4. Optimal pumping schedule for the simple model.
Table 4. Optimal pumping schedule for the simple model.
Timeslot
Number
Pumps
P1P2P3P4P5P6P7
10000001
20001001
30001001
40000001
50000001
60000001
70000001
80000000
90000000
100000000
110000000
120000000
130000000
141100101
151000001
160010001
170000000
180000000
190000000
200000000
210000000
220000011
230000001
240000000
Table 5. Optimal pumping schedule for the extended model.
Table 5. Optimal pumping schedule for the extended model.
Timeslot
Number
Pumps
P1P2P3P4P5P6P7
10100001
20000001
30000001
40000101
50000001
60001001
70000001
80000000
90000000
100000000
110000000
120000000
130000000
140011001
150000001
161000.071023011
170000000
180000000
190000000
200000000
210000000
220000001
230000001
240000000.516333
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Kowalik, P.; Rzemieniak, M. Binary Linear Programming as a Tool of Cost Optimization for a Water Supply Operator. Sustainability 2021, 13, 3470. https://doi.org/10.3390/su13063470

AMA Style

Kowalik P, Rzemieniak M. Binary Linear Programming as a Tool of Cost Optimization for a Water Supply Operator. Sustainability. 2021; 13(6):3470. https://doi.org/10.3390/su13063470

Chicago/Turabian Style

Kowalik, Przemysław, and Magdalena Rzemieniak. 2021. "Binary Linear Programming as a Tool of Cost Optimization for a Water Supply Operator" Sustainability 13, no. 6: 3470. https://doi.org/10.3390/su13063470

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop