• <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.

    热99re8久久精品国产| 脱女人内裤的视频| av免费在线观看网站| 女人被躁到高潮嗷嗷叫费观| 久久av网站| 国产精品 国内视频| 日本wwww免费看| 精品国产乱子伦一区二区三区 | 女性生殖器流出的白浆| 国产精品国产av在线观看| 国产真人三级小视频在线观看| 人妻 亚洲 视频| 老汉色av国产亚洲站长工具| 18禁国产床啪视频网站| 亚洲国产看品久久| 亚洲成人免费av在线播放| 午夜精品国产一区二区电影| 久久久久久人人人人人| 精品亚洲成a人片在线观看| 美女午夜性视频免费| 精品人妻在线不人妻| 蜜桃在线观看..| 欧美老熟妇乱子伦牲交| 亚洲av美国av| 岛国毛片在线播放| 亚洲九九香蕉| 国产黄色免费在线视频| 亚洲一卡2卡3卡4卡5卡精品中文| 亚洲欧美精品自产自拍| 丝袜脚勾引网站| 五月天丁香电影| 久久精品国产综合久久久| 午夜91福利影院| 我要看黄色一级片免费的| 成年人午夜在线观看视频| 一区二区三区激情视频| 欧美 日韩 精品 国产| 涩涩av久久男人的天堂| 另类亚洲欧美激情| 在线精品无人区一区二区三| 久久国产精品大桥未久av| 国产精品久久久久久人妻精品电影 | 亚洲精品国产av蜜桃| 高清视频免费观看一区二区| 欧美精品一区二区免费开放| 久久久久久久精品精品| 蜜桃国产av成人99| 99re6热这里在线精品视频| 欧美亚洲 丝袜 人妻 在线| 丰满人妻熟妇乱又伦精品不卡| 一边摸一边抽搐一进一出视频| 午夜影院在线不卡| 日韩人妻精品一区2区三区| 天天影视国产精品| 天天添夜夜摸| av又黄又爽大尺度在线免费看| 美国免费a级毛片| 91成人精品电影| 成在线人永久免费视频| 日韩一卡2卡3卡4卡2021年| 9色porny在线观看| 好男人电影高清在线观看| 亚洲精品粉嫩美女一区| 日本vs欧美在线观看视频| 精品高清国产在线一区| 欧美av亚洲av综合av国产av| 一级片免费观看大全| 欧美另类一区| 国产精品免费视频内射| 国产亚洲av片在线观看秒播厂| 建设人人有责人人尽责人人享有的| 中文字幕人妻熟女乱码| 免费在线观看黄色视频的| 人人澡人人妻人| 下体分泌物呈黄色| 国产精品麻豆人妻色哟哟久久| 王馨瑶露胸无遮挡在线观看| 久久久精品94久久精品| 久久 成人 亚洲| 韩国高清视频一区二区三区| 嫩草影视91久久| 成人av一区二区三区在线看 | tocl精华| 国产精品免费大片| 国产一区二区 视频在线| 我要看黄色一级片免费的| 久久久久久久国产电影| 人人妻人人爽人人添夜夜欢视频| 香蕉丝袜av| 久久久久国内视频| 久久久久视频综合| 啦啦啦视频在线资源免费观看| 国产在视频线精品| 欧美 日韩 精品 国产| 一本一本久久a久久精品综合妖精| 91av网站免费观看| 一区在线观看完整版| 国产亚洲午夜精品一区二区久久| 在线观看舔阴道视频| 欧美日韩亚洲高清精品| 午夜免费观看性视频| 国产欧美亚洲国产| 中国美女看黄片| 中文字幕色久视频| 精品国产国语对白av| 亚洲精品国产av蜜桃| 国产三级黄色录像| 成年人黄色毛片网站| 国产男人的电影天堂91| 美女福利国产在线| 激情视频va一区二区三区| 男人添女人高潮全过程视频| 岛国毛片在线播放| 国产黄频视频在线观看| 搡老乐熟女国产| 中国国产av一级| 啦啦啦视频在线资源免费观看| 国精品久久久久久国模美| 男男h啪啪无遮挡| 亚洲精品成人av观看孕妇| 国产精品久久久av美女十八| 人妻一区二区av| 一个人免费在线观看的高清视频 | 国产av精品麻豆| 电影成人av| 菩萨蛮人人尽说江南好唐韦庄| 久久国产精品人妻蜜桃| 色老头精品视频在线观看| 伊人久久大香线蕉亚洲五| 午夜免费观看性视频| 国产有黄有色有爽视频| 一进一出抽搐动态| 日本av手机在线免费观看| 一边摸一边抽搐一进一出视频| 搡老岳熟女国产| 老司机影院毛片| 欧美人与性动交α欧美精品济南到| 多毛熟女@视频| 久久国产精品人妻蜜桃| 一边摸一边抽搐一进一出视频| 国产亚洲精品第一综合不卡| 啦啦啦 在线观看视频| 中文欧美无线码| av又黄又爽大尺度在线免费看| 日日夜夜操网爽| 国产成人欧美| 日韩三级视频一区二区三区| 两性夫妻黄色片| 成人影院久久| 亚洲欧美激情在线| 精品国产一区二区三区四区第35| 性色av乱码一区二区三区2| 成年女人毛片免费观看观看9 | 亚洲国产精品999| 免费观看人在逋| 男人操女人黄网站| 久久午夜综合久久蜜桃| 日韩 亚洲 欧美在线| 国产成人系列免费观看| 日韩欧美免费精品| 热99re8久久精品国产| 黄片播放在线免费| 免费日韩欧美在线观看| 桃红色精品国产亚洲av| 这个男人来自地球电影免费观看| av片东京热男人的天堂| 国产99久久九九免费精品| 亚洲五月色婷婷综合| 日本欧美视频一区| 人人妻人人澡人人爽人人夜夜| 久9热在线精品视频| 久久午夜综合久久蜜桃| 国产精品一区二区精品视频观看| av在线app专区| 人人妻人人爽人人添夜夜欢视频| 操出白浆在线播放| 777久久人妻少妇嫩草av网站| 91麻豆精品激情在线观看国产 | 久久人人97超碰香蕉20202| 狠狠狠狠99中文字幕| 久久综合国产亚洲精品| 在线观看人妻少妇| 国产黄频视频在线观看| 免费在线观看视频国产中文字幕亚洲 | 美女大奶头黄色视频| 青青草视频在线视频观看| 涩涩av久久男人的天堂| 国产欧美日韩一区二区精品| 老司机影院成人| 欧美老熟妇乱子伦牲交| 十分钟在线观看高清视频www| 亚洲国产精品成人久久小说| 国产一区有黄有色的免费视频| a级片在线免费高清观看视频| 最近中文字幕2019免费版| 亚洲人成电影免费在线| 久久国产亚洲av麻豆专区| 在线亚洲精品国产二区图片欧美| 午夜福利一区二区在线看| 又大又爽又粗| 人妻久久中文字幕网| 成年人午夜在线观看视频| 91麻豆精品激情在线观看国产 | av国产精品久久久久影院| 欧美日韩亚洲高清精品| 国产精品九九99| 三级毛片av免费| 日日摸夜夜添夜夜添小说| 飞空精品影院首页| www.av在线官网国产| bbb黄色大片| 99国产精品99久久久久| 精品亚洲成国产av| 俄罗斯特黄特色一大片| av又黄又爽大尺度在线免费看| 一边摸一边抽搐一进一出视频| 久久狼人影院| 免费观看人在逋| 在线av久久热| 亚洲av片天天在线观看| 热re99久久精品国产66热6| 蜜桃在线观看..| 久久免费观看电影| 男女国产视频网站| www日本在线高清视频| 在线观看一区二区三区激情| 日韩视频一区二区在线观看| av片东京热男人的天堂| 99九九在线精品视频| 国产成人欧美| 国产不卡av网站在线观看| 美女大奶头黄色视频| √禁漫天堂资源中文www| 老熟妇乱子伦视频在线观看 | 少妇裸体淫交视频免费看高清 | 日韩欧美免费精品| 一本—道久久a久久精品蜜桃钙片| 丰满少妇做爰视频| 99国产极品粉嫩在线观看| 精品人妻熟女毛片av久久网站| 午夜福利在线观看吧| av天堂久久9| 久久久久久久国产电影| 国产不卡av网站在线观看| 制服诱惑二区| 精品少妇久久久久久888优播| 国产野战对白在线观看| 亚洲精品日韩在线中文字幕| 久久久精品94久久精品| 97精品久久久久久久久久精品| 国产91精品成人一区二区三区 | 日韩制服骚丝袜av| xxxhd国产人妻xxx| av在线app专区| 久久久久国内视频| 午夜福利视频精品| 少妇精品久久久久久久| 亚洲精品中文字幕一二三四区 | 国产av国产精品国产| 91字幕亚洲| 国产有黄有色有爽视频| 中文字幕最新亚洲高清| 热re99久久精品国产66热6| 性高湖久久久久久久久免费观看| 中文欧美无线码| 91九色精品人成在线观看| 美女午夜性视频免费| 午夜福利在线观看吧| 一区二区三区四区激情视频| 午夜免费成人在线视频| 性色av乱码一区二区三区2| 欧美中文综合在线视频| 一级黄色大片毛片| 久久久水蜜桃国产精品网| 国产精品成人在线| 精品少妇久久久久久888优播| 天天躁夜夜躁狠狠躁躁| 丝袜美腿诱惑在线| 成年女人毛片免费观看观看9 | 国产在线一区二区三区精| 国产三级黄色录像| 日本wwww免费看| 国产成+人综合+亚洲专区| 日本av免费视频播放| 午夜老司机福利片| 中文字幕av电影在线播放| 老汉色∧v一级毛片| 国产又色又爽无遮挡免| 99国产精品一区二区蜜桃av | 国产真人三级小视频在线观看| 最近最新中文字幕大全免费视频| 大片电影免费在线观看免费| 又紧又爽又黄一区二区| 国产亚洲欧美在线一区二区| 日韩一卡2卡3卡4卡2021年| 免费日韩欧美在线观看| 80岁老熟妇乱子伦牲交| 欧美精品人与动牲交sv欧美| 国产精品亚洲av一区麻豆| 女人爽到高潮嗷嗷叫在线视频| 欧美+亚洲+日韩+国产| 欧美激情高清一区二区三区| 老司机福利观看| 国产精品免费视频内射| 成人免费观看视频高清| 老司机午夜福利在线观看视频 | 一级毛片女人18水好多| 美女国产高潮福利片在线看| 久久精品国产亚洲av香蕉五月 | 日韩欧美一区视频在线观看| 国产熟女午夜一区二区三区| 久久综合国产亚洲精品| 精品人妻1区二区| 老司机影院毛片| 国产一区二区三区av在线| 中文字幕最新亚洲高清| 亚洲国产欧美日韩在线播放| 欧美激情高清一区二区三区| 青春草亚洲视频在线观看| 国产精品久久久久久精品古装| 亚洲精品国产精品久久久不卡| 亚洲av男天堂| 不卡av一区二区三区| 少妇被粗大的猛进出69影院| 亚洲国产av新网站| 日韩中文字幕欧美一区二区| 成年美女黄网站色视频大全免费| 亚洲欧美日韩高清在线视频 | 午夜免费成人在线视频| 亚洲精品自拍成人| 久久99热这里只频精品6学生| 午夜影院在线不卡| av福利片在线| 手机成人av网站| 国产欧美日韩精品亚洲av| 精品欧美一区二区三区在线| 国产老妇伦熟女老妇高清| 国产欧美亚洲国产| 男女高潮啪啪啪动态图| 亚洲专区国产一区二区| 日韩欧美一区二区三区在线观看 | 亚洲成国产人片在线观看| 国精品久久久久久国模美| 亚洲伊人色综图| 男女之事视频高清在线观看| 成年人黄色毛片网站| 咕卡用的链子| 国产精品香港三级国产av潘金莲| 欧美日韩成人在线一区二区| 国产免费视频播放在线视频| 99国产极品粉嫩在线观看| 国产黄色免费在线视频| 少妇猛男粗大的猛烈进出视频| 丝袜喷水一区| 国产免费福利视频在线观看| 丰满迷人的少妇在线观看| 国产视频一区二区在线看| 亚洲,欧美精品.| 99久久精品国产亚洲精品| 亚洲欧美精品综合一区二区三区| 国产不卡av网站在线观看| 亚洲精品乱久久久久久| 日韩中文字幕欧美一区二区| 国产精品自产拍在线观看55亚洲 | tube8黄色片| 日韩人妻精品一区2区三区| 中文字幕av电影在线播放| 啦啦啦免费观看视频1| a在线观看视频网站| 夜夜骑夜夜射夜夜干| 啦啦啦免费观看视频1| 免费在线观看黄色视频的| 五月天丁香电影| 国产三级黄色录像| 欧美国产精品一级二级三级| 不卡一级毛片| 男女免费视频国产| 国产高清videossex| 99国产极品粉嫩在线观看| 国产精品 国内视频| 热re99久久国产66热| 国产淫语在线视频| 一区二区av电影网| 一级a爱视频在线免费观看| 亚洲精品国产精品久久久不卡| 日韩制服骚丝袜av| 国产精品久久久久成人av| 亚洲男人天堂网一区| 精品国产一区二区久久| 欧美日韩精品网址| 国产一区二区激情短视频 | 久久久久久免费高清国产稀缺| 国产伦人伦偷精品视频| 国产成人精品久久二区二区免费| 国产精品久久久人人做人人爽| 久久香蕉激情| 亚洲专区国产一区二区| 香蕉丝袜av| 久久久国产一区二区| 久久久久网色| 黄色视频不卡| 亚洲色图 男人天堂 中文字幕| 国产成人a∨麻豆精品| 久久久欧美国产精品| 婷婷丁香在线五月| 男人舔女人的私密视频| 日本av免费视频播放| 人妻人人澡人人爽人人| 亚洲精品一二三| 色综合欧美亚洲国产小说| 伊人久久大香线蕉亚洲五| 亚洲国产精品一区二区三区在线| 亚洲中文日韩欧美视频| 亚洲,欧美精品.| 人妻久久中文字幕网| 人人妻,人人澡人人爽秒播| 国产黄色免费在线视频| 老司机亚洲免费影院| 亚洲av日韩精品久久久久久密| 亚洲欧美成人综合另类久久久| 久久久久网色| 国产有黄有色有爽视频| 在线观看免费高清a一片| 欧美黑人欧美精品刺激| 国产精品一区二区在线不卡| 国产淫语在线视频| 免费不卡黄色视频| 韩国高清视频一区二区三区| 国产伦人伦偷精品视频| www.熟女人妻精品国产| 精品亚洲成a人片在线观看| 国产成人影院久久av| 99久久综合免费| 在线精品无人区一区二区三| 91大片在线观看| 午夜福利视频在线观看免费| 麻豆国产av国片精品| 水蜜桃什么品种好| 亚洲七黄色美女视频| 少妇猛男粗大的猛烈进出视频| 久久久精品免费免费高清| av网站在线播放免费| 免费黄频网站在线观看国产| 精品熟女少妇八av免费久了| a在线观看视频网站| 法律面前人人平等表现在哪些方面 | 男人添女人高潮全过程视频| 一本色道久久久久久精品综合| 精品亚洲乱码少妇综合久久| 久久久精品国产亚洲av高清涩受| 飞空精品影院首页| a在线观看视频网站| 国产精品1区2区在线观看. | 国产成人欧美在线观看 | 亚洲欧洲日产国产| 乱人伦中国视频| 成人手机av| 久久国产精品影院| 亚洲av欧美aⅴ国产| 免费日韩欧美在线观看| 性高湖久久久久久久久免费观看| 我的亚洲天堂| 80岁老熟妇乱子伦牲交| 精品欧美一区二区三区在线| 亚洲少妇的诱惑av| 麻豆国产av国片精品| 黑人巨大精品欧美一区二区mp4| av有码第一页| 高清av免费在线| 91字幕亚洲| 69精品国产乱码久久久| 一级a爱视频在线免费观看| 51午夜福利影视在线观看| 丰满少妇做爰视频| 肉色欧美久久久久久久蜜桃| 两性午夜刺激爽爽歪歪视频在线观看 | 大香蕉久久成人网| 黄色怎么调成土黄色| 老熟女久久久| 国产精品久久久久久人妻精品电影 | 热99久久久久精品小说推荐| 美女主播在线视频| 99国产精品99久久久久| 午夜影院在线不卡| 99香蕉大伊视频| 女性被躁到高潮视频| 在线精品无人区一区二区三| 日韩制服骚丝袜av| 在线观看www视频免费| 久久久久精品人妻al黑| 日韩制服骚丝袜av| 国产精品免费视频内射| 日韩熟女老妇一区二区性免费视频| 日韩大片免费观看网站| 亚洲三区欧美一区| 亚洲av日韩精品久久久久久密| 99久久精品国产亚洲精品| 亚洲精品成人av观看孕妇| 国产三级黄色录像| 欧美少妇被猛烈插入视频| 妹子高潮喷水视频| 久久久国产欧美日韩av| 国产精品成人在线| 午夜福利视频精品| 免费少妇av软件| 色精品久久人妻99蜜桃| 国产av国产精品国产| 美女中出高潮动态图| 亚洲熟女精品中文字幕| 欧美乱码精品一区二区三区| 宅男免费午夜| 免费不卡黄色视频| 侵犯人妻中文字幕一二三四区| 国产精品九九99| 欧美精品av麻豆av| 国产精品影院久久| 中亚洲国语对白在线视频| 真人做人爱边吃奶动态| 午夜免费观看性视频| 亚洲国产av新网站| 在线亚洲精品国产二区图片欧美| 免费看十八禁软件| 国产亚洲精品一区二区www | 亚洲一区二区三区欧美精品| 久久久久久久久免费视频了| 亚洲少妇的诱惑av| 免费观看a级毛片全部| 手机成人av网站| 91成年电影在线观看| 日本猛色少妇xxxxx猛交久久| 国产在线一区二区三区精| 麻豆av在线久日| 精品国内亚洲2022精品成人 | 欧美黄色片欧美黄色片| 桃花免费在线播放| 国产精品久久久久成人av| 老汉色av国产亚洲站长工具| 亚洲avbb在线观看| 男人舔女人的私密视频| 麻豆av在线久日| 女人爽到高潮嗷嗷叫在线视频| 老汉色av国产亚洲站长工具| 久久久久精品国产欧美久久久 | 人妻一区二区av| 国产成人av教育| 99久久综合免费| 亚洲第一av免费看| 亚洲熟女精品中文字幕| 久久久久网色| 亚洲成av片中文字幕在线观看| 视频区图区小说| 手机成人av网站| 欧美日本中文国产一区发布| www.熟女人妻精品国产| 亚洲av成人不卡在线观看播放网 | 成人三级做爰电影| 18禁观看日本| 亚洲精品久久久久久婷婷小说| 亚洲自偷自拍图片 自拍| 十八禁网站网址无遮挡| 欧美另类一区| tube8黄色片| 国产成人欧美在线观看 | 亚洲九九香蕉| 日日夜夜操网爽| 久热这里只有精品99| 久久久久国产一级毛片高清牌| 久久久久久久大尺度免费视频| 日韩人妻精品一区2区三区| 91精品伊人久久大香线蕉| 男女无遮挡免费网站观看| 国产成人免费观看mmmm| 婷婷成人精品国产| 丝袜人妻中文字幕| 一本综合久久免费| 国产在线免费精品| 国产精品 欧美亚洲| 日本91视频免费播放| 久久久精品国产亚洲av高清涩受| 99国产精品99久久久久| 国产91精品成人一区二区三区 | 成人黄色视频免费在线看| 精品福利观看| 日韩视频一区二区在线观看| 欧美另类一区| 国产精品麻豆人妻色哟哟久久| 一区在线观看完整版| 亚洲欧美日韩另类电影网站| av超薄肉色丝袜交足视频| 一二三四在线观看免费中文在| 久久99一区二区三区| 男人爽女人下面视频在线观看| 国产有黄有色有爽视频| 亚洲欧美一区二区三区久久| 国产亚洲欧美在线一区二区| 日日夜夜操网爽| 宅男免费午夜| 一级毛片女人18水好多| 久久中文字幕一级| 亚洲午夜精品一区,二区,三区| 国产成人精品久久二区二区91| 老司机亚洲免费影院| 美女大奶头黄色视频| 妹子高潮喷水视频| 日韩一卡2卡3卡4卡2021年| 久久国产精品男人的天堂亚洲| 亚洲精品国产色婷婷电影| 亚洲国产日韩一区二区| 日日摸夜夜添夜夜添小说| 国产在线免费精品| 亚洲av片天天在线观看| 亚洲九九香蕉| 老司机影院成人| 国产精品 国内视频| 亚洲欧美激情在线|