Method for improving standard shuffled frog leaping algorithm

A hybrid leapfrog algorithm, standard technology, applied in the field of improved standard hybrid leapfrog algorithm, can solve the problems of falling into local optimum, slowing down of convergence speed, insufficient convergence accuracy, etc.

Inactive Publication Date: 2016-07-20
HEBEI UNIV OF TECH
View PDF0 Cites 13 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The technical problem to be solved by the present invention is to provide a method for improving the standard hybrid leapfrog algorithm, which combines the population mixing mechanism in the standard hybrid leapfrog algorithm with the internal iteration mechanism of the subpopulation, and dynamically adjusts the moving step length , wi

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method for improving standard shuffled frog leaping algorithm
  • Method for improving standard shuffled frog leaping algorithm
  • Method for improving standard shuffled frog leaping algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0072] The purpose of this embodiment is to verify the convergence accuracy.

[0073]The technical solution adopted in this embodiment to solve this technical problem is: a method for improving the standard hybrid leapfrog algorithm, which combines the population mixing mechanism in the standard hybrid leapfrog algorithm with the internal iteration mechanism of the subpopulation, and dynamically Adjust the moving step length, and realize the improved algorithm by means of MicrosoftVisualC++ computer software. The specific steps are as follows:

[0074] The first step is to determine the parameters that need to be initialized and their initial values:

[0075] Referring to the parameter initialization of the standard hybrid leapfrog algorithm, determine the parameters that need to be initialized after the improved hybrid leapfrog algorithm, including: the number of individuals F of the frog population, the number of frog subpopulations m, the number of frog individuals n of eac...

Embodiment 2

[0138] The purpose of this embodiment is to verify the convergence success rate.

[0139] The technical solution adopted in this embodiment to solve this technical problem is: a method for improving the standard hybrid leapfrog algorithm, which combines the population mixing mechanism in the standard hybrid leapfrog algorithm with the internal iteration mechanism of the subpopulation, and dynamically Adjust the moving step length, and realize the improved algorithm by means of MicrosoftVisualC++ computer software. The specific steps are as follows:

[0140] The first step is to determine the parameters that need to be initialized and their initial values:

[0141] Except the following data, others are the same as Example 1.

[0142] The number of individuals in the frog population F=48, the number of frog subpopulations m=8, the number of frogs in each frog subpopulation n=6, the position of each frog individual X i ={x i1 , x i2}, maximum number of mixing iterations N=80×...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a method for improving a standard shuffled frog leaping algorithm.The method comprises the steps of initializing parameters; calculating the adaptive value of each frog individual, and finding the adaptive value and position of the global optimum frog individual of a frog population; conducting optimum drawdown ranking on the frog population; conducting dividing for obtaining frog sub-populations; finding the positions of the optimum and the worst frog individual of each frog sub-population; conducting updating operation on the position of the worst frog individual of each frog sub-population; calculating the adaptive value of the frog individual with the position updated in each frog sub-population, and finding the global optimum adaptive value and the position of the frog population at this moment; implementing prediction of the global optimum adaptive value of the frog population obtained after iteration is completed next time, and furthermore adjusting the movement step-length variable coefficient dj and skip among steps; judging whether the ending conditions are met or not.By means of the method, the defects that at the later stage, the convergence rate of the standard shuffled frog leaping algorithm is severely lowered, convergence precision is insufficient, and the algorithm is prone to getting into local optimum are overcome.

Description

technical field [0001] The technical scheme of the present invention relates to a computer-aided design data processing method, specifically a method for improving the standard hybrid leapfrog algorithm. Background technique [0002] Many data processing problems in many technical fields need to be modeled to solve, and finally will be transformed into function optimization problems. Therefore, the application of function optimization is becoming more and more common and important. In 2003, Eusuff et al. combined memetic algorithm and particle swarm optimization algorithm to propose a brand-new function optimization algorithm—hybrid leapfrog algorithm. The number is small, the robustness is strong, the implementation is simple and the execution efficiency is high, especially its hybrid mechanism is very helpful for jumping out of the local optimum and ensuring that the algorithm converges to the global optimum. This algorithm has been used in the computer field and many pro...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F17/10
CPCG06F17/10
Inventor 杜江袁中华
Owner HEBEI UNIV OF TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap