An Evolutionary Frog Leaping Algorithm for Global Optimization Problems and Applications.

Hybrid harmony search and artificial bee colony algorithm for global optimization problems

A modified quasisecant method for global optimization

Centroid Mutation Embedded Shuffled Frog-Leaping Algorithm

Investigations illustrate that the Internet of Things (IoT) can save costs, increase efficiency, improve quality, and provide data-driven preventative maintenance services. Intelligent sensors, dependable connectivity, and complete integration are essential for gathering real-time information. IoT develops home appliances for improved customer satisfaction, personalization, and enhanced big data analytics as a crucial Industry 4.0 enabler. Because the product design process is an important part of controlling manufacturing, there are constant attempts to improve and minimize product design time. Utilizing a hybrid algorithm, this research provides a novel method to schedule design products in production management systems to optimize energy usage and design time (combined particle optimization algorithm and shuffled frog leaping algorithm). The issue with particle optimization algorithms is that they might become stuck in local optimization and take a long time to converge to global optimization. The strength of the combined frog leaping algorithm local searching has been exploited to solve these difficulties. The MATLAB programming tool is used to simulate the suggested technique. The simulation findings were examined from three perspectives: energy usage, manufacturing time, and product design time. According to the findings, the recommended strategy performed better in minimizing energy use and product design time. These findings also suggest that the proposed strategy has a higher degree of convergence when discovering optimal solutions.

Landslide susceptibility analysis is beneficial information for a wide range of applications, including land use management plans. The present attempt has shed light on an efficient landslide susceptibility mapping framework that involves an adaptive neural-fuzzy inference system (ANFIS), which incorporates three metaheuristic methods including grey wolf optimization (GWO), particle swarm optimization (PSO), and shuffled frog leaping algorithm (SFLA) in the East Azerbaijan of Iran. To achieve this goal, 10 landslide occurrence-related influencing factors were pondered. A sum of 766 locations with landslide potentiality was recognized in the context of the study, and the Pearson correlation technique utilized in order to select the influencing factors in landslide models. The association between landslides and conditioning factors was also evaluated using a probability certainty factor (PCF) model. In the next phase, three data mining techniques were united with the ANFIS model, comprising ANFIS-grey wolf algorithm (ANFIS-GW), ANFIS-particle swarm optimization (ANFIS-PSO), and ANFIS-shuffled frog leaping algorithm (ANFIS-SFLA), were structured by the training dataset. Lastly, the receiver operating characteristic (ROC) and statistical procedures were utilized with the aim of validating and contrasting the predictive capability of the models. The findings of the study in terms of the Pearson correlation technique method for the importance ranking of conditioning factors in the context area uncovered that slope, aspect, normalized difference vegetation index (NDVI), and elevation have the highest impact on the occurrence of the landslide. All in all, the ANFIS-PSO model had high performance on both the training (RMSE = 0.288, MAE = 0.069, AUC = 0.89) and validation dataset (RMSE = 0.309, MAE = 0.097, AUC = 0.89), after which, the ANFIS-GWO model and the ANFIS-SFLA model demonstrated the second and third rates. Besides, the study revealed that benefiting the optimization algorithm with the proper selection of the techniques could facilitate landslide susceptibility modeling.

A novel image watermark scheme based on the shuffled frog leaping (SFL) algorithm is proposed in the paper. The watermark is embedded to the discrete multi wavelet transform (DMT) coefficients larger than some threshold values, and watermark extraction is efficiently performed with SFL algorithm. Experimental results show both the robustness under attacks and the improvement in watermarked image quality with the proposed SFL algorithm.

Shuffled Frog Leaping Algorithm (SFLA) is a meta-heuristic for solving discrete optimization problems. Here it is applied to determine optimal discrete pipe sizes for new pipe networks and for network expansions. SFLA is a population based, cooperative search metaphor inspired by natural memetics. The algorithm uses memetic evolution in the form of infection of ideas from one individual to another in a local search. The local search is similar in concept to particle swarm optimization. A shuffling strategy allows for the exchange of information between local searches to move toward a global optimum. This paper summarizes the development of SFLANET, a computer model that links SFLA and the hydraulic simulation software EPANET and its library functions. Application of SFLANET to literature network design problems is then described. Although the algorithm is in its initial stages of development, promising results were obtained.

This paper presents a modified Shuffled Frog Leaping Algorithm (SFLA) applied to the design of water distribution networks. Generally, one of the major disadvantages of the traditional SFLA is the high number of parameters that need to be calibrated for proper operation of the algorithm. A method for calibrating these parameters is presented and applied to the design of three benchmark medium-sized networks widely known in the literature (Hanoi, New York Tunnel, and GoYang). For each of the problems, over 35,000 simulations were conducted. Then, a statistical analysis was performed, and the relative importance of each of the parameters was analyzed to achieve the best possible configuration of the modified SFLA. The main conclusion from this study is that not all of the original SFL algorithm parameters are important. Thus, the fraction of frogs in the memeplex q can be eliminated, while the other parameters (number of evolutionary steps Ns, number of memeplexes m, and number of frogs n) may be set to constant values that run optimally for all medium-sized networks. Furthermore, the modified acceleration parameter C becomes the key parameter in the calibration process, vastly improving the results provided by the original SFLA.

This study addresses a shuffled frog leaping algorithm for solving the multi-objective reactive power dispatch problem in a power system. Optimal Reactive Power Dispatch (ORPD) is formulated as a nonlinear, multi-modal and mixed-variable problem. The intended technique is based on the minimization of the real power loss, minimization of voltage deviation and maximization of the voltage stability margin. Generator voltages, capacitor banks and tap positions of tap changing transformers are used as optimization variables of this problem. A memetic meta-heuristic named as shuffled frog-leaping algorithm is intended to solve multi-objective optimal reactive power dispatch problems considering voltage stability margin and voltage deviation. The Shuffled Frog-Leaping Algorithm (SFLA) is a population-based cooperative search metaphor inspired by natural memetics. The algorithm contains elements of local search and global information exchange. The most important benefit of this algorithm is higher speed of convergence to a better solution. The intended method is applied to ORPD problem on IEEE 57 bus power systems and compared with two versions of differential evolutionary algorithm. The simulation results show the effectiveness of the intended method.

Oilfield development planning is a complex task that involves multiple optimization objectives and constraints. Therefore, a study proposes an improved shuffled frog leaping algorithm to achieve multi-objective optimization tasks. In multi-objective problems, the fitness value of the algorithm is not adaptive to the memetic evolution, resulting in local search failures. Research is conducted on improving the shuffled frog leaping algorithm through non-dominated sorting genetic algorithm-II, memetic evolution, and traversal methods, and then verifying the effectiveness of the algorithm. The outcomes denoted that when the population was 30 and the grouping was 5, the algorithm proposed in the study had the fastest search speed and better optimization effect. The improved shuffled frog leaping algorithm had advantages in both construction period and cost compared to the shuffled frog leaping algorithm, with a construction period difference of 19 days and a cost difference of $13871. In comparative experiments with other algorithms, the average optimal solution and running time of the proposed algorithm were 0.324 and 7.2 seconds, respectively, which can quickly find the optimal solution in a short time. The algorithm proposed in the study can effectively optimize the complex objectives and constraints in oilfield development planning problems.

Several evolutionary algorithms (EAs) are proposed in the literature to solve continuous optimisation problems. In this paper we present a new search startegy to improve the efficiency of the Shuffled Frog Leaping Algorithm (SFLA). The shuffled frog leaping algorithm is a population-based approach for a heuristic search in optimization problems. The algorithm consists of a set of virtual frogs partitioned into several groups called “memeplexes”. However, After some optimization runs frogs position's become closer in each memeplex. Indeed, this problem leads to a premature convergence. For getting better effiency we propose a novel search strategy by infecting not only the worst indvidual but also the best indvidual idea's. To further improve the speed of convergence of the algorithm, we have introduced two acceleration factors in the search strategy formulation. The proposed algorithm has been evaluated on five mathematical benchmark functions. Compared with a the orginal SFLA and the particle swarm optimization algorithm, the experimental results in terms of optimization performance and the speed of convergence shows that the proposed algorithm can be an effective tool for solving combinatorial optimization problems.

Aiming at overcoming the defects such as slow searching speed and easily trapping into local extremum at anaphase of the shuffled frog leaping algorithm (SFLA), based on the Evolutionary Exploration strategy, a more effective shuffled frog leaping algorithm, Improved Shuffled Frog Leaping Algorithm (ISFLA), which can be applied to the inverse analysis of seepage parameters to dams, is proposed. With the introduction of the threshold value selection in the local search of the original initial population to improve the best frogs in memeplex, the improved algorithm overcomes the shortcomings of traditional SFLA which can easily fall into a local optimum. By comparative analysis between the laboratory test and numerical simulation, the effectiveness and accuracy of ISFLA are demonstrated by the application to the inversion analysis of seepage parameters of earth dams. Furthermore, the inversion analysis of seepage parameters to the earth dam in Lianyungang China is studied by the ISFLA. Moreover, the seepage characteristics of the dam are evaluated; thus, the suggestion that the dam should be reinforced is put forward. All the results show that ISFLA in an inverse analysis of seepage parameters of dams has excellent value to hydropower engineering.

In order to improve the premature convergence problem of traditional shuffled frog leaping algorithm (SFLA), this paper proposed a normal cloud mutation shuffled frog leaping algorithm (NCM-SFLA) by mixing the cloud model algorithm (NCM) with SFLA algorithm, NCM is used to overcome the shortage of SFLA which is easy to fall into local optimal solution. The proposed NCM-SFLA has a good parallel characteristic, and the parallel computing can be implemented easily in multi core environment. In case study, this paper takes the Li Xianjiang cascade reservoirs in China as an instance to solve the cascade reservoirs operation optimization problem by the proposed NCM-SFLA. The results show that, compared with the Multi- dimensional Dynamic Programming (MDP), NCM-SFLA has the better global search ability and faster convergence speed, and the corresponding parallel computing can effectively shorten the run-time of NCM-SFLA. Therefore, the feasibility and rationality of the proposed NCM-SFLA and its parallel computing are effectively proved by the case study results.

A multi-objective differential evolution-chaos shuffled frog leaping algorithm (MODE-CSFLA) is proposed for water resources system optimization to overcome the shortcomings of easily falling into local minima and premature convergence in SFLA. The performance of MODE-CSFLA in solving benchmark problems is compared with that of non-dominated sorting genetic algorithm II (NSGA-II) and multi-objective particle swarm optimization (MOPSO). At last, the proposed MODE-CSFLA is used to optimize the water resources allocation plan of the East Route of the South-to-North Water Transfer Project in the normal, dry, and extremely dry years. The results reveal that MODE-CSFLA performs better than NSGA-II and MOPSO under all conditions. Compared with shuffled frog leaping algorithm (SFLA), MODE-CSFLA can result in a 29.39, 27.47 and 22.55% increase in water supply when the single objective is to minimize the water pumpage; and a 41.01, 39.63 and 30.94% decrease in total pumpage when the single objective is to maximize the water supply in the normal, dry, and extremely dry conditions, respectively. Thus, MODE-CSFLA has the potential to be used for solving complex optimization problems of water resources systems.

Multistage distribution system expansion planning considering distributed generation using hybrid evolutionary algorithms