• <tr id="yyy80"></tr>
  • <sup id="yyy80"></sup>
  • <tfoot id="yyy80"><noscript id="yyy80"></noscript></tfoot>
  • 99热精品在线国产_美女午夜性视频免费_国产精品国产高清国产av_av欧美777_自拍偷自拍亚洲精品老妇_亚洲熟女精品中文字幕_www日本黄色视频网_国产精品野战在线观看 ?

    Gaining-Sharing Knowledge Based Algorithm for Solving Stochastic Programming Problems

    2022-08-24 03:28:04PrachiAgrawalKhalidAlnowibetandAliWagdyMohamed
    Computers Materials&Continua 2022年5期

    Prachi Agrawal,Khalid Alnowibet and Ali Wagdy Mohamed

    1Yogananda School of Artificial Intelligence,Computers&Data Science,Shoolini University,Solan,173229,India

    2Statistics and Operations Research Department,College of Science,King Saud University,Riyadh,11451,Kingdom of Saudi Arabia

    3Operations Research Department,F(xiàn)aculty of Graduate Studies for Statistical Research,Cairo University,Giza,12613,Egypt

    4Department of Mathematics and Actuarial Science,School of Science and Engineering,The American University in Cairo,Egypt

    Abstract:This paper presents a novel application of metaheuristic algorithms for solving stochastic programming problems using a recently developed gaining sharing knowledge based optimization (GSK) algorithm.The algorithm is based on human behavior in which people gain and share their knowledge with others.Different types of stochastic fractional programming problems are considered in this study.The augmented Lagrangian method (ALM)is used to handle these constrained optimization problems by converting them into unconstrained optimization problems.Three examples from the literature are considered and transformed into their deterministic form using the chance-constrained technique.The transformed problems are solved using GSK algorithm and the results are compared with eight other state-of-the-art metaheuristic algorithms.The obtained results are also compared with the optimal global solution and the results quoted in the literature.To investigate the performance of the GSK algorithm on a real-world problem, a solid stochastic fixed charge transportation problem is examined, in which the parameters of the problem are considered as random variables.The obtained results show that the GSK algorithm outperforms other algorithms in terms of convergence, robustness, computational time, and quality of obtained solutions.

    Keywords: Gaining-sharing knowledge based algorithm; metaheuristic algorithms;stochastic programming;stochastic transportation problem

    1 Introduction

    Optimization techniques include finding the best suitable values of decision variables that optimize the objective function.They are used in various fields of engineering to solve real-world problems.It has several applications in mechanics, economics, finance, machine learning, computer network engineering, etc.In real-world problems, the exact or deterministic information of the problems is difficult to find; therefore, randomness or uncertainty takes place [1].These problems come under stochastic programming,where the parameters of the problems are characterized by random variables which follow any probabilistic distribution [2].Stochastic programming has several applications in different areas such as transportation[3,4],portfolio optimization[5],supply chain management[6],electrical engineering [7], lot sizing and scheduling [8,9], water resources allocation [10], production planning [11], medical drug inventory [12] etc.The basic idea of solving a stochastic programming problem is to convert probabilistic constraints into their equivalent deterministic constraints and then are solved using analytical or numerical methods.

    Stochastic programming is applied to a large number of problems of which fractional programming problems are considered in this study.The stochastic fractional programming problems(SFPP)optimize the ratio of two functions with some additional constraints, which include at least one parameter that is probabilistic rather than deterministic.Additionally, some of the constraints may be indeterministic.Charles et al.[13–16]considered the sum of the probabilistic fractional objective function and solved by classical approaches.By using classical methods, several difficulties such as finding optimal solution,handling constraints,high-dimensional problems etc.arise.To handle these situations,metaheuristic algorithms have been developed over the last three decades.The algorithms need not to calculate the derivative of the problem and are classified into four categories which are shown in Fig.1 [17,18].These algorithms are nature inspired algorithms such as evolutionary algorithms are inspired by natural evolution, swarm-based algorithms are based on the behaviour of insects or animals,physics-based algorithms are inspired from the physical rule and human based algorithms are based on the philosophy of human activity.

    Figure 1:Classification of metaheuristic algorithms

    Numerous evolutionary, swarm-based, and physics-based algorithms have been developed and applied to solve different real-world problems [19].Claro and Sousa [20] proposed multi-objective metaheuristic algorithms for solving stochastic knapsack problems.Hoff et al.[21]considered a timedependent service network design problem in which the demand is in stochastic nature and the problem is solved using metaheuristic algorithms.Differential Evolution (DE) algorithm with a triangular mutation operator is proposed to solve the optimization problem [22] and applied to the stochastic programming problems[23].Many researchers presented the applications of metaheuristic algorithms in different types of problems such as unconstrained function optimization [24], vehicle routing problems[25–27],machine scheduling[28,29],mine production schedules[30],project selection[31],soil science [32], feature selection problem [33,34], risk identification in supply chain [35] etc.For constrained optimization problems,Particle Swarm Optimization(PSO)with Genetic Algorithm(GA)was presented and compared to other metaheuristic algorithms[36].

    Agrawal et al.[17] presented an extensive review of the scientific literature, from which it can be observed that there are only a few algorithms in the human-based category.Recently, Mohamed et al.[18]developed a gaining sharing knowledge(GSK)based optimization algorithm that typically depends on the ideology of gaining and sharing knowledge during the human life span.The GSK algorithm comes under the human-based algorithm category and has been evaluated over test problems from theCEC2017 benchmark functions for different dimensions.They observed that GSK algorithm gives significantly better results as compared to other metaheuristic algorithms in terms of accuracy,convergence,and can find the optimal solutions.Moreover,Agrawal et al.[37–40]proposed binary versions of the GSK algorithm and applied it to the real-world problems such as feature selection problem,knapsack problem.

    The SFPP problems are solved using classical approaches and obtained the solution by Charles et al.[16].While, Mohamed [22] solved the problems using modified version of DE algorithm and found that the DE algorithm presented better results in comparison to the classical approaches.This implies that the use of metaheuristic algorithm in solving stochastic programming problems will be more efficient and effective approach.

    Therefore, this paper presents SFPP and their deterministic models that are solved using the GSK algorithm.To the best of our knowledge, it is the first study on applying GSK to stochastic programming problems and an application of real-world problems.The obtained solutions are compared with eight other state-of-the-art metaheuristic algorithms, quoted results in the literature [16]and optimal global solution.The state-of-the-art metaheuristic algorithms include two evolutionary algorithms i.e., Genetic Algorithm (GA) [41], Differential Evolution (DE) [42]; three swarm-based algorithms i.e.,Particle Swarm Optimization(PSO)[43],Whale Optimization Algorithm(WOA)[44],Ant Lion Optimizer(ALO)[45];two physics-based algorithms i.e.,Water Cycle Algorithm(WCA)[46],Multi-Verse Optimizer (MVO) [47] and one human-based algorithm i.e., Teaching Learning Based Optimization(TLBO)[48].

    As an application of stochastic programming to real-world problems,a transportation problem is examined under a stochastic environment.Mahapatra et al.[49]considered a stochastic transportation problem in which the parameters of the problem follow extreme value distribution.Yang et al.[3]considered fixed charge transportation problem and used a tabu search algorithm to find the solution.Agrawal et al.[50] solved multi-choice fractional stochastic transportation problems involving Newton’s Divided Difference interpolating polynomial.

    In this study,the transportation problem is considered with multi-objective functions and probabilistic constraints.The main aim of the problem is to minimize the transportation cost and the total transportation time while fulfilling the demand requirements.The problem is solved by the GSK algorithm, other metaheuristic algorithms and the solutions are compared to evaluate the relative performance of the algorithms.

    The organization of the paper is as follows:Section 2 describes the problem definition of SFPP,Section 3 presents the methodology used in solving SFPP.The numerical examples SFPP are shown in Section 4 and Section 5 represents the numerical results of the problems.A case study is given in Section 6 and the analysis of the results is discussed in Section 7 which is followed by the conclusions in Section 8.

    2 Problem Description

    Stochastic programming problems deal with the situations when uncertainty or randomness takes place.This section gives a detailed description of the stochastic fractional programming problems(SFPP)dealing with the optimization of the ratio of functions,in which randomness occurs in at least one of the parameters of the problem.The uncertain parameters are estimated as random variables that follow probability distribution.

    The sum of SFPP is considered from the literature [16], and their mathematical model is demonstrated as:

    subject to

    wherezj∈Z=(z1,z2,,zn) ?Rnare deterministic decision variables and,where,htj,ptjare the coefficients of decision variables in the objectives functions andαt,βtare constants.Out ofNt(Z),Dt(Z),dijandb(i1)at least one parameter is a random variable therefore,the problem is called as sum of SFPP.S= {Z:Eqs. (2), (23) and Z≥0}is non-empty,convex,and compact set in ?n(Feasible Set).There is totalqnumber of constraints in which the number of probabilistic constraints ismand rest are deterministic constraints.dij,eijare the coefficients of decision variables in the constraints,,are the right-hand side of the constraints andis a probability for theithstochastic constraints of SFPP.

    3 Methodology

    This section is divided into two subsections:the first subsection describes the detailed description of the GSK algorithm,and the second presents the constraint handling technique.

    3.1 Gaining Sharing Knowledge-Based Algorithm(GSK)

    Gaining sharing knowledge-based algorithm (GSK) is one of the metaheuristic optimization algorithms [18].GSK depends on the concept of gaining and sharing knowledge in the human life span.The algorithm comprises two stages:

    1.Junior(beginners)gaining and sharing stage

    2.Senior(experts)gaining and sharing stage

    In the human life span,all persons gain and share knowledge or views with others.The persons from early middle age gain knowledge through their small connections such as from family members,relatives and want to share their views or opinions with others who may or may not belong to their group.Similarly, people from middle later age gain knowledge by interacting with their colleagues,friends,etc.They have the experience to judge people and categorize them as good or bad.Also,they share their views or opinions with experienced or suitable persons so that their knowledge may be enhanced.

    The process,as mentioned above,can be mathematically formulated in the following steps:

    Step 1:In the first step,the number of persons are assumed(Number of population sizeNpop).Letzi (i=1,2,,Npop)be an individual of a populationzij=(zi1,zi2,,ziN),whereNis branch of knowledge assigned to an individual.andFi (i=1,2,,Npop)are the corresponding objective function values.

    Step 2:At the beginning of the search,the number of dimensions for the junior and senior stage should be computed.The number of dimensions that should be changed or updated during both the stages must set on,and it is calculated by a non-linear decreasing and increasing equation:

    Step 3:Junior gaining sharing knowledge stage:In this stage, early-middle aged people gain knowledge from their small networks.Due to the curiosity of exploring others,they share their views or skills with other people who may or may not belong to their group.Thus,individuals are updated as follows:

    1.According to objective function values, the individuals are arranged in ascending order aszbest,...,zi-1,zi,zi+1,...,zworst

    2.For everyzi (i=1,2,,Npop),select the nearest best(zi-1)and worstzi+1to gain the knowledge,also select randomly(zr)to share the knowledge.Therefore,the updated new individual is as

    where,kf >0 is the knowledge factor.

    Step 4:Senior gaining sharing knowledge stage:This stage comprises the impact and effect of other people(good or bad)on an individual.The updation of the individual can be computed as follows:

    1.The individuals are classified into three categories (best, middle and worst) after sorting individuals in ascending order (based on the objective function values).best individual =100p%(zp-best),middle individual=N-2 100p%(zmiddle),worst individual=100p%(zp-worst).

    2.For every individualzi,choose two random vectors of the top and bottom 100p%individual for gaining part and the third one(middle individual)is chosen for the sharing part.Therefore,the new individual is as

    where,p∈[0,1]is the percentage of best and worst classes.

    The flow chart of GSK is shown in Fig 2.

    Figure 2:The flow chart of GSK algorithm

    3.2 Constraint Handling Technique

    To solve constrained optimization problems,different types of constraint handling techniques are used [51,52].Deb [53] introduced an efficient constraint handling technique which is based on the feasibility rules.The most commonly used approach to handle the constraints is the penalty function method,in which the infeasible solutions are punished with some penalty for violating the constraints.The mathematical formulation of a constrained optimization problem is given as

    subject to

    Eq.(8) represents the objective function, Eq.(9) describes the inequality constraints and Eq.(10)describes the equality constraints.In this study, the augmented Lagrange method (ALM) is used to solve the constrained problem by converting it into an unconstrained optimization problem with some penalty to the original objective function.Bahreininejad [54] introduced ALM for the water cycle algorithm and solved real-time problems.The original optimization problem is transformed into the following unconstrained optimization problem:

    where,f(Z) is the objective function given in the problem, Δ is the quadratic penalty parameter,is quadratic penalty term andλis the Lagrange multiplier.

    The ALM is similar to the penalty approach method in which the penalty parameter is chosen as large as possible.In ALM,δandλare chosen in such a way thatλcan remain small to maintain the strategic distance from ill conditions.The advantage of ALM is that it reduces the possibility of ill-conditioning happening in the penalty approach method.

    4 Numerical Examples

    The three test examples of the sum of SFPP were taken from Charles et al.[16].The detailed description of each example can be found in[16].

    4.1 Example 1

    subject to

    d11z1+d12z2≤1;d21z1+d22z2≤b2; 16z1+z2≤4;z1,z2≥0

    The aforementioned problem is converted into deterministic one and the model is given as[16]:

    4.2 Example 2

    subject to

    The deterministic model of the example is given as:

    4.3 Example 3

    subject to

    d11z1+d12z2+d13z13≤27; 5z1+3z2+z3≤12;z1,z2≥0

    The deterministic model of the example is given as:

    5 Numerical Results

    This section describes the parameters settings of the algorithms and the obtained results of the numerical examples.

    5.1 Parameter Settings

    The user defined parameters of the GSK algorithm are number of population(Npop),knowledge factor(kf),knowledge ratio(kr)and knowledge rate(k)and the considered values of each parameter areNpop=50,kf=0.5,kr=0.9,k=10(taken from[18]).The percentage of best and worst classes in senior gaining sharing knowledge stage isp= 0.1.The parameters used in the ALM are Δ = 102andλ=-104.Also,the values of parameters of all compared algorithms are given in Tab.1.

    Table 1:Parameters Values for all compared algorithms

    The following conditions are assumed:

    1.To terminate the algorithms,the maximum number of function evaluations is assumed[55].

    2.To handle the constraints,the parameter used in the ALM depends on each example.

    3.A total of 25 independent runs are conducted,and the best results are recorded throughout the process.

    4.The results are compared among the algorithms (GSK, GA, DE, PSO, ALO, WOA, WCA,MOV,and TLBO)and a previous study[16].

    5.The numerical results are shown in terms of maximum(best)objective value,minimum(worst)objective value,average objective value,standard deviation,and coefficient of variation(C.V.).

    6.The results are obtained for the deterministic objective functionF(Z).

    5.2 Simulation Results

    The considered numerical examples are solved by the GSK and other metaheuristic algorithms using MATLAB R2015a on a personal computer havingInter Core?i5@2.50GHzprocessor with 4GB RAM.To fair comparisons and obtain the optimal global solutions,the examples are solved by LINGO 11.0 and the obtained results of each example are presented in Tabs.2–4.

    Table 2:Experimental results of example 1

    Table 3:Experimental results of example 2

    The results of example 1 depict that all the algorithms can find a feasible solution to the problem.GSK,DE,and TLBO obtained the solutions equal to the optimal global solution(F(z)=1.83246)with a minimum standard deviation.The convergence graph of the GSK algorithm with other metaheuristic algorithms is presented in Fig.3 in which the comparison is shown among the GSK and other algorithms.The convergence graph shows that GSK has the best convergence as compared to the other algorithms.Also,the average elapsed time taken by the GSK algorithm is less than others,which is presented in Fig 6.Moreover,the results obtained by metaheuristic algorithms are much better than the results in the literature(Charles et al.[16])except for the PSO algorithm.Therefore,the values of decision variables obtained by GSK algorithm areγ1= 1.83246,γ2= 0,z1= 0.202324,z2=0.165433 and the values of the constraints are [-0.5901, -5.9157e-07, -0.4956, -0.5974],that describes the feasibility of the solutions.

    Figure 3:The convergence graph for the solution of Example 1

    For the solution of example 2, the results are presented in Tab.3.It indicates that the solutions obtained by GSK,DE,and TLBO are equal to optimal solution with zero standard deviation,which implies that these are efficient algorithms to solve the problem.The obtained results are better than the results in(Charles et al.[16]).Moreover,the computational time is also noted throughout the process.The average elapsed time taken by all algorithms is shown in Fig.6,which establishes that the GSK algorithm takes less computational time as compared to others.Also, Fig.4 shows the convergence graph of the GSK algorithm with other algorithms.To show the feasibility of the solutions,the values of the constraints are [0, -2.7569e-06, -1.9445, -0.0536, -3.9992] and the values of the decision variables areγ1= 15.22559,γ2= 0,γ3= 0,z1= 0,z2= 1.424836,z3= 1.681578 that are obtained by GSK algorithm.

    Similarly, example 3 is also solved by the GSK algorithm and the other algorithms.The results are shown in Tab.4 in terms of maximum(best),minimum(worst)and average objective value with their standard deviations and coefficient of variation.All algorithms GSK, GA, DE, PSO, WOA,ALO,WCA,MVO,and TLBO can find the solution,but GSK and ALO algorithm find the optimal solution,which has a 0%difference from the optimal global solution.The objective function value in(Charles et al.[16])is 3.6584 which is 53.5%of the global optimal solution (7.8808).The convergence graph of example 3 by GSK and other algorithms is shown in Fig.5.The average computational time is presented in Fig.6, which indicates that the GSK algorithm takes very less computational time.The results obtained by GSK algorithm are:Objective function value=7.8808,value of the decision variablesγ1= 0,γ2= 7.88078,z1= 2.4,z2= 0,z3= 0 and the value of the constraints are[6.7823e-05, -14.2167,0].

    Figure 4:The convergence graph for the solution of Example 2

    Table 4:Experimental results of example 3

    5.3 Statistical Analysis

    To validate the results obtained from the GSK and other algorithms, two non-parametric statistical tests i.e.,F(xiàn)riedman test and Wilcoxon signed rank test are performed using IBM SPSS 20.

    5.3.1 Friedman Test

    To compare the performance of algorithms simultaneously, the Friedman test is conducted by calculating their mean ranks.The null hypothesis is “There is no significant difference among the performance of the algorithms”whereas the alternative hypothesis is“There is significant difference among the performance of the algorithms”.Using the Friedman test,the mean rank is obtained for each example and the acquired results are shown in Tab.5.According to obtained mean ranks, the ranks are assigned to the algorithms.The high ranks are assigned to the larger value of mean rank and higher ranks indicate the better performance of the algorithm.The same is shown in Fig.7 for each example.From Tab.5,it can be observed that the GSK algorithm obtains first rank among others for each example.Moreover,it is noted that all the algorithms have significant differences at the 5%level(p-value=0.00<0.05)therefore,to check the pairwise comparison,the Wilcoxon signed rank test is also performed.

    Figure 5:The convergence graph for the solution of Example 3

    Figure 6:Average Elapsed time of example 1,2 and 3 for all algorithms

    Table 5:Results of Friedman Test

    Figure 7:The mean ranks of the algorithms obtained by Friedman test

    5.3.2 Wilcoxon Signed Rank Test

    To check the pairwise comparison between the algorithms(GSKvs.GA,GSKvs.DE,GSKvs.PSO,GSKvs.ALO,GSKvs.WOA,GSKvs.WCA,GSKvs.MVO and GSKvs.TLBO),Wilcoxon signed-rank test is performed at the 5% level of significance.The obtained results are presented in Tab.6, in whichS+,S-denote the sum of positive ranks and negative ranks, respectively.From Tab.6,it can be observed that the GSK algorithm obtains a higherS+value thanS-for every pairwise comparison.As obtainedp-value<0.05,it can be observed that the GSK algorithm performs better when compared to all other algorithms.6.

    Table 6:Results of Wilcoxon signed rank test

    Table 7:Nomenclature of solid stochastic fixed charge transportation problem

    6 A Case Study

    This section contains a case study based on a stochastic transportation problem.The transportation problem is considered with cost objective function in which the main aim is to minimize the total transportation cost and find the total transportation time in Tab.7.

    A cement company transports cement from its 4 distributors (source locations) to 5 retailers(destination locations)with 2 conveyances.In this problem,two categories of transportation cost are asummed:direct costs and fixed costs.The direct cost is paid according to per unit of the transport product and the fixed cost will be charged if the transportation facility occurs between source locations to destination locations.Mathematically,the fixed cost can be formulated by introducing the variables as:

    Thus,the total transportation cost can be calculated as

    Also, the total transportation time will be minimized when the transportation activity holds betweenithsource locations totthdestination locations.Thus, the objective function for the total transportation time can be formulated as

    In the classical transportation problem,the data is already known to the decision maker but in realworld problem,the data cannot be obtained in advance.It can be obtained by statistical experience or observed from a previous activity.Hence, the parameters of the problem;ai,bt,qk,αitk,βitk,ξitkare treated as random variables.Therefore, the problem becomes a solid stochastic fixed charge transportation problem (SSFCTP).The mathematical model of the SSFCTP can be formulated as:

    subject to

    where,γi,ηt,ζkare probability confidence levels.

    In order to obtain the solution of the problem,the usual procedure cannot be applied.Since the parameters in the objective functions are random variables,the expected minimization model is used to obtain the optimal solution and the chance constrained technique is applied to the probabilistic constraints.The data used for the said problem is taken from Yang et al.[3].

    The problem is solved by the GSK and the other algorithms (TLBO, DE, WCA, GA, MVO,WOA).The independent runs for every algorithm are taken to be 15 and, the results are noted throughout the process.The obtained solutions are shown in Tab.8.It can be observed that the GSK algorithm gives the lowest transportation cost (fcost= 1360.4) as compared to the other algorithms.In the case of average cost,the GSK algorithm has the minimum average cost relative to the other algorithms.The minimum and average transportation costs are also presented in Fig.8 which describes that the GSK algorithm is more efficient in comparison with others.The corresponding total transportation time taken by all transportation activities isftime= 42 hours and the optimal transportation plan is:z112= 0.03,z121= 0.02,z141= 0.06,z212= 27.57,z221= 27.67,z222=18.36,z241=0.02,z442=34.45 and all other decision variables are zero.

    Table 8:The transportation cost obtained by algorithms

    Figure 8:The average and minimum transportation cost

    To validate the efficiency and robustness of the GSK algorithm, Friedman Test and Wilcoxon signed-rank test are performed.The obtained results from the tests are shown in Tabs.9 and 10 respectively.To check the difference among all the algorithms,the Friedman test is applied and it is observed that they are significantly different at (5%)level.To know the pairwise comparison between the GSK algorithm and all other considered algorithms,Wilcoxon signed-rank test is performed.It can be observed that the GSK algorithm is significantly different when compared to other algorithms at the (5%)level except for the TLBO algorithm.

    7 Results Analysis

    From the experimental results,it can be observed that the GSK algorithm performs better in all SFPP examples in terms of convergence,robustness and ability to find the optimal solutions.

    In example 1, ALO, PSO, WOA algorithms have premature convergence and do not find the optimal solution of the problem.While GSK algorithm has a fast convergence speed and does not trap into local optima due to its good exploration and exploitation quality.It explores the search space efficiently and effectively and converges to the optimal solution.Moreover,the GSK algorithm proves its robustness quality by obtaining zero standard deviation in all the test examples of SFPP.In case of other algorithms,the techniques do not converge to the optimal solution in every simulation.Also,due to two main pillars of the GSK algorithm i.e.,junior and senior gaining sharing stage,the algorithm can find the optimal solution with great convergence.Hence,it can be concluded that the GSK algorithm is a very effective approach to solve the SFPP.

    Table 9:Results of Friedman test for SSFCTP

    Table 10:Results of Wilcoxon test for SSFCTP

    In addition,the GSK algorithm shows promising results in comparison with other metaheuristic algorithms.While other algorithms are not even able to find the optimal solution to the SFPP problem,GSK algorithm convergences to the optimal solution at an early stage of the optimization process.It makes a proper balance between its exploration and exploitation characteristics and finds the solution.Moreover,it consumes very less computational time which is an important characteristic to find the optimal solution.Statistically, it is also shown that the GSK algorithm presents significantly better results as compared to other algorithms by applying statistical tests.

    Moreover, based on the results of the stochastic transportation problem, all algorithms other than the GSK did not perform well and also did not obtain the minimum transportation cost of the problem.However,the GSK algorithm obtained the minimum transportation cost and transportation time of the problem, this proves its efficiency to solve real-world problems.Thus, it can be used to solve all optimization problems (unconstrained, constrained and multi-objective) with both discrete and continuous spaces.It is considered a general-purpose algorithm and easy to understand and implement.

    8 Concluding Remarks

    This paper describes an application of a recently developed gaining sharing knowledge-based algorithm (GSK) to stochastic programming.GSK algorithm is a metaheuristic algorithm which is based on the human activity of gaining and sharing knowledge.To check the performance of the algorithm in terms of convergence and finding the optimal solution, GSK is applied to stochastic fractional programming problems with three different types of numerical examples.For comparative assessment, metaheuristic algorithms from each category, such as GA and DE from evolutionary algorithms;PSO,ALO,and WOA from swarm-based algorithms;WCA and MVO from physics-based algorithm;and TLBO from human-based algorithms are considered.

    From the comparative results,it can be concluded that the GSK algorithm performs better than other algorithms.It converges to the optimal solution rapidly and takes less computational time.The obtained results are also compared with the global optimal solution and results from a previous study.For a fair comparison,non-parametric statistical tests(Friedman test and Wilcoxon signed-rank test)are conducted at 5%level of significance and the GSK algorithm proves that it is significantly different from other algorithms and outperforms them.

    Besides, a solid stochastic fixed charge transportation problem, a real-world application of stochastic programming, is studied under a stochastic environment, in which all parameters of the problem are treated as random variables.The main objective of the problem is to find the optimal transportation plan which has minimum transportation cost and minimum transportation time,satisfying all the constraints.Metaheuristic algorithms are applied to the problem and solutions are obtained.From the obtained results, it is observed that the GSK algorithm gives the minimum transportation cost (fcost= 1360.4) and minimum transportation time (ftime= 42) as compared to other algorithms in less computational time.

    From these results,it can be concluded that the GSK algorithm performs significantly better than other metaheuristic algorithms.It is highly noted that the empirical analysis of this study may differ on another benchmark set or real-world problems according to the no-free-lunch theorem.

    Acknowledgement:The authors would like to thank the Editor and the reviewers for their valuable suggestions,that helped us to improve the quality of the paper.

    The authors present their appreciation to King Saud University for funding this work through Researchers Supporting Project Number (RSP-2021/305), King Saud University, Riyadh,Saudi Arabia.

    Funding Statement:The research is funded by Researchers Supporting Program at King Saud University,(Project#RSP-2021/305).

    Conflicts of Interest:The authors declare that they have no conflicts of interest to report regarding the present study.

    黄色视频在线播放观看不卡| 人体艺术视频欧美日本| av播播在线观看一区| 国产欧美另类精品又又久久亚洲欧美| 欧美xxxx黑人xx丫x性爽| 国产无遮挡羞羞视频在线观看| 午夜免费观看性视频| 久久久久久久久久人人人人人人| 国产成人91sexporn| 午夜免费鲁丝| 蜜桃亚洲精品一区二区三区| 一个人看视频在线观看www免费| 亚洲激情五月婷婷啪啪| 国产国拍精品亚洲av在线观看| 91精品伊人久久大香线蕉| 嘟嘟电影网在线观看| 欧美高清成人免费视频www| 永久免费av网站大全| 我的女老师完整版在线观看| 婷婷色综合www| 新久久久久国产一级毛片| 国产精品一区二区三区四区免费观看| 亚洲精品日韩av片在线观看| 国精品久久久久久国模美| 久久精品久久久久久久性| 80岁老熟妇乱子伦牲交| 久久久午夜欧美精品| 精品久久国产蜜桃| 少妇人妻精品综合一区二区| 色5月婷婷丁香| 这个男人来自地球电影免费观看 | 国产av码专区亚洲av| 看非洲黑人一级黄片| 青青草视频在线视频观看| 午夜激情福利司机影院| 中文资源天堂在线| av国产免费在线观看| 国产精品女同一区二区软件| 国产v大片淫在线免费观看| 日日摸夜夜添夜夜添av毛片| 日本与韩国留学比较| av一本久久久久| 国产老妇伦熟女老妇高清| 丝袜喷水一区| 亚洲精品aⅴ在线观看| 精品午夜福利在线看| 婷婷色综合www| 丝袜喷水一区| 国产永久视频网站| 黑人猛操日本美女一级片| 乱系列少妇在线播放| 成人一区二区视频在线观看| 在线观看av片永久免费下载| 免费久久久久久久精品成人欧美视频 | 九九爱精品视频在线观看| 亚洲国产日韩一区二区| 久久99热这里只有精品18| 美女福利国产在线 | 国产极品天堂在线| 久久久久久久精品精品| 内地一区二区视频在线| 国产av码专区亚洲av| 亚洲一级一片aⅴ在线观看| 亚洲综合精品二区| 亚洲第一av免费看| 91午夜精品亚洲一区二区三区| 一边亲一边摸免费视频| 免费在线观看成人毛片| 国产在线视频一区二区| 一区二区av电影网| 日韩欧美精品免费久久| 青春草视频在线免费观看| 成人毛片60女人毛片免费| 高清av免费在线| av女优亚洲男人天堂| 男人添女人高潮全过程视频| 午夜日本视频在线| 国产黄片视频在线免费观看| 国产视频内射| 日日啪夜夜爽| 一本久久精品| 亚洲精品乱码久久久久久按摩| 亚洲熟女精品中文字幕| 一个人看的www免费观看视频| 国产黄频视频在线观看| 一本—道久久a久久精品蜜桃钙片| 91久久精品国产一区二区三区| 亚洲成人手机| 99热全是精品| 在线观看一区二区三区激情| 不卡视频在线观看欧美| 国产免费一级a男人的天堂| 五月伊人婷婷丁香| av一本久久久久| 我要看黄色一级片免费的| 建设人人有责人人尽责人人享有的 | 美女高潮的动态| av在线app专区| 一个人看视频在线观看www免费| 成人毛片60女人毛片免费| 街头女战士在线观看网站| 国产成人精品婷婷| 精品少妇久久久久久888优播| 国精品久久久久久国模美| 高清毛片免费看| 色网站视频免费| 日韩三级伦理在线观看| 国产精品国产三级国产专区5o| 99re6热这里在线精品视频| 欧美bdsm另类| 国产淫片久久久久久久久| 国产又色又爽无遮挡免| 日本av免费视频播放| av国产精品久久久久影院| 久久99热这里只有精品18| 日本一二三区视频观看| 亚洲精华国产精华液的使用体验| 国产一区二区三区av在线| 久久97久久精品| 欧美 日韩 精品 国产| .国产精品久久| 各种免费的搞黄视频| 成年人午夜在线观看视频| 另类亚洲欧美激情| 亚洲欧美成人综合另类久久久| 亚洲国产最新在线播放| 国产色婷婷99| 欧美日韩在线观看h| 高清不卡的av网站| 久久精品国产亚洲网站| 丝袜喷水一区| 国产精品人妻久久久久久| 波野结衣二区三区在线| 五月伊人婷婷丁香| 丰满乱子伦码专区| 99久久综合免费| 久久久久国产精品人妻一区二区| 国产精品麻豆人妻色哟哟久久| 人妻夜夜爽99麻豆av| 91久久精品国产一区二区三区| 免费看日本二区| 免费av不卡在线播放| 亚洲一级一片aⅴ在线观看| 国产成人aa在线观看| 色5月婷婷丁香| 26uuu在线亚洲综合色| 精品久久久精品久久久| 亚洲精华国产精华液的使用体验| 黄片wwwwww| 婷婷色综合www| 大又大粗又爽又黄少妇毛片口| 亚洲精品乱码久久久久久按摩| 天美传媒精品一区二区| 中文字幕人妻熟人妻熟丝袜美| 身体一侧抽搐| 91在线精品国自产拍蜜月| 久久精品国产鲁丝片午夜精品| 国产精品一区二区性色av| 激情 狠狠 欧美| 欧美 日韩 精品 国产| 国产精品久久久久久久电影| a级毛片免费高清观看在线播放| 欧美丝袜亚洲另类| 插逼视频在线观看| 青春草亚洲视频在线观看| 中文字幕制服av| 高清午夜精品一区二区三区| 一级a做视频免费观看| 国产片特级美女逼逼视频| 久久精品国产鲁丝片午夜精品| 国产成人一区二区在线| 精品人妻偷拍中文字幕| 久久久久久伊人网av| 一区二区三区四区激情视频| 一区二区三区乱码不卡18| 三级国产精品片| 男人添女人高潮全过程视频| 国产白丝娇喘喷水9色精品| 久久久午夜欧美精品| 亚洲精品国产成人久久av| 老司机影院成人| 久久精品熟女亚洲av麻豆精品| 黑丝袜美女国产一区| 亚洲美女视频黄频| 青春草国产在线视频| 亚洲色图av天堂| 啦啦啦在线观看免费高清www| 韩国av在线不卡| av福利片在线观看| 青青草视频在线视频观看| 国产 一区 欧美 日韩| 亚洲激情五月婷婷啪啪| 日本一二三区视频观看| 尾随美女入室| 一级a做视频免费观看| 中文字幕制服av| 1000部很黄的大片| 国产精品久久久久久av不卡| 日韩在线高清观看一区二区三区| 亚洲美女视频黄频| 欧美3d第一页| 国产永久视频网站| 婷婷色综合www| 人妻一区二区av| 美女国产视频在线观看| 亚洲成人一二三区av| 国产熟女欧美一区二区| 嫩草影院新地址| 免费少妇av软件| 91aial.com中文字幕在线观看| 97热精品久久久久久| 成人午夜精彩视频在线观看| 高清日韩中文字幕在线| 美女视频免费永久观看网站| 制服丝袜香蕉在线| 美女内射精品一级片tv| 国产精品人妻久久久久久| 久久久成人免费电影| 少妇熟女欧美另类| 国产av精品麻豆| 噜噜噜噜噜久久久久久91| videos熟女内射| 中文欧美无线码| 国产精品久久久久成人av| 熟女av电影| 亚洲综合色惰| 在线亚洲精品国产二区图片欧美 | 国产探花极品一区二区| 亚洲精品国产成人久久av| av黄色大香蕉| 3wmmmm亚洲av在线观看| 久久99热6这里只有精品| 国产熟女欧美一区二区| 91久久精品国产一区二区成人| 男女无遮挡免费网站观看| 最新中文字幕久久久久| 51国产日韩欧美| 99精国产麻豆久久婷婷| 国产精品嫩草影院av在线观看| 大又大粗又爽又黄少妇毛片口| 亚洲精品,欧美精品| 少妇猛男粗大的猛烈进出视频| 亚洲美女搞黄在线观看| 夫妻性生交免费视频一级片| 免费不卡的大黄色大毛片视频在线观看| 狂野欧美激情性bbbbbb| 欧美人与善性xxx| 国产伦精品一区二区三区视频9| 久久久色成人| 欧美+日韩+精品| 国内揄拍国产精品人妻在线| 成人漫画全彩无遮挡| 久久99热6这里只有精品| 亚洲欧美日韩东京热| 草草在线视频免费看| 精品久久久久久久末码| 精品亚洲成a人片在线观看 | 一个人免费看片子| 日韩精品有码人妻一区| 又大又黄又爽视频免费| 狂野欧美激情性bbbbbb| 永久免费av网站大全| 精品久久久久久久末码| 十八禁网站网址无遮挡 | 日韩 亚洲 欧美在线| 女人久久www免费人成看片| 黑人猛操日本美女一级片| 乱码一卡2卡4卡精品| 日本av免费视频播放| 国产 精品1| 国产有黄有色有爽视频| 91精品伊人久久大香线蕉| kizo精华| 国产精品欧美亚洲77777| 丝瓜视频免费看黄片| av在线观看视频网站免费| 日本一二三区视频观看| 色综合色国产| 日本猛色少妇xxxxx猛交久久| 欧美成人午夜免费资源| 久久精品国产自在天天线| 国产乱来视频区| 亚洲欧美一区二区三区黑人 | 又大又黄又爽视频免费| 深爱激情五月婷婷| 男人狂女人下面高潮的视频| 色综合色国产| 亚州av有码| 久久精品国产亚洲网站| 国产在线视频一区二区| 亚洲美女视频黄频| 免费观看的影片在线观看| 成人一区二区视频在线观看| 只有这里有精品99| 亚洲色图综合在线观看| 伊人久久国产一区二区| 国产高潮美女av| 搡老乐熟女国产| 亚洲精品456在线播放app| 免费观看av网站的网址| 九色成人免费人妻av| 久久国内精品自在自线图片| 又爽又黄a免费视频| 最近中文字幕2019免费版| 色哟哟·www| 亚洲av综合色区一区| 免费看光身美女| 国产真实伦视频高清在线观看| 丰满迷人的少妇在线观看| 内地一区二区视频在线| 亚洲欧美精品自产自拍| 久久影院123| 国产精品一二三区在线看| 久久鲁丝午夜福利片| 各种免费的搞黄视频| 午夜激情福利司机影院| 日本黄色日本黄色录像| 99热国产这里只有精品6| 99久久综合免费| 成人综合一区亚洲| 国产一区二区三区av在线| 热99国产精品久久久久久7| 亚洲欧美成人精品一区二区| 欧美日韩精品成人综合77777| 女人十人毛片免费观看3o分钟| 香蕉精品网在线| 99视频精品全部免费 在线| 中文精品一卡2卡3卡4更新| 性色av一级| 国产成人一区二区在线| 3wmmmm亚洲av在线观看| 亚洲婷婷狠狠爱综合网| 超碰97精品在线观看| 免费大片黄手机在线观看| 久久99热这里只有精品18| 一级毛片我不卡| 80岁老熟妇乱子伦牲交| 在线观看一区二区三区| 99久国产av精品国产电影| 成人午夜精彩视频在线观看| 国产午夜精品久久久久久一区二区三区| 久久午夜福利片| 国产 一区 欧美 日韩| av福利片在线观看| 亚洲精品乱久久久久久| 一区二区三区乱码不卡18| 赤兔流量卡办理| 在线观看免费日韩欧美大片 | 九草在线视频观看| 久久久久久伊人网av| 亚洲精品第二区| 免费看光身美女| 亚洲综合色惰| a级毛色黄片| 夜夜看夜夜爽夜夜摸| 激情五月婷婷亚洲| 日本黄色片子视频| 三级经典国产精品| 嫩草影院新地址| 久久国产精品男人的天堂亚洲 | 日韩大片免费观看网站| 在线 av 中文字幕| 人妻 亚洲 视频| 日韩不卡一区二区三区视频在线| 亚洲精品国产av成人精品| 99国产精品免费福利视频| 九色成人免费人妻av| 国产一级毛片在线| 国产精品久久久久久久电影| 精品一区在线观看国产| 中文字幕免费在线视频6| 91午夜精品亚洲一区二区三区| av国产久精品久网站免费入址| 欧美97在线视频| 久久久久久伊人网av| 一级av片app| 国产av精品麻豆| 偷拍熟女少妇极品色| 高清在线视频一区二区三区| 国产精品偷伦视频观看了| 男人爽女人下面视频在线观看| 亚洲国产精品999| 搡女人真爽免费视频火全软件| 一本一本综合久久| 性高湖久久久久久久久免费观看| 国产男人的电影天堂91| 午夜精品国产一区二区电影| 精品熟女少妇av免费看| 日日摸夜夜添夜夜爱| 另类亚洲欧美激情| 久久久久久久久大av| 最近2019中文字幕mv第一页| 国产白丝娇喘喷水9色精品| 最近中文字幕高清免费大全6| 亚洲国产毛片av蜜桃av| 欧美日韩精品成人综合77777| 天堂俺去俺来也www色官网| 美女脱内裤让男人舔精品视频| 少妇裸体淫交视频免费看高清| 亚洲精品一区蜜桃| 亚洲美女黄色视频免费看| 亚洲欧美中文字幕日韩二区| 天堂中文最新版在线下载| 欧美日韩亚洲高清精品| 婷婷色麻豆天堂久久| 高清欧美精品videossex| 亚洲无线观看免费| 视频区图区小说| 乱系列少妇在线播放| 黄色日韩在线| 有码 亚洲区| 99热这里只有精品一区| 日本与韩国留学比较| 亚洲人与动物交配视频| 亚洲最大成人中文| 男女国产视频网站| 80岁老熟妇乱子伦牲交| 国产成人91sexporn| 99热全是精品| 欧美区成人在线视频| 国产精品爽爽va在线观看网站| 干丝袜人妻中文字幕| 身体一侧抽搐| 国产黄片视频在线免费观看| 国产午夜精品一二区理论片| 日本vs欧美在线观看视频 | 精品亚洲成a人片在线观看 | 国产 精品1| 国产精品一区二区在线观看99| 观看美女的网站| 日韩一区二区视频免费看| 少妇被粗大猛烈的视频| 一区二区三区乱码不卡18| 亚洲色图av天堂| 久久国产亚洲av麻豆专区| 高清视频免费观看一区二区| av免费观看日本| 久久久久国产精品人妻一区二区| 肉色欧美久久久久久久蜜桃| 毛片一级片免费看久久久久| 亚洲无线观看免费| 国产男女内射视频| 国产色爽女视频免费观看| av免费在线看不卡| 久久精品国产a三级三级三级| 国内少妇人妻偷人精品xxx网站| 男人和女人高潮做爰伦理| 插逼视频在线观看| av卡一久久| 伦精品一区二区三区| 免费不卡的大黄色大毛片视频在线观看| 国产乱来视频区| 日日啪夜夜撸| 国产中年淑女户外野战色| 亚洲av欧美aⅴ国产| 啦啦啦视频在线资源免费观看| 尤物成人国产欧美一区二区三区| 一区二区三区精品91| 久久久精品免费免费高清| av免费观看日本| 最近的中文字幕免费完整| 国产黄片美女视频| 一级片'在线观看视频| 久久精品国产鲁丝片午夜精品| 亚洲欧美日韩无卡精品| 日本一二三区视频观看| 人人妻人人澡人人爽人人夜夜| 女人十人毛片免费观看3o分钟| kizo精华| 国产亚洲午夜精品一区二区久久| 新久久久久国产一级毛片| 男女下面进入的视频免费午夜| 狂野欧美激情性bbbbbb| 成人亚洲精品一区在线观看 | 久久精品久久久久久久性| 黄片无遮挡物在线观看| 久久精品久久久久久久性| 国内少妇人妻偷人精品xxx网站| 免费观看的影片在线观看| 夜夜看夜夜爽夜夜摸| 久久久久国产精品人妻一区二区| 看非洲黑人一级黄片| 国产高清三级在线| 国产精品精品国产色婷婷| 三级经典国产精品| a 毛片基地| 日本色播在线视频| 国产亚洲av片在线观看秒播厂| 欧美另类一区| 女人久久www免费人成看片| 国产精品久久久久成人av| 亚洲精品久久久久久婷婷小说| 国产欧美日韩一区二区三区在线 | 久久精品久久久久久噜噜老黄| 一个人免费看片子| 欧美性感艳星| 熟女电影av网| 建设人人有责人人尽责人人享有的 | 美女xxoo啪啪120秒动态图| 亚洲经典国产精华液单| a 毛片基地| av免费观看日本| 少妇精品久久久久久久| 国产视频首页在线观看| 日韩国内少妇激情av| 能在线免费看毛片的网站| 亚洲激情五月婷婷啪啪| 国产久久久一区二区三区| 欧美精品国产亚洲| 国产一区二区三区综合在线观看 | 日韩av在线免费看完整版不卡| 国产精品伦人一区二区| 大码成人一级视频| 亚洲性久久影院| 亚洲综合精品二区| 久久99蜜桃精品久久| 丝瓜视频免费看黄片| 夫妻午夜视频| 成人亚洲精品一区在线观看 | 国产有黄有色有爽视频| 久久人人爽人人片av| 99久久精品热视频| 久久婷婷青草| av国产精品久久久久影院| 国产免费福利视频在线观看| 啦啦啦啦在线视频资源| 亚洲自偷自拍三级| 国产在线视频一区二区| 国产淫片久久久久久久久| 免费人妻精品一区二区三区视频| 一级av片app| 久久精品国产自在天天线| 欧美一级a爱片免费观看看| 在线观看国产h片| 尾随美女入室| 高清不卡的av网站| 亚洲电影在线观看av| 青春草国产在线视频| 一级毛片 在线播放| 午夜免费男女啪啪视频观看| 天天躁日日操中文字幕| 亚洲一区二区三区欧美精品| 又爽又黄a免费视频| 国产精品一区二区在线不卡| 熟女电影av网| 亚洲精品中文字幕在线视频 | 激情 狠狠 欧美| 美女脱内裤让男人舔精品视频| 麻豆精品久久久久久蜜桃| 99久久中文字幕三级久久日本| 色5月婷婷丁香| 2021少妇久久久久久久久久久| 成人黄色视频免费在线看| 国产免费又黄又爽又色| 免费观看无遮挡的男女| 男女啪啪激烈高潮av片| av线在线观看网站| 搡老乐熟女国产| 夜夜看夜夜爽夜夜摸| 亚洲精品中文字幕在线视频 | 久久青草综合色| 成人毛片60女人毛片免费| 久久久久久久国产电影| 久久久精品94久久精品| 人体艺术视频欧美日本| 成人二区视频| 免费久久久久久久精品成人欧美视频 | 免费播放大片免费观看视频在线观看| 日韩欧美一区视频在线观看 | 又爽又黄a免费视频| 美女xxoo啪啪120秒动态图| 欧美xxⅹ黑人| 纯流量卡能插随身wifi吗| 免费久久久久久久精品成人欧美视频 | 国产精品秋霞免费鲁丝片| 18+在线观看网站| 最近手机中文字幕大全| 婷婷色综合大香蕉| 欧美变态另类bdsm刘玥| 久久毛片免费看一区二区三区| 午夜福利视频精品| 天天躁夜夜躁狠狠久久av| 蜜桃久久精品国产亚洲av| 国产高清国产精品国产三级 | 少妇 在线观看| av免费在线看不卡| 日韩,欧美,国产一区二区三区| 在线免费十八禁| 亚洲欧美成人综合另类久久久| 亚洲精品一二三| 国产精品熟女久久久久浪| 亚洲欧美成人综合另类久久久| 欧美老熟妇乱子伦牲交| 色婷婷久久久亚洲欧美| 少妇丰满av| 久久毛片免费看一区二区三区| 亚洲欧美清纯卡通| 久久精品国产自在天天线| 蜜桃在线观看..| 男人和女人高潮做爰伦理| 少妇人妻 视频| 国产成人一区二区在线| 简卡轻食公司| 亚洲美女视频黄频| 午夜免费男女啪啪视频观看| av不卡在线播放| 草草在线视频免费看| 欧美激情国产日韩精品一区| 水蜜桃什么品种好| 国产精品一及| 成人高潮视频无遮挡免费网站| 国产成人aa在线观看| 在线观看一区二区三区| 男人添女人高潮全过程视频| 久久ye,这里只有精品|