Various shapes of weirs, such as rectangular, trapezoidal, circular, and triangular plan forms, are used to adjust and measure the flow rate in irrigation networks. The discharge coefficient (Cd) of weirs, as the key hydraulic parameter, involves the combined effects of the geometric and hydraulic parameters. It is used to compute the flow rate over the weirs. For this purpose, a hybrid ISaDE-SVR method is proposed as a hybrid model to estimate the Cd of sharp-crested W-planform weirs. ISaDE is a high-performance algorithm among other optimization algorithms in estimating the nonlinear parameters in different phenomena. The ISaDE algorithm is used to improve the performance of SVR by finding optimal values for the SVR's parameters. To test and validate the proposed model, the experimental datasets of Kumar et al. and Ghodsian were utilized. Six different input scenarios are presented to estimate the Cd. Based on the modeling results, the proposed hybrid method estimates the Cd in terms of H/P, Lw/Wmc, and Lc/Wc. For the superior method, R2, RMSE, MAPE, and δ are obtained as 0.982, 0.006, 0.612, and 0.843, respectively. The amount of improvement in comparison with GMDH, ANFIS and SVR is 3.6%, 1.2% and 1.5% in terms of R2.

  • A novel hybrid ISaDE method was used to predict the Cd of W-planform weirs.

  • More discharge over W-planform is their major advantage against other types of weirs.

  • ISaDE algorithm is used to improve the capability of SVR by finding optimal values for the SVR's parameters.

  • The model which includes parameters (H/P, Lw/Wmc, Lc/Wc), has the best results.

  • The H/P parameter was the most important input parameter.

Weirs are among the most essential components of water transmission networks, due to the necessity of determining the flow rate in channels and the allocated amount for consumers. These are essential hydraulic structures for controlling the flow and water level, which can be utilized to increase the height of the water surface level and thereby provide the required water heights to divert the flow to lateral channels. Also, these structures are utilized as flow-measuring devices in crucial applications in rivers and open channels for their safe operation (Emami et al. 2018).

The length and shape of the weir crest are among the effective parameters in the flow rates over the weir, and numerous studies have been carried out on the effect of geometric and hydraulic parameters of weirs on the discharge coefficient (Cd). The use of non-linear planar weirs with a specific shape such as triangular, trapezoidal, piano key, circular and parabolic, which are known as labyrinth weirs, is one of the effective ways to increase the flow over a specified width.

Some notable approaches recently proposed to predict the Cd of different plans of labyrinth weirs are shown in Figure 1.

Figure 1

The proposed methods for discharge coefficient prediction for a labyrinth weir; (*), (.), (+) and (−) respectively indicate the approaches proposed for discharge coefficient prediction in trapezoidal, rectangular, triangular, and piano-key-shape weirs.

Figure 1

The proposed methods for discharge coefficient prediction for a labyrinth weir; (*), (.), (+) and (−) respectively indicate the approaches proposed for discharge coefficient prediction in trapezoidal, rectangular, triangular, and piano-key-shape weirs.

Close modal

An important type of triangular weir is the sharp-crested W-planform weir. A few attempts have been made to define the Cd of W-planform weirs. More discharge over them is their major advantage against other types of weirs. The first experimental study on labyrinth weirs with different plans was conducted by Taylor (Dehdar-Behbahani & Parsaie 2016). Besides the development of experimental models, numerical methods including computational fluid dynamic (CFD) techniques (Parsaie et al. 2015; Dehdar-Behbahani & Parsaie 2016), and artificial intelligent techniques have emerged as distinctive and complementary tools in the subject of hydraulic field (Parsaie et al. 2015; Khoshbin et al. 2016; Haghiabi et al. 2018; Parsaie et al. 2018a). Meta-heuristic algorithms as an important branch of artificial intelligence have been widely employed in solving various problems because of their accuracy and high performance. Aydin (2012), Aydin & Emiroglu (2013), Robertson (2014) and Crookston and Tullis (Crookston 2010) used CFD software to model labyrinth weirs and labyrinth side weirs.

Researchers have used neural networks (ANN), genetic programming (GP), support vector machine (SVM) and M5 model tree, group method of data handling (GMDH), adaptive neuro-fuzzy inference system (ANFIS), and meta-heuristic algorithms to optimize and predict the characteristics and geometry of labyrinth weirs with different plan forms including rectangular, trapezoidal, triangular, and a combination of these plans as well and their Cd (Emin Emiroglu et al. 2010; Zaji & Bonakdari 2014; Ebtehaj et al. 2015; Azamathulla et al. 2016; Najafzadeh et al. 2016; Haghiabi et al. 2017; Parsaie et al. 2018b; Bilhan et al. 2018; Roushangar et al. 2018).

Karami et al. (2016) predicted the Cd of the triangular labyrinth weir using SVM, ANN, and GP methods. SVM is a machine-learning technique that is widely used for classification and regression purposes by means of a separating hyperplane. The benefits of SVM, especially its significant accuracy in classification utilizing the tuning parameters, associated with its wide real-world applications has led to the ever-increasing popularity of SVM in the last decade. Artificial neural network (ANN), as a famous computing technique, is inspired by the biological neural system which is utilized in solving complicated problems. ANNs can enjoy self-learning capabilities with task-specific rules and they reach better results by more available data. Genetic programming (GP) is a subset of machine learning and like all evolutionary algorithms (EAs) works by an iterative process. EAs are generally used to discover solutions to challenging real-world problems. GP starts by setting a goal function and then uses the Darwin evolution principle to generate a set of candidate solutions. The results obtained by Karami et al. (2016) showed that the SVM method was superior to the other two methods with RMSE = 0.0059. Haghiabi et al. (2017) obtained the Cd of the triangular labyrinth weir by using the ANFIS and multi-layer perceptron (MLP) models. An adaptive neuro-fuzzy inference system (ANFIS) is based upon a Takagi–Sugeno fuzzy inference system. This model was first introduced in the early 1990s. It enjoys both neural network and fuzzy logic advantages and it is capable of capturing the benefits of both techniques in a single framework. A multilayer perceptron (MLP) is a subset of the feedforward artificial neural network and is utilized as a powerful ANN model for solving complex systems. MLP is generally used as a nonlinear mapping technique to relate the output vector to the input vector of the system. The results of the two models suggest that both models perform well in predicting the Cd. Roushangar et al. (2017) examined the Cd of the arched labyrinth weir using the SVM method and concluded that this method has high accuracy in predicting the Cd of arched weirs. Bonakdari & Zaji (2018) utilized three novel hybrid soft computing approaches, including neuro-fuzzy-differential evaluation (ANFIS-DE), neuro-fuzzy-genetic algorithm (ANFIS-GA) and neuro-fuzzy-particle swarm optimization (ANFIS-PSO), to simulate the Cd of side weirs. The used methods, as the hybrid ones, enjoy the advantages of both employed algorithms. The differential evolution (DE) algorithm, which is utilized together with ANFIS in ANFIS-DE, is a population-based direct search method that uses several vectors. The way of interaction among the vectors is determined by the evolution of living species. This heuristic global optimization algorithm is easy to apprehend, simple, and fast to implement. Parsaie et al. (2018a) applied ANN, SVM and ANFIS models to predict the Cd of a weir-gate system. Performance evaluation of the three models showed that the SVM model had the best performance (R2 = 0.94 and RMSE = 0.008). Bonakdari et al. (2020) employed gene expression programming (GEP) in predicting the Cd of the triangular labyrinth weir and concluded that the proposed method is better than the nearest-living-relative (NLR) method for predicting the Cd. Gene expression programming (GEP) is a learning algorithm to find out the relationship between inputs and output of the unknown system. The main advantage of GEP is in realizing the system inter-relationship by a clear mathematical equation that needs to identify a set of pre-defined mathematical operators. Shafiei et al. (2020) applied the ANFIS-FFA method to obtain the Cd of the labyrinth weirs. A comparison of ANFIS-FFA model results with the ANFIS model showed that the proposed model has a good performance in predicting the Cd. The firefly algorithm (FFA), which is used together with ANFIS in the study, is a swarm-based meta-heuristic algorithm that mimics the flashing light behavior of fireflies. The algorithm works by mimicking how attracted a firefly is by the flashing light of any other firefly. According to the fireflies' behavior, attractiveness is specified by the brightness of the flashing light and its distance, which is the foundation of the technique.

According to the above-mentioned studies, different methods of artificial intelligence have been employed as appropriate optimization or simulation tools to determine the Cd of these weirs. In this paper, a hybrid predictive model based on SVR and improved self-adaptive evolutionary optimization algorithm (ISaDE) is proposed to study the effect of geometric parameters on the Cd of the sharp-crested W-planform labyrinth weir. The proposed method was evaluated with six different combinations of the effective parameters to determine the most appropriate combination. To train and test the proposed hybrid ISaDE-SVR model, the experimental studies of Kumar et al. (2012) and Ghodsian (2009) have been used. Also, the results of the ISaDE-SVR method are compared with the previous findings.

The remaining parts are organized as follows. Problem Definition defines the problem that this paper is focused on. Methodology describes the proposed methodology. The experiments are given in the fourth section. Discussion of results is provided in the fifth section. Finally, the sixth section concludes the paper and lists some future interesting directions.

The purpose of determining the Cd is to investigate the performance of the weir by estimating the flow characteristics passing over the weir. The Cd of the W-planform labyrinth weir is a function of six basic parameters, which are: upstream total head of flow (Ht), effective length of weir (Le), weir height (P), weir width (W), vertex angle (θ) and flow depth (y).

The following equation is used to calculate Cd in labyrinth weirs (Bagheri & Heidarpour 2010):
(1)
The discharge coefficient of the W-planform weir formula and its effective parameters can be given by Equation (2):
(2)
where Wmc is the main channel width, Wc is the width of one cycle of the weir, Lw is the total length of the weir, Lc is the length of the one cycle, g indicates the acceleration effected by gravity, σ is the surface tension, μ is the dynamic viscosity of the fluid and ρ is the specific mass. Using the dimensional analysis for discharge coefficient, the functional relationship as Equation (3) is derived; as the flow over the weir is turbulent, the Reynolds number and Weber number can be omitted (Gupta et al. 2015):
(3)

Support vector regression

Support vector regression (SVR) is a supervised machine-learning method equipped with association learning algorithms (Cortes & Vapnic 1995; Drucker et al. 1997; Zaji et al. 2016). The main principle behind the SVR is the same as that of SVM. For a dataset , where N indicates the number of data objects, is a defined m-dimensional data object and is the label that is assigned to . In the SVR algorithm, each data object is considered as a point in m-dimensional space. The goal is to create a prediction model using some training data to separate data objects through finding a hyperplane that differentiates the data objects into some separate groups. This hyperplane is calculated based on a few data points, known as support vectors. In other words, SVR aims to maximize the minimum distance of data points from a separator hyperplane by solving the following equation:
(4)
where denotes the kernel function, which is computed by multiplying the two inner vectors o and in the feature space and , respectively. Three well-known kernel functions are the radial basis function (RBF), sigmoid, and polynomial basis function. In this paper, the RBF kernel function is used in the SVR due to its high performance and easy configuration compared with other kernel functions. The precise tuning of C, γ and ɛ is an important task to increase the prediction performance of the SVR with RBF kernel. To optimize these parameters, we introduced the ISaDE algorithm, which is described in the next section.

Self-adaptive differential evolution algorithm

Self-adaptive differential evolution (SaDE) is a well-known iterative optimization algorithm (Brest et al. 2006). SaDE is an evolutionary and multi-agent algorithm, in which each agent updates its position by the three operators of selection, mutation, and crossover. The flowchart of the SaDE algorithm is shown in Figure 2.

Figure 2

Flowchart of the proposed SaDE algorithm.

Figure 2

Flowchart of the proposed SaDE algorithm.

Close modal
For an m-dimensional optimization problem, the initial population is an matrix defined as follows:
(5)
where each individual is an m-dimensional vector defined as follows:
(6)

Mutation

In the mutation step, a mutant individual is produced for as follows:
(7)
in which are random numbers used for identifying individuals that take part in mutation, and indicates a real number that adjusts the amplification of the difference between and . In standard SaDE, is defined as
(8)
where is a uniform random variable, and is a probability value adjusting the control factor F. In the simulations, , and . F is a random value in the range [0, 1].

Crossover

In the crossover phase, for each individual , the algorithm computes a trial vector , defined as follows:
(9)
where is defined as
(10)
in which is a uniform random variable, and is a random variable guarantee that gets at least one element from vector . indicates the crossover constant, which is defined as
(11)
where is a uniform random variable in the interval [0, 1], and is a probability value adjusting the crossover constant CR. In the simulations, is set to 0.1.

Selection

To obtain the next generation, each individual is updated as follows:
(12)

If the trial vector obtains a better fitness than , then is set to ; otherwise the old value is maintained.

Improved SaDE (ISaDE)

As mutation controls the algorithm exploration, it is the core operator of SaDE. Improving this parameter increases the algorithm search capability. In this study, an improved version of the mutation operator is proposed to improve the optimization ability of standard SaDE. The new algorithm is named the improved SaDE (ISaDE) algorithm. The rest of the parts are the same as in the original SaDE algorithm except for a mutation phase which is introduced here. The result is much easier to implement compared with other extensions of the SaDE algorithm.

The new mutation operator is defined as follows:
(13)
in which k is the current iteration, and is the maximum number of iterations; is the ith chaotic variable generated based on the Logistic chaotic map. The reason for using a Logistic map is that it shows good chaotic characteristics, represents better randomness than other maps, and helps the algorithm to explore the points that are scattered around the search space as far as possible. The variable is computed as follows:
(14)
where a is a scaler value, is the kth chaotic number in the chaotic sequence, and k is the index of the chaotic sequence. The initial value of is in the range of (0, 1), provided that . In this work, a= 4 is used. Equation (14) increases the exploration power of the algorithm such that different points of the search space are explored. The crossover and selection operators are left without change. Figure 3 illustrates the flowchart of the ISaDE algorithm.
Figure 3

Flowchart of the proposed ISaDE algorithm.

Figure 3

Flowchart of the proposed ISaDE algorithm.

Close modal

The proposed ISaDE-SVR method

As mentioned before, the prediction performance of the SVR with RBF kernel is highly dependent on the three parameters C, , and . In other words, selection of optimal values for these parameters improves the speed of training and increases the performance of classification as well. To find the optimal values of the parameters and optimum feature selection, we used the ISaDE optimization algorithm. Figure 4 shows the proposed ISaDE-SVR approach for SVM parameter selection and feature extraction. This algorithm provides a better training effect and improves the prediction accuracy.

Figure 4

Flowchart of the ISaDE-SVR.

Figure 4

Flowchart of the ISaDE-SVR.

Close modal

A detailed description of the ISaDE-SVR follows.

Generate initial population

Since the feature subset selection and the SVR's parameter optimization should be addressed simultaneously, each candidate solution in the population is composed of a feature permutation and parameter combination, as follows
(15)
where are float numbers, which are candidate values for the three parameters C, , and . These values are generated randomly. The range of values for p1 is [0, 100], and for p2 and p3 it is [0, 1]. Each feature is a binary variable and its value is 1 when it is considered in the model, and 0 when the feature is ignored.

Computing the fitness function

The fitness of each solution is evaluated using the mean squared error (MSE) of five-fold cross-validation for the SVR. The fitness function is defined as
(16)
where is the observed value, is the predicted value, and n is the total number of data in the dataset.

The individual with a smaller value of MSE is more preferable. The idea behind using the cross-validation strategy is to prevent under-fitting or over-fitting effects in the ISaDE-SVR approach. In n-fold cross validation, the training set is divided into n equal subsets. At each iteration, one of the subsets is taken as the testing set in turn, and n − 1 subsets are considered as training sets in the SVR method, then the above procedure is iterated until each subset is validated once.

Until the termination conditions are met, three operators including mutation, crossover and selection are iteratively carried out to update the population.

Evaluation of ISaDE algorithm

To evaluate the performance of the proposed ISaDE algorithm, 14 test problems were used. These functions include nine unimodal and four multimodal functions. Table 1 lists the characteristics of the benchmark problems. A detailed description of the test functions is available in Civicioglu (2013) and Karaboga & Akay (2009).

Table 1

Test functions used in the test

FunctionFormulationDimensionRangeMinimum
Easom  [−100, 100] −1 
Colville  [−10, 10] 
Beale  [−4.5, 4.5] 
Trird 6  [−36, 36] −50 
Quartic  30 [−1.28, 1.28] 
Zakharov  10 [−5, 10] 
Powell  24 [−4, 5] 
Schwefel 2.22  30 [−10, 10] 
Rosenbrock  30 [−30, 30] 
Michalewicz10  10  −9.66 
FletcherPowell 10  10  
Rastrigin  30 [−5.12, 5.12] 
Griewank  30 [−600, 600] 
Ackley  30 [−32, 32] 
FunctionFormulationDimensionRangeMinimum
Easom  [−100, 100] −1 
Colville  [−10, 10] 
Beale  [−4.5, 4.5] 
Trird 6  [−36, 36] −50 
Quartic  30 [−1.28, 1.28] 
Zakharov  10 [−5, 10] 
Powell  24 [−4, 5] 
Schwefel 2.22  30 [−10, 10] 
Rosenbrock  30 [−30, 30] 
Michalewicz10  10  −9.66 
FletcherPowell 10  10  
Rastrigin  30 [−5.12, 5.12] 
Griewank  30 [−600, 600] 
Ackley  30 [−32, 32] 

The ISaDE algorithm is compared with five algorithms including particle swarm optimization (PSO) (Vesterstrom & Thomsen 2004), artificial bee colony (ABC) (Karaboga & Basturk 2007), SaDE (Civicioglu 2013), grey wolf optimization (GWO) (Mirjalili et al. 2014), and salp swarm optimization (SSA) (Mirjalili et al. 2017). The PSO algorithm simulates the swarm intelligence behavior of bird flocking and schooling in nature. In every iteration of PSO, the positions of search agents are updated using the local best knowledge found by each agent and the global knowledge found by the swarm. The ABC simulates the cooperation among honey bees in finding food sources. SaDE is an extension of the differential evolution algorithm that utilizes a self-adaptive approach to tune the parameters. The GWO algorithm simulates the hunting behavior of grey wolves. In GWO, there are four kinds of wolves: alpha, beta, delta and omega. The algorithm updates the positions of the wolves using three main operators: finding prey, encircling prey and attacking prey. These operators hopefully cause the greys to converge to the global optimum point in solution space. The SSA algorithm mimics the swarming mechanism of salps in foraging and navigating in oceans. This algorithm updates the positions of salps using their local and global knowledge. Table 2 shows the multi-problem-based pairwise comparison among the algorithms using the Wilcoxon signed-rank test (Derrac et al. 2011). The comparison is performed based on the mean cost values obtained over 30 simulation runs. This test is considered to statistically evaluate the performance of the algorithm when solving several benchmark functions. The results testify that the ISaDE is more successful than its counterparts in converging to the global optimum of the benchmark functions, with a significance value . Overall, the ISaDE outperforms the other algorithms in terms of convergence rate and solution quality. Due the excellent performance of the ISaDE in solving numerical optimization problems, we used it to predict the discharge coefficient of labyrinth weirs.

Table 2

Multi-problem-based statistical pairwise comparison of ISaDE and comparison algorithms using two-sided Wilcoxon signed-rank test

ComparisonT +Tp-valueWinner
ISaDE vs PSO 57 0.03318 ISaDE 
ISaDE vs ABC 76 15 0.03318 ISaDE 
ISaDE vs SaDE 21 N/A ISaDE 
ISaDE vs GWO 40 0.02202 ISaDE 
ISaDE vs SSA 96 0.00634 ISaDE 
ComparisonT +Tp-valueWinner
ISaDE vs PSO 57 0.03318 ISaDE 
ISaDE vs ABC 76 15 0.03318 ISaDE 
ISaDE vs SaDE 21 N/A ISaDE 
ISaDE vs GWO 40 0.02202 ISaDE 
ISaDE vs SSA 96 0.00634 ISaDE 

Benchmark

To examine the capabilities of the proposed method in predicting the Cd of sharp-crested W-planform weirs, Kumar et al. (2012) and Ghodsian (2009) are used. This dataset contains 223 records, each one consisting of possible values for six hydraulic and geometric parameters of the weir and a measured value for Cd. This dataset was gathered in a horizontal rectangular tilting flume made of glass walls with a width of 0.245 m, length of 5.360 m, and a depth of 0.450 m. The sharp-crested W-planform labyrinth weirs were placed 5.150 m away from the flume entrance. The experiments were done with a wide range of W-planform weir parameters including the total length of the weir (Lw), length of one cycle of the weir (Lc), the width of one cycle of the weir (Wc), vertex angle (θ) and flow depth (y). The schematic of the flume and the position of the weir used in the experiments are shown in Figure 5. The parameters of the dataset are given in Table 3. We split the dataset into two sets: training and test set. The number of 180 records is randomly selected to be in the training set and the remainder form the test set.

Table 3

Range of data in the experiments

ParameterDescriptionMinMaxAvgSTDEV
Wmc Channel width (m) 0.245 0.300 0.271 0.019 
Wc Cycle width (m) 0.123 0.280 0.213 0.075 
Lw Weir length (m) 0.245 1.200 0.475 0.282 
Lc Cycle length (m) 0.123 1.082 0.373 0.263 
P Weir height (m) 0.092 0.170 0.110 0.024 
H Total head (m) 0.007 0.145 0.046 0.024 
Cd Discharge Coefficient (−) 0.148 0.906 0.595 0.172 
ParameterDescriptionMinMaxAvgSTDEV
Wmc Channel width (m) 0.245 0.300 0.271 0.019 
Wc Cycle width (m) 0.123 0.280 0.213 0.075 
Lw Weir length (m) 0.245 1.200 0.475 0.282 
Lc Cycle length (m) 0.123 1.082 0.373 0.263 
P Weir height (m) 0.092 0.170 0.110 0.024 
H Total head (m) 0.007 0.145 0.046 0.024 
Cd Discharge Coefficient (−) 0.148 0.906 0.595 0.172 
Table 4

Input scenario

ModelInput combinationsAbsent
П1 H/P, Lw/Wmc, Lc/Wc, Lw/Wc, H/Wc – 
П2 H/P, Lw/Wmc, Lc/Wc, H/Wc Lw/Wc 
П3 Lw/Wmc, Lw/Wc, H/Wc H/P 
П4 H/P, Lc/Wc, H/Wc Lw/Wmc, Lw/Wc 
П5 H/P, Lw/Wmc, H/Wc Lc/Wc, Lw/Wc 
П6 H/P, Lw/Wmc, Lc/Wc Lw/Wc, H/Wc 
ModelInput combinationsAbsent
П1 H/P, Lw/Wmc, Lc/Wc, Lw/Wc, H/Wc – 
П2 H/P, Lw/Wmc, Lc/Wc, H/Wc Lw/Wc 
П3 Lw/Wmc, Lw/Wc, H/Wc H/P 
П4 H/P, Lc/Wc, H/Wc Lw/Wmc, Lw/Wc 
П5 H/P, Lw/Wmc, H/Wc Lc/Wc, Lw/Wc 
П6 H/P, Lw/Wmc, Lc/Wc Lw/Wc, H/Wc 
Figure 5

Schematic of experimental setup (Kumar et al. 2012).

Figure 5

Schematic of experimental setup (Kumar et al. 2012).

Close modal

Input parameters

To investigate the most appropriate input parameters, six different input combinations were evaluated. To select the most effective input parameters, first, all input parameters are considered for the development of the ISaDE-SVR model and then one of the input parameters is removed from the inputs and the model is re-trained and tested with the same structure. Table 4 presents the different input combinations. The input parameters are non-dimensional ones that have been used in several other investigations (Parsaie & Haghiabi 2017; Haghiabi et al. 2018; Haghiabi et al. 2019).

Performance criteria

Statistical criteria of correlation coefficient (R2), root mean square error (RMSE), mean absolute percentage error (MAPE) and averaged absolute deviation (δ) were used to evaluate the efficiency of the proposed method along with other models. RMSE computes the model error at the same scale as the output parameters, but MAPE and δ compute the non-dimensional error of the model. These criteria are defined as follows:
(17)
(18)
(19)
(20)
where is the predicted , is the observed , and and are average predicted and observed Cd values, respectively.

Investigating the effect of input scenarios

The performance of the proposed hybrid method was performed with six different input scenarios to obtain the Cd of the W-planform weir. Table 5 presents the performance of the ISaDE-SVR method with the different input combinations and the optimized parameters of the SVR.

Table 5

Performance evaluation of the ISaDE-SVR method for different input combinations

ModelTrain
Test
SVM parameters
R2RMSEMAPER2RMSEMAPECɛγ
П1 0.884 0.009 1.202 1.290 0.845 0.011 1.343 1.332 100 0.5 
П2 0.991 0.006 0.802 0.810 0.972 0.007 0.879 0.880 10 
П3 0.834 0.011 1.225 1.150 0.825 0.013 1.324 1.162 10 0.5 
П4 0.980 0.008 0.920 0.941 0.965 0.009 0.963 1.102 10 
П5 0.778 0.014 1.403 1.221 0.759 0.016 1.530 1.422 100 0.5 
П6 0.996 0.005 0.521 0.792 0.982 0.006 0.612 0.843 10 
ModelTrain
Test
SVM parameters
R2RMSEMAPER2RMSEMAPECɛγ
П1 0.884 0.009 1.202 1.290 0.845 0.011 1.343 1.332 100 0.5 
П2 0.991 0.006 0.802 0.810 0.972 0.007 0.879 0.880 10 
П3 0.834 0.011 1.225 1.150 0.825 0.013 1.324 1.162 10 0.5 
П4 0.980 0.008 0.920 0.941 0.965 0.009 0.963 1.102 10 
П5 0.778 0.014 1.403 1.221 0.759 0.016 1.530 1.422 100 0.5 
П6 0.996 0.005 0.521 0.792 0.982 0.006 0.612 0.843 10 

In ISaDE-SVR, the П6 model, which includes the most effective geometric parameters (H/P, Lw/Wmc, Lc/Wc), has the best results with R2 = 0.982 and RMSE = 0.006 in the testing stage. As shown in Table 5, after model П6, models П2 and П4, which include the (H/Wc) parameter in addition to the mentioned geometric parameters, have surprisingly appropriate and satisfactory results. However, their results are significantly weaker than the П6 model.

Figures 69 show the scatterplot of the proposed method for the П6 model in the training and testing stages. As indicated in these figures, by using the input combinations as П6, the performance of the ISaDE-SVR model is very close to the observed values. It can be concluded that the ISaDE-SVR method performs properly in predicting the Cd of W-planform weirs.

Figure 6

Comparison of observed Cd and the predicted Cd obtained by SVR on the training stage.

Figure 6

Comparison of observed Cd and the predicted Cd obtained by SVR on the training stage.

Close modal
Figure 7

Comparison of observed Cd and the predicted Cd obtained by ISaDE-SVR on the training stage.

Figure 7

Comparison of observed Cd and the predicted Cd obtained by ISaDE-SVR on the training stage.

Close modal
Figure 8

Comparison of observed Cd and the predicted Cd obtained by SVR on the test stage.

Figure 8

Comparison of observed Cd and the predicted Cd obtained by SVR on the test stage.

Close modal
Figure 9

Comparison of observed Cd and the predicted Cd obtained by ISaDE-SVR on the test stage.

Figure 9

Comparison of observed Cd and the predicted Cd obtained by ISaDE-SVR on the test stage.

Close modal

The numerical results obtained by the proposed method and SVR method for the П6 combination are given in the training and testing stages based on the performance criteria in Tables 6 and 7.

Table 6

Performance of proposed methods in the training dataset

MethodR2RMSEMAPE
SVR 0.978 0.008 0.745 0.985 
ISaDE-SVR 0.996 0.005 0.521 0.792 
MethodR2RMSEMAPE
SVR 0.978 0.008 0.745 0.985 
ISaDE-SVR 0.996 0.005 0.521 0.792 
Table 7

Performance of proposed methods in the test dataset

MethodR2RMSEMAPE
SVR 0.967 0.009 0.802 1.120 
ISaDE-SVR 0.982 0.006 0.612 0.843 
MethodR2RMSEMAPE
SVR 0.967 0.009 0.802 1.120 
ISaDE-SVR 0.982 0.006 0.612 0.843 

In general, according to the results presented in Figures 69, and Tables 6 and 7, the capability of the proposed hybrid method is appropriate for predicting the Cd of W-planform weirs.

To further examine the results of the ISaDE-SVR method, the Ω index was defined as the ratio of the predicted Cd to the observed values to compare the accuracy of the results. This index helps to recognize the behavior of the models in overestimation or underestimation of the Cd. The proximity of the Ω index to unity indicates the acceptable performance of the proposed method compared with other methods. The histogram of Ω is plotted for the different input models in Figure 10.

Figure 10

The histogram of Ω index versus the Cd.

Figure 10

The histogram of Ω index versus the Cd.

Close modal

The maximum, minimum, and average values of the Ω index for the six models are presented in Table 8. Among all the six models, the largest value of the Ω index is obtained for model П5. Therefore, models П2, П4, and П6 predict the discharge coefficient close to the observed values compared with the other combinations. The H/P, Lw/Wmc, and Lc/Wc parameters were found to be the most effective parameters in the estimation of Cd.

Table 8

Maximum, minimum and average for the six input combination models

ModelΩmaxΩminΩave
П1 1.021 0.881 0.980 
П2 1.023 0.906 0.999 
П3 1.019 0.889 0.978 
П4 1.012 0.901 0.990 
П5 1.128 0.822 1.003 
П6 1.022 0.903 0.999 
ModelΩmaxΩminΩave
П1 1.021 0.881 0.980 
П2 1.023 0.906 0.999 
П3 1.019 0.889 0.978 
П4 1.012 0.901 0.990 
П5 1.128 0.822 1.003 
П6 1.022 0.903 0.999 

Comparison of the results of ISaDE-SVR with previous studies

Given that limited studies have predicted the Cd of W-planform weirs using soft computing techniques, in this section, the results of the ISaDE-SVR model with the input combination of П6 are compared with the prior studies of Haghiabi et al. (2017) and Haghiabi et al. (2019). Figure 11 and Table 9 show a comparison of the proposed method with the results of other mentioned studies. They show that the ISaDE-SVR method has a better performance with R2 of 0.982 compared with ANFIS and GMDH models with R2 of 0.97 and 0.94, respectively. The superiority of the proposed model over the others originates from two sources. The first reason is related to the good performance of the algorithms of the ISaDE and SVR models in recognition of the weight of each effective parameter, and the second reason is that the proposed model enjoys the benefits of both ISaDE and SVR models due to the hybrid property of the model.

Figure 11

Comparison of the proposed ISaDE-SVR and prior studies

Figure 11

Comparison of the proposed ISaDE-SVR and prior studies

Close modal
Table 9

Evaluation of the performance of the ISaDE-SVR method and counterpart methods

ModelR2RMSEMAPE
GMDH 0.946 0.055 – – 
ANFIS 0.970 0.045 – – 
SVR 0.967 0.009 0.802 1.120 
ISaDE-SVR 0.982 0.006 0.612 0.843 
ModelR2RMSEMAPE
GMDH 0.946 0.055 – – 
ANFIS 0.970 0.045 – – 
SVR 0.967 0.009 0.802 1.120 
ISaDE-SVR 0.982 0.006 0.612 0.843 

In this study, a novel hybrid ISaDE method, namely ISaDE-SVR, was used to predict the Cd of W-planform weirs. For this purpose, six models were introduced by combining different effective input parameters to predict the Cd. Then, by analyzing the computational results, the superior model was determined. This model predicted the Cd in terms of the ratio of total head over weir crest to the weir height (H/P), the ratio of the total length of the weir to the main channel width (Lw/Wmc), and the ratio of the length of one cycle to the main channel width (Lc/Wc). Also, the H/P parameter was the most important input parameter in predicting the Cd of the W-planform weir using the proposed method. The results indicate that the proposed ISaDE-SVR model performs more efficiently than other previous studies. The capabilities of both algorithms of ISaDE and SVR models in recognition of the weight of each effective parameter and the combination of these capabilities in the proposed hybrid model are the reasons for the good performance of the model against the others. ISaDE-SVR does need parameter setting and it is a fast convergence algorithm. It outperformed the counterpart algorithms in finding the discharge coefficient. However, the performance of ISaDE-SVR is far from ideal. Therefore, interesting future work is to combine the ISaDE algorithm with artificial neural networks and neuro-fuzzy models to improve the performance of Cd prediction. Another search direction is to apply the ISaDE-SVR method on other optimization problems to evaluate its potential and disadvantages.

The manuscript is original research in the field of water resources.

We (authors) declare that we have no conflict of interest.

All relevant data are included in the paper or its Supplementary Information.

Akhbari
A.
,
Hossein Zaji
A.
,
Azimi
H.
&
Vafaeifard
M.
2017
Predicting the discharge coefficient of triangular plan form weirs using radian basis function and M5' methods
.
J. Appl. Res. Water Wastewater
4
(
1
),
281
289
.
Aydin
M. C.
2012
CFD simulation of free-surface flow over triangular labyrinth side weir
.
Adv. Eng. Softw.
45
(
1
),
159
166
.
doi:10.1016/j.advengsoft.2011.09.006
.
Aydin
M. C.
&
Emiroglu
M. E.
2013
Determination of capacity of labyrinth side weir by CFD
.
Flow Meas. Instrum.
29
,
1
8
.
doi:10.1016/j.flowmeasinst.2012.09.008
.
Azamathulla
H. M.
,
Haghiabi
A. H.
&
Parsaie
A.
2016
Prediction of side weir discharge coefficient by support vector machine technique
.
Water Sci. Technol. Water Supply
16
(
4
),
1002
1016
.
doi:10.2166/ws.2016.014
.
Azimi
A. H.
&
Hakim
S. S.
2019
Hydraulics of flow over rectangular labyrinth weirs
.
Irrig. Sci.
37
(
2
),
183
193
.
doi:10.1007/s00271-018-0616-6
.
Bagheri
S.
&
Heidarpour
M.
2010
Application of free vortex theory to estimating discharge coefficient for sharp-crested weirs
.
Biosyst. Eng.
105
(
3
),
423
427
.
doi:10.1016/j.biosystemseng.2010.01.001
.
Bilhan
O.
,
Emiroglu
M. E.
&
Kisi
O.
2011
Use of artificial neural networks for prediction of discharge coefficient of triangular labyrinth side weir in curved channels
.
Adv. Eng. Softw.
42
(
4
),
208
214
.
doi:10.1016/j.advengsoft.2011.02.006
.
Bilhan
O.
,
Aydin
M. C.
,
Emiroglu
M. E.
&
Miller
C. J.
2018
Experimental and CFD analysis of circular labyrinth weirs
.
J. Irrig. Drain. Eng.
144
(
6
),
04018007
.
doi:10.1061/(ASCE)IR.1943-4774.0001301
.
Bonakdari
H.
,
Ebtehaj
I.
,
Gharabaghi
B.
,
Sharifi
A.
&
Mosavi
A.
2020
Prediction of discharge capacity of labyrinth weir with gene expression programming
. In:
Intelligent Systems and Applications
(K. Arai, S. Kapoor & R. Bhatia, eds)
,
Springer, Cham
,
Switzerland
, pp.
202
217
.
doi:10.20944/preprints202001.0313.v1
.
Brest
J.
,
Greiner
S.
,
Boskovic
B.
,
Mernik
M.
&
Zumer
V.
2006
Self-adapting control parameters in differential evolution: a comparative study on numerical benchmark problems
.
IEEE Trans. Evol. Comput.
10
(
6
),
646
657
.
doi:10.1109/TEVC.2006.872133
.
Civicioglu
P.
2013
Backtracking search optimization algorithm for numerical optimization problems
.
Appl. Math. Comput.
219
(
15
),
8121
8144
.
Cortes
C.
&
Vapnic
V.
1995
Support-vector networks
.
Mach. Learn.
20
,
273
297
.
Crookston
B. M.
2010
Labyrinth Weirs
.
PhD thesis, Utah State University, Logan, UT, USA
.
Dehdar-behbahani
S.
&
Parsaie
A.
2016
Numerical modeling of flow pattern in dam spillway's guide wall. Case study: Balaroud dam, Iran
.
Alexandria Eng. J.
55
(
1
),
467
473
.
doi:10.1016/j.aej.2016.01.006
.
Derrac
J.
,
García
S.
,
Molina
D.
&
Herrera
F.
2011
A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms
.
Swarm Evol. Comput.
1
(
1
),
3
18
.
doi:10.1016/j.swevo.2011.02.002
.
Drucker
H.
,
Burges
C. J. C.
,
Kaufman
L.
,
Smola
A.
&
Vapnik
V.
1997
Support vector regression machines
. In:
Advances in Neural Information Processing Systems 9 (NIPS 1996)
(M. C. Mozer, M. Jordan & T. Petsche, eds)
,
MIT Press
,
Cambridge, MA, USA
, pp.
155
161
.
Ebtehaj
I.
,
Bonakdari
H.
,
Zaji
A. H.
,
Azimi
H.
&
Sharifi
A.
2015
Gene expression programming to predict the discharge coefficient in rectangular side weirs
.
Appl. Soft Comput. J.
35
,
618
628
.
doi:10.1016/j.asoc.2015.07.003
.
Emami
S.
,
Arvanaghi
H.
&
Parsa
J.
2018
Numerical investigation of geometric parameters effect of the labyrinth weir on the discharge coefficient
.
J. Rehabil. Civ. Eng.
6
(
1
),
1
9
.
doi:10.22075/jrce.2017.11428.1188
.
Emin Emiroglu
M.
,
Kisi
O.
&
Bilhan
O.
2010
Predicting discharge capacity of triangular labyrinth side weir located on a straight channel by using an adaptive neuro-fuzzy technique
.
Adv. Eng. Softw.
41
(
2
),
154
160
.
doi:10.1016/j.advengsoft.2009.09.006
.
Ghodsian
M.
2009
Stage–discharge relationship for a triangular labyrinth spillway
.
Proc. Inst. Civ. Eng. – Water Manag.
162
(
3
),
173
178
.
doi:10.1680/wama.2009.00033
.
Gupta
K. K.
,
Kumar
S.
&
Ahmad
Z.
2015
Flow characteristics of sharp-crested W-planform weirs. In:
1st International Conference on Research in Science, Engineering & Management (IOCRSEM 2014), International Journal of Advanced Technology & Engineering Research
, pp.
176
180
.
Haghiabi
A. H.
,
Azamathulla
H. M.
&
Parsaie
A.
2017
Prediction of head loss on cascade weir using ANN and SVM
.
ISH J. Hydraul. Eng.
23
(
1
),
102
110
.
doi:10.1080/09715010.2016.1241724
.
Haghiabi
A. H.
,
Parsaie
A.
&
Ememgholizadeh
S.
2018
Prediction of discharge coefficient of triangular labyrinth weirs using Adaptive Neuro Fuzzy Inference System
.
Alexandria Eng. J.
57
(
3
),
1773
1782
.
doi:10.1016/j.aej.2017.05.005
.
Haghiabi
A. H.
,
Parsaie
A.
&
Shamsi
Z.
2019
Intelligent mathematical modeling of discharge coefficient of nonlinear weirs with triangular plan
.
AUT J. Civ. Eng.
3
(
2
),
149
156
.
doi:10.22060/ajce.2018.14833.5500
.
Izadbakhsh
M.
&
Hajiabadi
R.
2019
Modeling discharge capacity of labyrinth weirs through a learning machine approach
.
J. Appl. Res. Water Wastewater
6
(
2
),
100
108
.
Karaboga
D.
&
Akay
B.
2009
A comparative study of Artificial Bee Colony algorithm
.
Appl. Math. Comput.
214
(
1
),
108
132
.
Karami
H.
,
Karimi
S.
,
Bonakdari
H.
&
Shamshirband
S.
2016
Predicting discharge coefficient of triangular labyrinth weir using extreme learning machine, artificial neural network and genetic programming
.
Neural Comput. Appl.
29
,
983
989
.
doi:10.1007/s00521-016-2588-x
.
Kisi
O.
,
Bilhan
O.
&
Emiroglu
M. E.
2013
Anfis to estimate discharge capacity of rectangular side weir
.
Proc. Inst. Civ. Eng. – Water Manag.
166
(
9
),
479
487
.
doi:10.1680/wama.11.00095
.
Kumar
S.
,
Ahmad
Z.
,
Mansoor
T.
&
Himanshu
S. K.
2012
Discharge characteristics of sharp crested weir of curved plan-form
.
Res. J. Eng. Sci.
1
(
4
),
16
20
.
Mehri
Y.
,
Soltani
J.
&
Khashehchi
M.
2019
Predicting the coefficient of discharge for piano key side weirs using GMDH and DGMDH techniques
.
Flow Meas. Instrum.
65
,
1
6
.
doi:10.1016/j.flowmeasinst.2018.11.002
.
Mirjalili
S.
,
Gandomi
A. H.
,
Mirjalili
S. Z.
,
Saremi
S.
,
Faris
H.
&
Mirjalili
S. M.
2017
Salp Swarm Algorithm: a bio-inspired optimizer for engineering design problems
.
Adv. Eng. Softw.
114
,
163
191
.
doi:10.1016/j.advengsoft.2017.07.002
.
Mirjalili
S.
,
Mirjalili
S. M.
&
Lewis
A.
2014
Grey Wolf Optimizer
.
Adv. Eng. Softw.
69
,
46
61
.
Najafzadeh
M.
,
Etemad-Shahidi
A.
&
Lim
S. Y.
2016
Scour prediction in long contractions using ANFIS and SVM
.
Ocean Eng.
111
,
128
135
.
doi:10.1016/j.oceaneng.2015.10.053
.
Olyaie
E.
,
Banejad
H.
&
Heydari
M.
2019
Estimating discharge coefficient of PK-Weir under subcritical conditions based on high-accuracy machine learning approaches
.
Iran. J. Sci. Technol. – Trans. Civ. Eng.
43
,
89
101
.
doi:10.1007/s40996-018-0150-z
.
Parsaie
A.
&
Haghiabi
A. H.
2017
Support Vector Machine to predict the discharge coefficient of sharp crested w-planform weirs
.
AUT J. Civ. Eng.
1
(
2
),
195
204
.
doi:10.22060/ceej.2017.13005.5309
.
Parsaie
A.
,
Haghiabi
A. H.
&
Moradinejad
A.
2015
CFD modeling of flow pattern in spillway's approach channel
.
Sustain. Water Resour. Manag.
1
(
3
),
245
251
.
doi:10.1007/s40899-015-0020-9
.
Parsaie
A.
,
Azamathulla
H. M.
&
Haghiabi
A. H.
2018a
Prediction of discharge coefficient of cylindrical weir–gate using GMDH-PSO
.
ISH J. Hydraul. Eng.
24
(
2
),
116
123
.
doi:10.1080/09715010.2017.1372226
.
Parsaie
A.
,
Haghiabi
A. H.
,
Saneie
M.
&
Torabi
H.
2018b
Applications of soft computing techniques for prediction of energy dissipation on stepped spillways
.
Neural Comput. Appl.
29
(
12
),
1393
1409
.
doi:10.1007/s00521-016-2667-z
.
Robertson
G. K.
2014
Labyrinth Weir Hydraulics: Validation of CFD Modelling
.
MSc thesis, Stellenbosch University, Stellenbosch, South Africa
.
Roushanger
K.
&
Soleymanzadeh
A.
2016
Predicting trapezoidal weir discharge coefficient using evolutionary algorithm
.
International Journal of Mathematical and Computational Sciences
10
(
11
).
Roushangar
K.
,
Alami
M. T.
,
Asl
M. M.
&
Shiri
J.
2017
Modeling discharge coefficient of normal and inverted orientation labyrinth weirs using machine learning techniques
.
ISH J. Hydraul. Eng.
23
(
3
),
331
340
.
doi:10.1080/09715010.2017.1327333
.
Roushangar
K.
,
Alami
M. T.
,
Shiri
J.
&
Asl
M. M.
2018
Determining discharge coefficient of labyrinth and arced labyrinth weirs using support vector machine
.
Hydrol. Res.
49
(
3
),
924
938
.
doi:10.2166/nh.2017.214
.
Shafiei
S.
,
Najarchi
M.
&
Shabanlou
S.
2020
A novel approach using CFD and neuro-fuzzy-firefly algorithm in predicting labyrinth weir discharge coefficient
.
J. Brazilian Soc. Mech. Sci. Eng.
42
(
1
),
44
.
doi:10.1007/s40430-019-2109-9
.
Vesterstrom
J.
&
Thomsen
R.
2004
A comparative study of differential evolution, particle swarm optimization, and evolutionary algorithms on numerical benchmark problems
. In:
Proceedings of the 2004 Congress on Evolutionary Computation (CEC2004)
,
IEEE
,
Piscataway, NJ, USA
, pp.
1980
1987
.
Zaji
A. H.
,
Bonakdari
H.
&
Karimi
S.
2015
Radial Basis Neural Network and Particle Swarm Optimization-based equations for predicting the discharge capacity of triangular labyrinth weirs
.
Flow Meas. Instrum.
45
,
341
347
.
doi:10.1016/j.flowmeasinst.2015.08.002
.
Zaji
A. H.
,
Bonakdari
H.
,
Khodashenas
S. R.
&
Shamshirband
S.
2016
Firefly optimization algorithm effect on support vector regression prediction improvement of a modified labyrinth side weir's discharge coefficient
.
Appl. Math. Comput.
274
,
14
19
.
doi:10.1016/j.amc.2015.10.070
.
This is an Open Access article distributed under the terms of the Creative Commons Attribution Licence (CC BY 4.0), which permits copying, adaptation and redistribution, provided the original work is properly cited (http://creativecommons.org/licenses/by/4.0/).