# Modeling and Optimization of Water Distribution in Mineral Processing considering Water Cost and Recycled Water

Authors: He Wang; Qiuyu Cui; Hualong Du
Journal: Computational Intelligence and Neuroscience
 (2022)

---

## Abstract

Reducing mineral processing water costs and freshwater consumption is a challenging task in the mineral processing water distribution (MPWD). The work presented in this paper focuses on two aspects of the MPWD optimization model and the MPWD optimization method. To achieve MPWD optimization effectively, a nonlinear constrained multiobjective model is built. The problem is formulated with two objectives of minimizing the mineral processing water costs and maximizing the amount of recycled water. In this paper, an optimization method named enhancing the multiobjective artificial bee colony (EMOABC) algorithm is proposed to solve this model. The EMOABC algorithm uses four strategies to obtain the Pareto-optimal solutions and to achieve the MPWD optimal solutions. With the three benchmark functions, the EMOABC algorithm outperforms the other two widely used algorithms in solving complex multiobjective optimization problems. The EMOABC algorithm is then applied to two cases. Results have shown that the proposed algorithm has the ability to solve the MPWD optimization model. The developed model and the proposed algorithm provide decision support for the actual MPWD problem.


---

## Body

## 1. Introduction

Mineral processing is the process of obtaining the raw materials for smelting and consumes large amounts of water. For water distribution, the decision-makers in mineral processing plants need to make decisions concerning different objectives, such as water costs and freshwater minimization, to maximize the comprehensive benefits of mineral processing plants. The solution to the multiobjective optimization problem often results from both an optimization model and an optimization algorithm. Thus, this paper focuses on solving mineral processing water distribution (MPWD) optimization problems from these two perspectives.Over the years, many works have examined the water distribution optimization problem and presented many mathematical models and conventional methods such as linear programming [1, 2], nonlinear programming [3], and integer linear programming [4], which have been applied to solve the problem. However, these methods suffer from severe limitations in handling discreteness, nonlinearity, complex constraints, and local convergence [5]. To overcome the limitations of classical optimization methods, the heuristic methods have been proposed to solve water distribution optimization, such as simulated annealing (SA) algorithms [6, 7], genetic algorithms (GA) [5, 8, 9], differential evolution (DE) algorithms [10–12], particle swarm optimization (PSO) [13–15], ant colony optimization (ACO) [16–18], strength Pareto evolutionary algorithm (SPEA) [19], and shuffled frog leaping algorithm (SFLA) [20, 21]. Despite the success of these heuristic methods in certain aspects, they have not been applied to solve MPWD problems. Currently, MPWD problems are mainly based on manual scheduling. Therefore, building MPWD model and applying heuristic methods to solve the model represent an important issue of our current concern.Heuristic methods have been widely used in various fields [22–25]. The artificial bee colony (ABC) algorithm is a relatively new heuristic method that has been proven to be an excellent competitor in multiobjective problems [26]. Several multiobjective ABC algorithms (MOABCs) have been proposed for multiobjective problems [27–29]. However, compared to the huge in-depth studies of other heuristic methods, such as nondominated sorting genetic algorithm II (NSGA-II) [30] and multiobjective particle swarm optimization (MOPSO) [31], on multiobjective problems, improving the performance of MOABCs is still a challenge.MPWD is a complex process in which interrelated factors are multiple. In addition to meeting the total amount of mineral processing water, many factors, such as the flow of the water source, the pressure of the water source, and maximizing the use of recycled water, need to be considered. The traditional linear model is difficult to describe the relationship between these complex factors for MPWD with the above characteristics and cannot treat multiple constraints appropriately.The purpose of this paper is to build a nonlinear and multiobjective model for MPWD and to develop an MOABC algorithm for solving the MPWD optimization problem. The MPWD optimization model has two objectives: one objective is to minimize mineral processing water costs, and the other objective is to maximize the amount of recycled water. The proposed MOABC algorithm called enhancing multiobjective artificial bee colony (EMOABC) algorithm integrated multiple strategies to improve its performance. Therefore, some of the contributions of this paper are as follows:(1)
The developed model for MPWD is the nonlinear model that has two objective functions(2)
The proposed EMOABC algorithm can improve the population diversity and obtain better global convergenceThe rest of the paper is organized as follows: In Section2, the MPWD optimization model is built. Section 3 first gives a review of the basic ABC algorithm and then proposes the EMOABC and presents the results of the EMOABC algorithm compared with other algorithms on three widely used benchmark functions. In Section 4, the implementation of the EMOABC on the MPWD optimization problem is presented. Section 5 outlines the conclusions.


## 2. MPWD Model

According to categories of water source, the mineral processing water can be divided into fresh water，tailings water, clean water, and in-plant water, and they are from rivers and lakes, tailings reservoirs, wastewater treatment plants, and in-plant recycled systems, respectively (Figure1). The cost of using the tailings water, the clean water, and in-plant water is relatively high for proper treatment and long-distance transmission before entering into the mineral processing plant. Although the cost of using fresh water is very low due to no treatment required, it is important to minimize the use of fresh water for environmental reasons. Mineral processing water becomes wastewater after mineral processing. The MPWD problem in this paper is to optimize two competing objective functions simultaneously, minimizing the mineral processing costs and maximizing the amount of recycled water including tailings water, clean water, and in-plant water, while satisfying several equality and inequality constraints. Generally, the problem is formulated as follows.Figure 1
The composition of water source in the mineral processing plant.


### 2.1. Decision Variable

The vector of the mineral processing water is expressed asQ, including the freshwater as Q1, tailings water as Q2, clean water as Q3, and in-plant water as Q4. The mineral processing water except freshwater is called the recycled water. The vector of the recycled water is expressed as Q′=Q′|Q2∪Q3∪Q4. qi is a flow of the ith water source; a, b, c, and n are positive integers, and n is the number of water sources. Decision variables are defined as follows:(1)Q=q1,q2,…,qn,Q1=q1,q2,…,qa,Q2=qa+1,qa+2,…,qb,Q3=qb+1,qb+2,…,qc,Q4=qc+1,qc+2,…,qn.


### 2.2. Objective Function

Letci be the cost coefficient of the ith water source; its meaning is the total power consumption required to lift one meter per unit volume of water. Then the mineral processing water costs in a certain hour are expressed as(2)CQ=∑i=1nciqi100pi+hi,where hi is the elevation difference of the ith water source; the integer 100 is used for unit conversion. pi is the pressure of the ith water source. Equation (2) also can be transformed into(3)CQ=∑i=1nciqi100fqsum,qi,qiqj+hi,where fqsum,qi,qiqj is the macro model of the water supply network. This qsum is the total flow of mineral processing water required in the mineral processing plant.The yields of freshwater are low, but its prices are high. So it is important for cost reduction that the recycled water is used in mineral processing. While the total water consumption of mineral processing is met, the recycled water should be used in mineral processing as much as possible. The amount of the recycled water used in mineral processing can be expressed as(4)MQ′=Mqa+1,qa+2,⋯,qn=∑i=a+1bαiqi+∑i=b+1cβiqi+∑i=c+1nχiqi,where α is the penalty factor of tailings water; β is the penalty factor of clean water; and χ is the penalty factor of in-plant water.


### 2.3. Constraint Condition

The sum of the flow from the water source should be equal to the total flow of mineral processing water required in mineral processing:(5)∑i=1nqi=qsum.Each water source should be between the maximum and minimum water supply capacity:(6)qimin≤qi≤qimaxi=1,2,⋯,n,where qimax and qimin are upper and lower limits for the flow of the ith water source.To ensure efficient transmission, the output pressure of each water source should be restricted as follows:(7)pimin≤pi≤pimaxi=1,2,⋯,n,where pimax and pimin are upper and lower limits for the pressure of the ith water source. Equation (7) also can be transformed into(8)pimin≤fqsum,qi,qiqj≤pimaxi=1,2,⋯,n.To ensure the pressure requirements of the mineral processing plant, there should be a lower limit for the pressure at the control point.(9)cpi≥cpimini=1,2,⋯,n,where cpi is the pressure at the control point of the ith water source; cpimin is lower limit for the pressure at the control point of the ith water source. Equation (9) also can be transformed into(10)f′qsum,qi≥cpimin,i=1,2,…,n,where f′qsum,qi is the macro model of the pressure control point.


### 2.4. Final Model

In summary, the water optimization model for the mineral processing plant is a two-objective optimization model and its final model is expressed as follows:(11)minCQ,maxMQ′,s.t.∑i=1nq1=qsum,qimin≤fi≤qimax,i=1,2,…,n,pimin≤fqsum,qi,qiqj≤pimax,i=1,2,…,n,f′qsum,qi≤cpimin,i=1,2,…,n.


## 2.1. Decision Variable

The vector of the mineral processing water is expressed asQ, including the freshwater as Q1, tailings water as Q2, clean water as Q3, and in-plant water as Q4. The mineral processing water except freshwater is called the recycled water. The vector of the recycled water is expressed as Q′=Q′|Q2∪Q3∪Q4. qi is a flow of the ith water source; a, b, c, and n are positive integers, and n is the number of water sources. Decision variables are defined as follows:(1)Q=q1,q2,…,qn,Q1=q1,q2,…,qa,Q2=qa+1,qa+2,…,qb,Q3=qb+1,qb+2,…,qc,Q4=qc+1,qc+2,…,qn.


## 2.2. Objective Function

Letci be the cost coefficient of the ith water source; its meaning is the total power consumption required to lift one meter per unit volume of water. Then the mineral processing water costs in a certain hour are expressed as(2)CQ=∑i=1nciqi100pi+hi,where hi is the elevation difference of the ith water source; the integer 100 is used for unit conversion. pi is the pressure of the ith water source. Equation (2) also can be transformed into(3)CQ=∑i=1nciqi100fqsum,qi,qiqj+hi,where fqsum,qi,qiqj is the macro model of the water supply network. This qsum is the total flow of mineral processing water required in the mineral processing plant.The yields of freshwater are low, but its prices are high. So it is important for cost reduction that the recycled water is used in mineral processing. While the total water consumption of mineral processing is met, the recycled water should be used in mineral processing as much as possible. The amount of the recycled water used in mineral processing can be expressed as(4)MQ′=Mqa+1,qa+2,⋯,qn=∑i=a+1bαiqi+∑i=b+1cβiqi+∑i=c+1nχiqi,where α is the penalty factor of tailings water; β is the penalty factor of clean water; and χ is the penalty factor of in-plant water.


## 2.3. Constraint Condition

The sum of the flow from the water source should be equal to the total flow of mineral processing water required in mineral processing:(5)∑i=1nqi=qsum.Each water source should be between the maximum and minimum water supply capacity:(6)qimin≤qi≤qimaxi=1,2,⋯,n,where qimax and qimin are upper and lower limits for the flow of the ith water source.To ensure efficient transmission, the output pressure of each water source should be restricted as follows:(7)pimin≤pi≤pimaxi=1,2,⋯,n,where pimax and pimin are upper and lower limits for the pressure of the ith water source. Equation (7) also can be transformed into(8)pimin≤fqsum,qi,qiqj≤pimaxi=1,2,⋯,n.To ensure the pressure requirements of the mineral processing plant, there should be a lower limit for the pressure at the control point.(9)cpi≥cpimini=1,2,⋯,n,where cpi is the pressure at the control point of the ith water source; cpimin is lower limit for the pressure at the control point of the ith water source. Equation (9) also can be transformed into(10)f′qsum,qi≥cpimin,i=1,2,…,n,where f′qsum,qi is the macro model of the pressure control point.


## 2.4. Final Model

In summary, the water optimization model for the mineral processing plant is a two-objective optimization model and its final model is expressed as follows:(11)minCQ,maxMQ′,s.t.∑i=1nq1=qsum,qimin≤fi≤qimax,i=1,2,…,n,pimin≤fqsum,qi,qiqj≤pimax,i=1,2,…,n,f′qsum,qi≤cpimin,i=1,2,…,n.


## 3. Enhancing Multiobjective Artificial Bee Colony Algorithm

With the above model and constraints, the appropriate optimization algorithm is applied to optimize the MPWD problem. In this study, an EMOABC algorithm was proposed to solve the developed MPWD model.


### 3.1. Basic ABC Algorithm

ABC algorithm is a swarm intelligence optimization method proposed by Karaboga to simulate the process of bees searching for nectar [32]. In the framework of the artificial bee colony algorithm, the location of the food source represents the possible candidate solutions of the problem to be optimized, the number of nectars in the food source represents the fitness (objective function value) corresponding to the candidate solutions, and the size of the bee colony is equal to the number of solutions. The basic structure of the ABC algorithm can be divided into the four following stages.The first is initial stage, where ABC algorithm randomly generates a matrixX = [xij]N×D, N is the population size and represents the number of candidate solutions, and D is the number of solution parameters, i ∈ (1, 2, …, N), j ∈ (1, 2, …, D). D-dimensional vector Xi = [xi1, xi2, …, xiD] is one of the candidate solutions. xij are randomly generated by(12)xij=xjmin+randjxjmax−xjmin,where xjmax and xjmin are the upper and lower bound constraints of the jth variable of Xi, respectively, and rand j is a uniformly distributed random number within the range [0, 1].The second is employed bee stage, where an employed bee is to modify and generate a new candidate solution based on the currently collected information, as well as to calculate its fitness. If the fitness of the new candidate solution is higher than the fitness of the original candidate solution, the new candidate solution replaces the original candidate solution; otherwise, the original candidate solution is retained. After all employed bees complete the search task, they share the information on the location of the food source (candidate solution) and the amount of nectar (fitness) they found with onlooker bees. The new candidate solution is generated by(13)vij=xij+φijxij−xkj,where k and j are randomly chosen indexes, k ≠ i. φij is a random number in the range [−1, 1]. The fitness of a solution can be defined as(14)fitXi=11+fXi,iffXi>0,1+fXi,iffXi≤0.The third is onlooker bee stage, where onlooker bees assess the fitness of candidate solutions passed from the employed bee and then select food sources based on the probability corresponding to the amount of nectar. In this case, the onlooker bee updates the candidate solution based on the original candidate solution and calculates its fitness; if the fitness of the new candidate solution is higher than the original candidate solution, the new candidate solution replaces the original candidate solution; otherwise, the original candidate solution is retained. The probability of a food source chosen by an onlooker bee can be calculated by(15)pi=fitXi∑i=1NfitXi.The fourth is scout bee stage; if the nectar of the discovered food source is too inferior to find better solutions several times in a row (“limit” is denoted as the maximum number of times), it will be replaced by a new food source that a scout bee randomly found, and then the new food source is generated by (12).


### 3.2. Proposed Method

This section presents a detailed description of the proposed EMOABC algorithm. It can be observed from the literature that this approach to mineral processing water has not yet been extensively explored.Inspired by the idea of NSGA-II algorithm [30] and DNSPSO algorithm [33], in this paper, the EMOABC is integrated with a series of multiobjective optimization strategies. It includes four important multiobjective strategies: noninferior ranking strategy, Pareto-optimal strategy, crowding distance strategy, and search strategy to evaluate the food source location multiobjectively and select the nondominated solution, so they are presented as follows:(1)
Noninferior ranking strategy: all individuals in the population that are not dominated by other solutions (noninferior solutions) are defined as rank 1; that is, the virtual fitness of the individual is 1; then these individuals are removed from the population, and new noninferior solutions are identified from the remaining individuals, which are defined as rank 2; that is, the virtual fitness of the individual is 2; the above process is repeated until all individuals in the population have been assigned the corresponding rank. By storing the current solution and all the individuals in the population in a hierarchical manner, the high-performance individuals can have a higher probability of survival and the population rank can be improved rapidly.(2)
Pareto-optimal strategy: the Pareto set is multiple viable solutions, which can provide multiple viable solutions in the supply of water to the mineral processing plant and can also reduce supply efficiency. Manual Pareto selection suffers from a variety of subjective uncertainties, which can make the selected solution less than optimal.Define a functionηi, representing the proportion of the ith objective function value of a solution in the Pareto set that is located along the direction of that objective function in front of the Pareto. The function ηi is expressed as(16)ηi=1,Vi≤ViminVimax−ViVimax−Vimin,Vimin≤Vi≤Vimax0,Vi≥Vimax,whereVimax and Vimin are the maximum and minimum values of the ith objective function in the Pareto set, respectively; Vi is the function value of the ith objective function. For each noninferior solution k, the normalized membership function ƞk is calculated by the following equation:(17)ηk=∑i=1Nobηik∑j=1M∑i=1Nobηij,whereM is the number of noninferior solutions in the Pareto set, and Nob is the number of objective functions. The larger the value of ƞk, the better the performance of k in coordinating multiple objective functions. Sorting the Pareto set by the ƞk value gives a priority sequence of noninferior solutions.(3)
Crowding distance strategy: the crowding distance is used to estimate how dense a solution is with other solutions around it. For each objective function, the set of noninferior solutions is sorted by the objective function value; then, for each solutionx, the sum of the two sides of the rectangle formed by the solutions x + 1 and x − 1 is calculated; the final result is the crowding distance xdist of the solution x. The crowding distance of the boundary solution is infinite. When two solutions have the same rank (i.e., the same virtual fitness), the superiority of the two solutions can be compared by the crowding distance. It can be seen that x individual is superior to y individual when and only when xrank < yrank or xrank = yrank and xdist > ydist.(4)
Search strategy: as one of the most representative variants, DNSPSO algorithm is characterized by introducing a global NS operator [33]. Therefore, the search strategy in this paper also adds that operator, and it can be expressed as follows:(18)vij=r1xij+r2xbest+r3xaj−xbj,wherer1, r2, and r3 are three mutually exclusive numbers which are randomly chosen from (0, 1), and they have to meet another condition: r1 + r2 + r3 = 1; xbest is the global best solution of the entire population; the indices a and b are mutually exclusive integers randomly chosen from (1, 2, …, N), and they are different from the base index i. It is necessary to point out that r1, r2, and r3 are generated anew in each generation, but they are kept the same for all dimensions in each generation. Once the trial solution is generated, its associated food source has to compete with it for entering the next generation. It implies that the one with a better fitness value has the chance to survive.Combining the above multiobjective strategies and the ABC algorithm, the basic flow of the EMOABC algorithm is shown in the following:Step 1: set the number of solution parameters (D), the number of populations (N), the maximum number of cycles (MNC), and “limit” value; randomly generate candidate solutions (X = [xij]N×D).Step 2: calculate the fitness of each objective function, noninferior rank, and the crowding distance.Step 3: randomly select two solutions and choose the better storage solution. In this way,N/2 better solutions are selected.Step 4: search in the manner of equation (10) to produce N/2 solution, and if there is a solution beyond the boundary, it is placed on the boundary.Step 5: identify the betterN solutions from the population of steps 3 and 4 according to noninferior rank and the crowding distance.Step 6: generateN new solutions by equation (15), and if there are any solutions beyond the boundary, they are placed on the tenth boundary.Step 7: select the betterN solutions to form a new population according to noninferior rank and the crowding distance from the solutions in steps 1, 3, and 6.Step 8: determine if the termination condition is met; if so, output the Pareto front; otherwise, go to step 2.Step 9: arrange all solutions in the Pareto-optimal set, using equations (13) and (14), and then export a priority list of solutions.


### 3.3. Performance of the Proposed Algorithm

To verify the effectiveness of the EMOABC proposed in this paper, its performance is compared with those of NSGA-II and MOPSO. Convergence and diversity are usually chosen as evaluation criteria, and their specific mathematical expressions can be found in the literature [30, 31]. To ensure the fairness of algorithm testing, the size of the initial population N is set to 60 and the maximum number of cycles is 1000 for all algorithms on each test function. To achieve the best performance of the other two algorithms, their control parameters were set using the recommended values from the corresponding original literature. For EMOABC, the limit was set to 0.6 × D × N. To avoid the adverse effect of randomness on algorithm evaluation, each algorithm was run 30 times independently, and the mean value and the standard deviation of convergence and diversity were calculated, and the results of each algorithm for three benchmark functions ZDT1, ZDT2, and ZDT3 are shown in Table 1. Detailed expressions of ZDT1, ZDT2, and ZDT3 can be found in the literature [30]. Three algorithms have been run in MATLAB R2020a on a personal computer with Core 2 Duo 2.13 GHz processor and 4 GB memory.Table 1
The comparable results between EMOABC, NSGA-II, and MOPSO.
CriteriaAlgorithmZDT1ZDT2ZDT3ConvergenceEMOABCMean3.6239e − 32.3514e − 22.2485e − 22.6594e − 16.3256e − 22.6585e − 3StdNSGA-IIMean3.9635e − 32.6985e − 22.9651e − 22.9985e − 15.5883e − 21.4154e − 3StdMOPSOMean4.1265e − 33.6517e − 22.8654e − 23.9914e − 17.9562e − 23.1953e − 3StdDiversityEMOABCMean6.6263e − 35.6156e − 23.6989e − 2Std4.5696e − 44.2654e − 32.5359e − 3NSGA-IIMean3.3659e − 23.4889e − 13.7569e − 1Std5.6387e − 23.1245e − 13.1245e − 2MOPSOMean6.9159e − 27.6385e − 24.7646e − 1Std5.4512e − 26.2589e − 33.6632e − 2From Table1, the best values have been marked in bold. In terms of diversity, compared to other algorithms, the EMOABC algorithm obtained the most uniform Pareto front for each test problem with good distribution characteristics, indicating that the EMOABC algorithm has obvious advantages in distribution characteristics; in terms of convergence, for the ZDT3 problem, the EMOABC algorithm performs slightly worse than the NSGA-II algorithm but better than the MOPSO algorithm. Besides, the standard deviations of convergence and diversity obtained by the EMOABC algorithm are small, indicating that this algorithm is more stable and can almost always converge to the optimal nondominated frontier within the maximum number of cycles, which proves the effectiveness of the EMOABC algorithm to obtain a wider, uniform, and realistic Pareto solution set frontier.Table1 cannot completely reflect the results obtained by three algorithms; for this reason, and Figure 2 shows the noninferior optimal solution sets of three benchmark functions obtained by three algorithms.Figure 2
The comparable Pareto front obtained by three algorithms.As can be seen in Figure2, the Pareto-optimal solutions of the EMOABC algorithm on ZDT1–3 can approximate the theoretical Pareto-optimal solution of each function very well, which has especially a good distribution. This experimental result once again verifies the effectiveness and advancement of the EMOABC algorithm for the multiobjective optimization problem.


## 3.1. Basic ABC Algorithm

ABC algorithm is a swarm intelligence optimization method proposed by Karaboga to simulate the process of bees searching for nectar [32]. In the framework of the artificial bee colony algorithm, the location of the food source represents the possible candidate solutions of the problem to be optimized, the number of nectars in the food source represents the fitness (objective function value) corresponding to the candidate solutions, and the size of the bee colony is equal to the number of solutions. The basic structure of the ABC algorithm can be divided into the four following stages.The first is initial stage, where ABC algorithm randomly generates a matrixX = [xij]N×D, N is the population size and represents the number of candidate solutions, and D is the number of solution parameters, i ∈ (1, 2, …, N), j ∈ (1, 2, …, D). D-dimensional vector Xi = [xi1, xi2, …, xiD] is one of the candidate solutions. xij are randomly generated by(12)xij=xjmin+randjxjmax−xjmin,where xjmax and xjmin are the upper and lower bound constraints of the jth variable of Xi, respectively, and rand j is a uniformly distributed random number within the range [0, 1].The second is employed bee stage, where an employed bee is to modify and generate a new candidate solution based on the currently collected information, as well as to calculate its fitness. If the fitness of the new candidate solution is higher than the fitness of the original candidate solution, the new candidate solution replaces the original candidate solution; otherwise, the original candidate solution is retained. After all employed bees complete the search task, they share the information on the location of the food source (candidate solution) and the amount of nectar (fitness) they found with onlooker bees. The new candidate solution is generated by(13)vij=xij+φijxij−xkj,where k and j are randomly chosen indexes, k ≠ i. φij is a random number in the range [−1, 1]. The fitness of a solution can be defined as(14)fitXi=11+fXi,iffXi>0,1+fXi,iffXi≤0.The third is onlooker bee stage, where onlooker bees assess the fitness of candidate solutions passed from the employed bee and then select food sources based on the probability corresponding to the amount of nectar. In this case, the onlooker bee updates the candidate solution based on the original candidate solution and calculates its fitness; if the fitness of the new candidate solution is higher than the original candidate solution, the new candidate solution replaces the original candidate solution; otherwise, the original candidate solution is retained. The probability of a food source chosen by an onlooker bee can be calculated by(15)pi=fitXi∑i=1NfitXi.The fourth is scout bee stage; if the nectar of the discovered food source is too inferior to find better solutions several times in a row (“limit” is denoted as the maximum number of times), it will be replaced by a new food source that a scout bee randomly found, and then the new food source is generated by (12).


## 3.2. Proposed Method

This section presents a detailed description of the proposed EMOABC algorithm. It can be observed from the literature that this approach to mineral processing water has not yet been extensively explored.Inspired by the idea of NSGA-II algorithm [30] and DNSPSO algorithm [33], in this paper, the EMOABC is integrated with a series of multiobjective optimization strategies. It includes four important multiobjective strategies: noninferior ranking strategy, Pareto-optimal strategy, crowding distance strategy, and search strategy to evaluate the food source location multiobjectively and select the nondominated solution, so they are presented as follows:(1)
Noninferior ranking strategy: all individuals in the population that are not dominated by other solutions (noninferior solutions) are defined as rank 1; that is, the virtual fitness of the individual is 1; then these individuals are removed from the population, and new noninferior solutions are identified from the remaining individuals, which are defined as rank 2; that is, the virtual fitness of the individual is 2; the above process is repeated until all individuals in the population have been assigned the corresponding rank. By storing the current solution and all the individuals in the population in a hierarchical manner, the high-performance individuals can have a higher probability of survival and the population rank can be improved rapidly.(2)
Pareto-optimal strategy: the Pareto set is multiple viable solutions, which can provide multiple viable solutions in the supply of water to the mineral processing plant and can also reduce supply efficiency. Manual Pareto selection suffers from a variety of subjective uncertainties, which can make the selected solution less than optimal.Define a functionηi, representing the proportion of the ith objective function value of a solution in the Pareto set that is located along the direction of that objective function in front of the Pareto. The function ηi is expressed as(16)ηi=1,Vi≤ViminVimax−ViVimax−Vimin,Vimin≤Vi≤Vimax0,Vi≥Vimax,whereVimax and Vimin are the maximum and minimum values of the ith objective function in the Pareto set, respectively; Vi is the function value of the ith objective function. For each noninferior solution k, the normalized membership function ƞk is calculated by the following equation:(17)ηk=∑i=1Nobηik∑j=1M∑i=1Nobηij,whereM is the number of noninferior solutions in the Pareto set, and Nob is the number of objective functions. The larger the value of ƞk, the better the performance of k in coordinating multiple objective functions. Sorting the Pareto set by the ƞk value gives a priority sequence of noninferior solutions.(3)
Crowding distance strategy: the crowding distance is used to estimate how dense a solution is with other solutions around it. For each objective function, the set of noninferior solutions is sorted by the objective function value; then, for each solutionx, the sum of the two sides of the rectangle formed by the solutions x + 1 and x − 1 is calculated; the final result is the crowding distance xdist of the solution x. The crowding distance of the boundary solution is infinite. When two solutions have the same rank (i.e., the same virtual fitness), the superiority of the two solutions can be compared by the crowding distance. It can be seen that x individual is superior to y individual when and only when xrank < yrank or xrank = yrank and xdist > ydist.(4)
Search strategy: as one of the most representative variants, DNSPSO algorithm is characterized by introducing a global NS operator [33]. Therefore, the search strategy in this paper also adds that operator, and it can be expressed as follows:(18)vij=r1xij+r2xbest+r3xaj−xbj,wherer1, r2, and r3 are three mutually exclusive numbers which are randomly chosen from (0, 1), and they have to meet another condition: r1 + r2 + r3 = 1; xbest is the global best solution of the entire population; the indices a and b are mutually exclusive integers randomly chosen from (1, 2, …, N), and they are different from the base index i. It is necessary to point out that r1, r2, and r3 are generated anew in each generation, but they are kept the same for all dimensions in each generation. Once the trial solution is generated, its associated food source has to compete with it for entering the next generation. It implies that the one with a better fitness value has the chance to survive.Combining the above multiobjective strategies and the ABC algorithm, the basic flow of the EMOABC algorithm is shown in the following:Step 1: set the number of solution parameters (D), the number of populations (N), the maximum number of cycles (MNC), and “limit” value; randomly generate candidate solutions (X = [xij]N×D).Step 2: calculate the fitness of each objective function, noninferior rank, and the crowding distance.Step 3: randomly select two solutions and choose the better storage solution. In this way,N/2 better solutions are selected.Step 4: search in the manner of equation (10) to produce N/2 solution, and if there is a solution beyond the boundary, it is placed on the boundary.Step 5: identify the betterN solutions from the population of steps 3 and 4 according to noninferior rank and the crowding distance.Step 6: generateN new solutions by equation (15), and if there are any solutions beyond the boundary, they are placed on the tenth boundary.Step 7: select the betterN solutions to form a new population according to noninferior rank and the crowding distance from the solutions in steps 1, 3, and 6.Step 8: determine if the termination condition is met; if so, output the Pareto front; otherwise, go to step 2.Step 9: arrange all solutions in the Pareto-optimal set, using equations (13) and (14), and then export a priority list of solutions.


## 3.3. Performance of the Proposed Algorithm

To verify the effectiveness of the EMOABC proposed in this paper, its performance is compared with those of NSGA-II and MOPSO. Convergence and diversity are usually chosen as evaluation criteria, and their specific mathematical expressions can be found in the literature [30, 31]. To ensure the fairness of algorithm testing, the size of the initial population N is set to 60 and the maximum number of cycles is 1000 for all algorithms on each test function. To achieve the best performance of the other two algorithms, their control parameters were set using the recommended values from the corresponding original literature. For EMOABC, the limit was set to 0.6 × D × N. To avoid the adverse effect of randomness on algorithm evaluation, each algorithm was run 30 times independently, and the mean value and the standard deviation of convergence and diversity were calculated, and the results of each algorithm for three benchmark functions ZDT1, ZDT2, and ZDT3 are shown in Table 1. Detailed expressions of ZDT1, ZDT2, and ZDT3 can be found in the literature [30]. Three algorithms have been run in MATLAB R2020a on a personal computer with Core 2 Duo 2.13 GHz processor and 4 GB memory.Table 1
The comparable results between EMOABC, NSGA-II, and MOPSO.
CriteriaAlgorithmZDT1ZDT2ZDT3ConvergenceEMOABCMean3.6239e − 32.3514e − 22.2485e − 22.6594e − 16.3256e − 22.6585e − 3StdNSGA-IIMean3.9635e − 32.6985e − 22.9651e − 22.9985e − 15.5883e − 21.4154e − 3StdMOPSOMean4.1265e − 33.6517e − 22.8654e − 23.9914e − 17.9562e − 23.1953e − 3StdDiversityEMOABCMean6.6263e − 35.6156e − 23.6989e − 2Std4.5696e − 44.2654e − 32.5359e − 3NSGA-IIMean3.3659e − 23.4889e − 13.7569e − 1Std5.6387e − 23.1245e − 13.1245e − 2MOPSOMean6.9159e − 27.6385e − 24.7646e − 1Std5.4512e − 26.2589e − 33.6632e − 2From Table1, the best values have been marked in bold. In terms of diversity, compared to other algorithms, the EMOABC algorithm obtained the most uniform Pareto front for each test problem with good distribution characteristics, indicating that the EMOABC algorithm has obvious advantages in distribution characteristics; in terms of convergence, for the ZDT3 problem, the EMOABC algorithm performs slightly worse than the NSGA-II algorithm but better than the MOPSO algorithm. Besides, the standard deviations of convergence and diversity obtained by the EMOABC algorithm are small, indicating that this algorithm is more stable and can almost always converge to the optimal nondominated frontier within the maximum number of cycles, which proves the effectiveness of the EMOABC algorithm to obtain a wider, uniform, and realistic Pareto solution set frontier.Table1 cannot completely reflect the results obtained by three algorithms; for this reason, and Figure 2 shows the noninferior optimal solution sets of three benchmark functions obtained by three algorithms.Figure 2
The comparable Pareto front obtained by three algorithms.As can be seen in Figure2, the Pareto-optimal solutions of the EMOABC algorithm on ZDT1–3 can approximate the theoretical Pareto-optimal solution of each function very well, which has especially a good distribution. This experimental result once again verifies the effectiveness and advancement of the EMOABC algorithm for the multiobjective optimization problem.


## 4. Simulation and Discussion

The proposed method has been applied to two cases of mineral processing plants with different water sources and it is compared with MOPSO and NSGA-II to solve this problem. Parameters settings for three algorithms applied to two cases are the same as those set in Section3.3.


### 4.1. Case 1

Case 1 is that the proposed algorithm is applied to the MPWD model based on mineral processing supplied by four water sources. The parameters about upper and lower limits for Case 1 are shown in Table2, where 1 represents freshwater, 2 represents tailings water, 3 represents clean water, and 4 represents in-plant water. For recycled water, the lower cost with water source should be used first. In Case 1, since c2 < c4 < c3, set the penalty factor α = 3, β = 14, and χ = 8. The macro model, which uses historical data as a sample, is built by a stepwise regression approach [34]. The macro model of the water supply network and the macro model of the pressure control point in Case 1 are given in Tables 3 and 4, respectively. The following macro models (in Tables 3–6) are all simulation models.Table 2
Related parameters in Case 1.
Water sourcesqimin (m3/h)qimax (m3/h)pimin (MPa)pimax (MPa)hi (m)ci ($/m3)cpimin (MPa)110010000.150.95150.110.13212030000.180.86560.240.14311020000.170.93260.460.1349515000.160.7450.320.11Table 3
Related macro model of water supply network in Case 1.
Water sourcesfqsum,qi,qiqj10.145+2.618×10−9×q12+3.698×10−9×q32+6.594×10−8×q2q3+2.365×10−8×qsum220.128+4.513×10−9×q12+6.485×10−8×q22+2.684×10−10×q1q2+9.264×10−10×qsum230.117+1.561×10−9×q32+1.248×10−9×q42+5.654×10−9×q1q4+4.589×10−8×qsum240.124+2.415×10−9×q42+8.261×10−9×q1q3+1.368×10−8×qsum2Table 4
Related macro model of the pressure control point in Case 1.
Water sourcef′qsum,qi10.109+1.529×10−9×q12+3.659×10−10×qsum220.123+4.268×10−8×q22+5.364×10−9×qsum230.151+7.268×10−10×q32+5.269×10−8×qsum240.124+6.324×10−8×q42+8.624×10−10×qsum2Table 5
Related macro model of water supply network in Case 2.
Water sourcesfqsum,qi,qiqj10.125+3.584×10−8×q12+5.629×10−10×q22+2.598×10−9×q3q4+4.268×10−9×qsum220.114+8.268×10−10×q22+3.628×10−9×q62+6.324×10−9×q3q5+8.529×10−10×qsum230.115+1.269×10−8×q32+1.562×10−8×q62+4.263×10−9×q4q5+9.264×10−10×qsum240.142+7.261×10−9×q42+6.826×10−9×q12+5.987×10−9×q1q3+8.154×10−10×qsum250.138+9.261×10−10×q52+5.698×10−10×q22+4.358×10−9×q3q6+7.569×10−9×qsum260.152+3.652×10−8×q62+1.268×10−8×q2q4+2.584×10−9×qsum2Table 6
Related macro model of the pressure control point in Case 2.
Water sourcef′qsum,qi10.121+2.316×10−10×q12+8.362×10−9×qsum220.132+5.326×10−9×q22+3.958×10−10×qsum230.142+9.635×10−10×q32+4.369×10−9×qsum240.129+2.589×10−8×q42+5.241×10−10×qsum250.161+7.125×10−9×q52+8.629×10−10×qsum260.135+5.264×10−9×q62+1.259×10−8×qsum2To optimize both mineral processing water costs and the amount of recycled water simultaneously, the proposed EMOABC algorithm has been applied in the MPWD model withqsum = 3000 and 4000. The five best solutions and best ƞk are summarized in Tables 7 and 8. The higher the value of ƞk for a solution, the higher the priority of the solution. From Table 7, we can see that C (Q) in S2 and S3 is slightly different, but q1–q4 in S2 and S3 are completely different. Also, the difference between q1–q4 in S2 and S5 is not significant, but the difference of C (Q) in S2 and S5 is obvious. The above denotes that a set of optimal solutions are obtained by the proposed EMOABC algorithm. The comparison between Tables 7 and 8 shows that when qsum rises from 3000 to 4000, q1, q2, q3, and q4 increase accordingly, while q3 generally declines. q2 increases the most due to its low cost, and the decline in q3 is due to its high cost. The results of using EMOABC algorithm to schedule the flow of different water sources are consistent with those of manual regulation.Table 7
Five best solutions for Case 1 using the EMOABC (qsum = 3000).
Solutionsq1 (m3/h)q2 (m3/h)q3 (m3/h)q4 (m3/h)C (Q) ($/h)M (Qʹ) (m3/h)ƞkS1328115687564161577200840.0536S2396129780150661683191530.0534S3298130778361261681197790.0531S4384137675248861613185600.0529S5395129880350461756191680.0528Table 8
Five best solutions for Case 1 using the EMOABC (qsum = 4000).
Solutionsq1 (m3/h)q2 (m3/h)q3 (m3/h)q4 (m3/h)C (Q) ($/h)M (Qʹ) (m3/h)ƞkS14222120804654103820228480.0546S24392206739616103450218920.0554S34322072824672103380231280.0562S43982218730654103580221060.0558S54062195752647103790222890.0549The MPWD model is solved using EMOABC, NSGA-II, and MOPSO. A comparison of the results obtained by three algorithms is shown in Table 9. It is seen that the EMOABC algorithm yields a lower cost of mineral processing water and a higher amount of recycled water (in bold) than the other two algorithms.Table 9
The best solutions for Case 1 using three algorithms.
MOPSONSGA-IIEMOABCqsum = 3000qsum = 4000qsum = 3000qsum = 4000qsum = 3000qsum = 4000q1395419329395384432q2129421181159222113762082q3802807864732752794q4509656648652488692C (Q)616681039006164110375061577103380M (Qʹ)191822290020057221272008423128Bold highlights that the algorithm proposed in this paper achieves better results.From Figure3, it can be observed that EMOABC can discover a well-distributed and diverse solution set for this problem, while the other two algorithms only find some sparse distributions.Figure 3
Pareto fronts obtained by NSGA-II, MOPSO, and EMOABC forC (Q) and M (Qʹ) in Case 1.


### 4.2. Case 2

Case 2 is that the proposed algorithm is applied to the MPWD model based on mineral processing supplied by six water sources. The parameters about upper and lower limits for Case 2 are shown in Table 10, where 1 represents freshwater no. 1, 2 represents freshwater no. 2, 3 represents tailings water no. 1, 4 represents tailings water no. 2, 5 represents clean water, and 6 represents in-plant water. For recycled water, the water source with a lower cost should be used first. In Case 2, sincec3 < c4 < c6 < c5, set the penalty factor α1 = 3, α2 = 4, β = 14, and χ = 8. The macro model of the water supply network and the macro model of the pressure control point in Case 2 are given in Tables 5 and 6.Table 10
Related parameters in Case 2.
Water sourcesqimin (m3/h)qimax (m3/h)pimin (MPa)pimax (MPa)hi (m)ci ($/m3)cpimin (MPa)11109000.160.96120.120.1421008000.190.87230.130.15312025000.180.92450.240.16410528000.170.76560.260.13513012000.150.85250.480.1761159500.140.6330.330.14In this case,C (Q) and M (Qʹ), two competing objectives, are optimized simultaneously by the EMOABC algorithm, and the five best solutions are shown in Tables 11 and 12. From Tables 11 and 12, the convergence of the solutions in Case 2 is as good as that in Case 1. It is worth noting that as the number of water sources increases, the water selection options are diverse. A comparison of the results obtained by MOPSO, NSGA-II, and EMOABC in Case 2 is shown in Table 13. From Table 13, we can observe that the EMOABC algorithm obtains the optimal solution (in bold) in Case 2 similar to Case 1.Table 11
Five best solutions for Case 2 using EMOABC (qsum = 5000).
Solutionsq1 (m3/h)q2 (m3/h)q3 (m3/h)q4 (m3/h)q5 (m3/h)q6 (m3/h)C (Q) ($/h)M (Qʹ) (m3/h)ƞkS12183241487129589469280912276930.0585S23524151352141584162580005264900.0587S33643251238144982881480087276140.0596S43163481336147977974280049267660.0594S53553621302120989387979153282760.0598Table 12
Five best solutions for Case 2 using EMOABC (qsum = 6000).
Solutionsq1 (m3/h)q2 (m3/h)q3 (m3/h)q4 (m3/h)q5 (m3/h)q6 (m3/h)C (Q) ($/h)M (Qʹ) (m3/h)ƞkS140240617891703906794102800312150.0642S242145618591906806552102540289010.0649S335939619521589863841102300310220.0651S439841216521856786896102240312720.0648S541639517421647911889102230316800.0654Table 13
The best solutions for Case 2 using three algorithms.
MOPSONSGA-IIEMOABCqsum = 5000qsum = 6000qsum = 5000qsum = 6000qsum = 5000qsum = 6000q1322415388429355416q2405323361398362395q3121218421251166213021742q4131517721289173112091647q5881845896919893911q6865803815861879889C (Q)793791029607939810255079153102230M (Qʹ)281503086827973316642827631680Bold highlights that the algorithm proposed in this paper achieves better results.Figure4 shows the distribution of nondominated solutions obtained by NSGA-II, MOPSO, and EMOABC in Case 2. It is seen from them that EMOABC spreads well on the optimization problem, the function value obtained by EMOABC is significantly better than that obtained by NSGA-II, and MOPSO and EMOABC can find a better spread and more solutions in the entire Pareto-optimal region than the other two algorithms. It is indicated that the proposed algorithm is more effective than the other algorithms for solving the MPWD problem. Figures 3 and 4 also show that the two objectives of maximizing the amount of recycled water and minimizing mineral processing water costs conflict. As mineral processing water costs increase, the recycled water consumption decreases, and vice versa.Figure 4
Pareto fronts obtained by NSGA-II, MOPSO, and EMOABC forC (Q) and M (Qʹ) in Case 2.


### 4.3. Algorithm Complexity Analysis

Complexity analysis of the above algorithms was performed using the time response for both cases. The average computation time for all algorithms over 30 runs is given in Table14. From Table 14, it can be seen that EMOABC takes the most computation time. This can be explained by the fact that the multiple strategies integrated in EMOABC enhance the search capability at the cost of increased computation. In conclusion, EMOABC requires more computation time to achieve better results compared to other algorithms.Table 14
Computing time of all algorithms for both cases.
Computing time (s)EMOABCNSGA-IIMOPSOCase 158.640.247.8Case 274.459.564.7


## 4.1. Case 1

Case 1 is that the proposed algorithm is applied to the MPWD model based on mineral processing supplied by four water sources. The parameters about upper and lower limits for Case 1 are shown in Table2, where 1 represents freshwater, 2 represents tailings water, 3 represents clean water, and 4 represents in-plant water. For recycled water, the lower cost with water source should be used first. In Case 1, since c2 < c4 < c3, set the penalty factor α = 3, β = 14, and χ = 8. The macro model, which uses historical data as a sample, is built by a stepwise regression approach [34]. The macro model of the water supply network and the macro model of the pressure control point in Case 1 are given in Tables 3 and 4, respectively. The following macro models (in Tables 3–6) are all simulation models.Table 2
Related parameters in Case 1.
Water sourcesqimin (m3/h)qimax (m3/h)pimin (MPa)pimax (MPa)hi (m)ci ($/m3)cpimin (MPa)110010000.150.95150.110.13212030000.180.86560.240.14311020000.170.93260.460.1349515000.160.7450.320.11Table 3
Related macro model of water supply network in Case 1.
Water sourcesfqsum,qi,qiqj10.145+2.618×10−9×q12+3.698×10−9×q32+6.594×10−8×q2q3+2.365×10−8×qsum220.128+4.513×10−9×q12+6.485×10−8×q22+2.684×10−10×q1q2+9.264×10−10×qsum230.117+1.561×10−9×q32+1.248×10−9×q42+5.654×10−9×q1q4+4.589×10−8×qsum240.124+2.415×10−9×q42+8.261×10−9×q1q3+1.368×10−8×qsum2Table 4
Related macro model of the pressure control point in Case 1.
Water sourcef′qsum,qi10.109+1.529×10−9×q12+3.659×10−10×qsum220.123+4.268×10−8×q22+5.364×10−9×qsum230.151+7.268×10−10×q32+5.269×10−8×qsum240.124+6.324×10−8×q42+8.624×10−10×qsum2Table 5
Related macro model of water supply network in Case 2.
Water sourcesfqsum,qi,qiqj10.125+3.584×10−8×q12+5.629×10−10×q22+2.598×10−9×q3q4+4.268×10−9×qsum220.114+8.268×10−10×q22+3.628×10−9×q62+6.324×10−9×q3q5+8.529×10−10×qsum230.115+1.269×10−8×q32+1.562×10−8×q62+4.263×10−9×q4q5+9.264×10−10×qsum240.142+7.261×10−9×q42+6.826×10−9×q12+5.987×10−9×q1q3+8.154×10−10×qsum250.138+9.261×10−10×q52+5.698×10−10×q22+4.358×10−9×q3q6+7.569×10−9×qsum260.152+3.652×10−8×q62+1.268×10−8×q2q4+2.584×10−9×qsum2Table 6
Related macro model of the pressure control point in Case 2.
Water sourcef′qsum,qi10.121+2.316×10−10×q12+8.362×10−9×qsum220.132+5.326×10−9×q22+3.958×10−10×qsum230.142+9.635×10−10×q32+4.369×10−9×qsum240.129+2.589×10−8×q42+5.241×10−10×qsum250.161+7.125×10−9×q52+8.629×10−10×qsum260.135+5.264×10−9×q62+1.259×10−8×qsum2To optimize both mineral processing water costs and the amount of recycled water simultaneously, the proposed EMOABC algorithm has been applied in the MPWD model withqsum = 3000 and 4000. The five best solutions and best ƞk are summarized in Tables 7 and 8. The higher the value of ƞk for a solution, the higher the priority of the solution. From Table 7, we can see that C (Q) in S2 and S3 is slightly different, but q1–q4 in S2 and S3 are completely different. Also, the difference between q1–q4 in S2 and S5 is not significant, but the difference of C (Q) in S2 and S5 is obvious. The above denotes that a set of optimal solutions are obtained by the proposed EMOABC algorithm. The comparison between Tables 7 and 8 shows that when qsum rises from 3000 to 4000, q1, q2, q3, and q4 increase accordingly, while q3 generally declines. q2 increases the most due to its low cost, and the decline in q3 is due to its high cost. The results of using EMOABC algorithm to schedule the flow of different water sources are consistent with those of manual regulation.Table 7
Five best solutions for Case 1 using the EMOABC (qsum = 3000).
Solutionsq1 (m3/h)q2 (m3/h)q3 (m3/h)q4 (m3/h)C (Q) ($/h)M (Qʹ) (m3/h)ƞkS1328115687564161577200840.0536S2396129780150661683191530.0534S3298130778361261681197790.0531S4384137675248861613185600.0529S5395129880350461756191680.0528Table 8
Five best solutions for Case 1 using the EMOABC (qsum = 4000).
Solutionsq1 (m3/h)q2 (m3/h)q3 (m3/h)q4 (m3/h)C (Q) ($/h)M (Qʹ) (m3/h)ƞkS14222120804654103820228480.0546S24392206739616103450218920.0554S34322072824672103380231280.0562S43982218730654103580221060.0558S54062195752647103790222890.0549The MPWD model is solved using EMOABC, NSGA-II, and MOPSO. A comparison of the results obtained by three algorithms is shown in Table 9. It is seen that the EMOABC algorithm yields a lower cost of mineral processing water and a higher amount of recycled water (in bold) than the other two algorithms.Table 9
The best solutions for Case 1 using three algorithms.
MOPSONSGA-IIEMOABCqsum = 3000qsum = 4000qsum = 3000qsum = 4000qsum = 3000qsum = 4000q1395419329395384432q2129421181159222113762082q3802807864732752794q4509656648652488692C (Q)616681039006164110375061577103380M (Qʹ)191822290020057221272008423128Bold highlights that the algorithm proposed in this paper achieves better results.From Figure3, it can be observed that EMOABC can discover a well-distributed and diverse solution set for this problem, while the other two algorithms only find some sparse distributions.Figure 3
Pareto fronts obtained by NSGA-II, MOPSO, and EMOABC forC (Q) and M (Qʹ) in Case 1.


## 4.2. Case 2

Case 2 is that the proposed algorithm is applied to the MPWD model based on mineral processing supplied by six water sources. The parameters about upper and lower limits for Case 2 are shown in Table 10, where 1 represents freshwater no. 1, 2 represents freshwater no. 2, 3 represents tailings water no. 1, 4 represents tailings water no. 2, 5 represents clean water, and 6 represents in-plant water. For recycled water, the water source with a lower cost should be used first. In Case 2, sincec3 < c4 < c6 < c5, set the penalty factor α1 = 3, α2 = 4, β = 14, and χ = 8. The macro model of the water supply network and the macro model of the pressure control point in Case 2 are given in Tables 5 and 6.Table 10
Related parameters in Case 2.
Water sourcesqimin (m3/h)qimax (m3/h)pimin (MPa)pimax (MPa)hi (m)ci ($/m3)cpimin (MPa)11109000.160.96120.120.1421008000.190.87230.130.15312025000.180.92450.240.16410528000.170.76560.260.13513012000.150.85250.480.1761159500.140.6330.330.14In this case,C (Q) and M (Qʹ), two competing objectives, are optimized simultaneously by the EMOABC algorithm, and the five best solutions are shown in Tables 11 and 12. From Tables 11 and 12, the convergence of the solutions in Case 2 is as good as that in Case 1. It is worth noting that as the number of water sources increases, the water selection options are diverse. A comparison of the results obtained by MOPSO, NSGA-II, and EMOABC in Case 2 is shown in Table 13. From Table 13, we can observe that the EMOABC algorithm obtains the optimal solution (in bold) in Case 2 similar to Case 1.Table 11
Five best solutions for Case 2 using EMOABC (qsum = 5000).
Solutionsq1 (m3/h)q2 (m3/h)q3 (m3/h)q4 (m3/h)q5 (m3/h)q6 (m3/h)C (Q) ($/h)M (Qʹ) (m3/h)ƞkS12183241487129589469280912276930.0585S23524151352141584162580005264900.0587S33643251238144982881480087276140.0596S43163481336147977974280049267660.0594S53553621302120989387979153282760.0598Table 12
Five best solutions for Case 2 using EMOABC (qsum = 6000).
Solutionsq1 (m3/h)q2 (m3/h)q3 (m3/h)q4 (m3/h)q5 (m3/h)q6 (m3/h)C (Q) ($/h)M (Qʹ) (m3/h)ƞkS140240617891703906794102800312150.0642S242145618591906806552102540289010.0649S335939619521589863841102300310220.0651S439841216521856786896102240312720.0648S541639517421647911889102230316800.0654Table 13
The best solutions for Case 2 using three algorithms.
MOPSONSGA-IIEMOABCqsum = 5000qsum = 6000qsum = 5000qsum = 6000qsum = 5000qsum = 6000q1322415388429355416q2405323361398362395q3121218421251166213021742q4131517721289173112091647q5881845896919893911q6865803815861879889C (Q)793791029607939810255079153102230M (Qʹ)281503086827973316642827631680Bold highlights that the algorithm proposed in this paper achieves better results.Figure4 shows the distribution of nondominated solutions obtained by NSGA-II, MOPSO, and EMOABC in Case 2. It is seen from them that EMOABC spreads well on the optimization problem, the function value obtained by EMOABC is significantly better than that obtained by NSGA-II, and MOPSO and EMOABC can find a better spread and more solutions in the entire Pareto-optimal region than the other two algorithms. It is indicated that the proposed algorithm is more effective than the other algorithms for solving the MPWD problem. Figures 3 and 4 also show that the two objectives of maximizing the amount of recycled water and minimizing mineral processing water costs conflict. As mineral processing water costs increase, the recycled water consumption decreases, and vice versa.Figure 4
Pareto fronts obtained by NSGA-II, MOPSO, and EMOABC forC (Q) and M (Qʹ) in Case 2.


## 4.3. Algorithm Complexity Analysis

Complexity analysis of the above algorithms was performed using the time response for both cases. The average computation time for all algorithms over 30 runs is given in Table14. From Table 14, it can be seen that EMOABC takes the most computation time. This can be explained by the fact that the multiple strategies integrated in EMOABC enhance the search capability at the cost of increased computation. In conclusion, EMOABC requires more computation time to achieve better results compared to other algorithms.Table 14
Computing time of all algorithms for both cases.
Computing time (s)EMOABCNSGA-IIMOPSOCase 158.640.247.8Case 274.459.564.7


## 5. Conclusions

The main goal of this study was to solve the MPWD problem effectively. In this study, an MPWD optimization model was developed to maximize the amount of recycled water and minimize mineral processing water costs, with consideration of various constraints. To solve this multiobjective model, the EMOABC algorithm was proposed as an optimizer derived from the ABC algorithm. This study has shown that the developed model was theoretically valid and reasonable and could be utilized to provide decision support for actual MPWD. The study has also shown that the proposed algorithm is competent to solve the MPWD problem and is better than NSGA-II and MOPSO in both benchmark functions and cases.A limitation of this study is that the developed model only has two objectives. The MPWD problem described as a three-objective or even four-objective model may be more realistic. Therefore, building a three-objective or even four-objective model for this MPWD problem is a matter of future work. Meanwhile, continued research of the multiobjective artificial bee colony (MOABC) algorithm is also a focus. In particular, aiming at a three-objective or even four-objective model for this MPWD problem, the concept of multihives bee will be introduced into the ABC algorithm to further improve the performance of the MOABC algorithm.



---

*Source: 2314788-2022-02-01.xml*