scholarly journals Inversion Analysis of Seepage Parameters Based on Improved Shuffled Frog Leaping Algorithm

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Li Qun Xu ◽  
Ling Li
Keyword(s):  
Inverse Analysis ◽  
Threshold Value ◽  
Local Extremum ◽  
Earth Dam ◽  
Initial Population ◽  
Local Optimum ◽  
Shuffled Frog Leaping Algorithm ◽  
Shuffled Frog Leaping ◽  
Seepage Characteristics ◽  
Inversion Analysis

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.

scholarly journals A Modified Shuffled Frog Leaping Algorithm for the Topology Optimization of Electromagnet Devices

2020 ◽  
Vol 10 (18) ◽  
pp. 6186
Author(s):  
Wenjia Yang ◽  
Siu Lau Ho ◽  
Weinong Fu
Keyword(s):  
Topology Optimization ◽  
Local Search ◽  
Three Dimensional ◽  
Optimization Method ◽  
Memetic Algorithms ◽  
Local Optimum ◽  
Shuffled Frog Leaping Algorithm ◽  
Electromagnetic Problems ◽  
Electromagnetic Devices ◽  
Shuffled Frog Leaping

The memetic algorithms which employ population information spreading mechanism have shown great potentials in solving complex three-dimensional black-box problems. In this paper, a newly developed memetic meta-heuristic optimization method, known as shuffled frog leaping algorithm (SFLA), is modified and applied to topology optimization of electromagnetic problems. Compared to the conventional SFLA, the proposed algorithm has an extra local search step, which allows it to escape from the local optimum, and hence avoid the problem of premature convergence to continue its search for more accurate results. To validate the performance of the proposed method, it was applied to solving the topology optimization of an interior permanent magnet motor. Two other EAs, namely the conventional SFLA and local-search genetic algorithm, were applied to study the same problem and their performances were compared with that of the proposed algorithm. The results indicate that the proposed algorithm has the best trade-off between the results of objective values and optimization time, and hence is more efficient in topology optimization of electromagnetic devices.

Wireless Sensor Network Routing Optimization Based on Improved Shuffled Frog Leaping Algorithm

2014 ◽  
Vol 681 ◽  
pp. 253-257
Author(s):  
Yong Chun Ma ◽  
Hua Gang Shao
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Routing ◽  
Route Optimization ◽  
Path Optimization ◽  
Wireless Sensor ◽  
Local Optimum ◽  
Optimization Strategy ◽  
Shuffled Frog Leaping Algorithm ◽  
Shuffled Frog Leaping

Against path optimization problem for wireless sensor network, this paper proposes a path optimization strategy for wireless sensor network based on improved shuffled frog leaping algorithm. The shuffled frog leaping algorithm was used as wireless sensor network path optimization main frame, gauss mutation and opposition-based learning were used to overcome the defects of easily trapping into local optimum and low accuracy computation. Simulation results show that the route optimization mechanism can effectively prolongs the network lifetime,reduces energy consumption, and improves the overall network performance.

A Novel Hybrid Optimization Method of Shuffled Frog Leaping Algorithm and Particle Swarm Optimization

2013 ◽  
Vol 717 ◽  
pp. 433-438 ◽  
Author(s):  
Mei Jin Lin ◽  
Fei Luo ◽  
Yu Ge Xu ◽  
Long Luo
Keyword(s):  
Particle Swarm Optimization ◽  
Information Exchange ◽  
Search Strategy ◽  
Particle Swarm ◽  
Convergence Speed ◽  
Hybrid Optimization ◽  
Local Optimum ◽  
Shuffled Frog Leaping Algorithm ◽  
Swarm Optimization ◽  
Shuffled Frog Leaping

Shuffled frog leaping algorithm (SFLA) is a meta-heuristic algorithm, which combines the social behavior technique and the global information exchange of memetic algorithms. But the SFLA has the shortcoming of low convergence speed while solving complex optimization problems. Particle swarm optimization (PSO) is a fast searching algorithms, but easily falls into the local optimum for the diversity scarcity of particles. In the paper, a new hybrid optimization called SFLA-PSO is proposed, which introduced PSO to SFLA by combining the fast search strategy of PSO and global search strategy of SFLA. Six benchmark functions are selected to compare the performance of SFLA-PSO, basic PSO, wPSO and SFLA. The simulation results show that the proposed algorithm SFLA-PSO possesses outstanding performance in the convergence speed and the precision of the global optimum solution.

scholarly journals Adaptive Grouping Cloud Model Shuffled Frog Leaping Algorithm for Solving Continuous Optimization Problems

2016 ◽  
Vol 2016 ◽  
pp. 1-8 ◽  
Author(s):  
Haorui Liu ◽  
Fengyan Yi ◽  
Heli Yang
Keyword(s):  
Quantitative Research ◽  
Optimization Problems ◽  
Cloud Model ◽  
Continuous Optimization ◽  
Convergence Speed ◽  
Function Optimization ◽  
Local Optimum ◽  
Shuffled Frog Leaping Algorithm ◽  
Shuffled Frog Leaping ◽  
Continuous Optimization Problems

The shuffled frog leaping algorithm (SFLA) easily falls into local optimum when it solves multioptimum function optimization problem, which impacts the accuracy and convergence speed. Therefore this paper presents grouped SFLA for solving continuous optimization problems combined with the excellent characteristics of cloud model transformation between qualitative and quantitative research. The algorithm divides the definition domain into several groups and gives each group a set of frogs. Frogs of each region search in their memeplex, and in the search process the algorithm uses the “elite strategy” to update the location information of existing elite frogs through cloud model algorithm. This method narrows the searching space and it can effectively improve the situation of a local optimum; thus convergence speed and accuracy can be significantly improved. The results of computer simulation confirm this conclusion.

scholarly journals A cooperated shuffled frog-leaping algorithm for distributed energy-efficient hybrid flow shop scheduling with fuzzy processing time

2021 ◽  
Author(s):  
Jingcao Cai ◽  
Deming Lei
Keyword(s):  
Energy Efficient ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Distributed Energy ◽  
Shuffled Frog Leaping Algorithm ◽  
Shop Scheduling ◽  
Fuzzy Processing Time ◽  
Hybrid Flow Shop Scheduling ◽  
Shuffled Frog Leaping

AbstractDistributed hybrid flow shop scheduling problem (DHFSP) has attracted some attention; however, DHFSP with uncertainty and energy-related element is seldom studied. In this paper, distributed energy-efficient hybrid flow shop scheduling problem (DEHFSP) with fuzzy processing time is considered and a cooperated shuffled frog-leaping algorithm (CSFLA) is presented to optimize fuzzy makespan, total agreement index and fuzzy total energy consumption simultaneously. Iterated greedy, variable neighborhood search and global search are designed using problem-related features; memeplex evaluation based on three quality indices is presented, an effective cooperation process between the best memeplex and the worst memeplex is developed according to evaluation results and performed by exchanging search times and search ability, and an adaptive population shuffling is adopted to improve search efficiency. Extensive experiments are conducted and the computational results validate that CSFLA has promising advantages on solving the considered DEHFSP.

scholarly journals Optimization on Vehicle Routing Problem Based on Immune Clonal Selection Algorithm

2012 ◽  
Vol 6-7 ◽  
pp. 256-260
Author(s):  
Hai Hua Li ◽  
Zong Yan Xu ◽  
Fei Fei Zhou
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Clonal Selection ◽  
Solution Space ◽  
Genetic Mutation ◽  
Initial Population ◽  
Local Optimum ◽  
Clonal Selection Algorithm ◽  
Routing Problem ◽  
Optimum Solution

Vehicle routing problem is a typical NP-hard problem and is difficult to get an optimum solution. Aiming at the shortages of the existing methods, this paper proposed an algorithm based on immune clonal selection to solve vehicle routing problem. In the algorithm, expressed antibody with matrix, generated the initial population of antibodies randomly, and employed the operations such as clonal selection, genetic mutation iteratively to search optimum solution in solution space. The experimental results show that the algorithm presented here can converge to the global optimum solution rapidly, overcoming such disadvantages of the genetic algorithm as slower convergent velocity and the convergence to a local optimum solution.

Sign in / Sign up

Export Citation Format

Share Document