A hybrid evolution optimization method based on a generative adversarial network model

A technology of network model and optimization method, which is applied in the direction of biological neural network model, gene model, neural learning method, etc., can solve the problem of premature population evolution, achieve the effect of maintaining diversity, simplifying the process of generating samples, and avoiding premature phenomenon

Inactive Publication Date: 2019-06-28
XIDIAN UNIV
View PDF0 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the design of the probability model, the selection of the sampling method, and the precocity of the population evolution are also some problems that the distribution estimation algorithm needs to solve urgently.

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
  • A hybrid evolution optimization method based on a generative adversarial network model
  • A hybrid evolution optimization method based on a generative adversarial network model
  • A hybrid evolution optimization method based on a generative adversarial network model

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0024] combine figure 1 , the implementation steps of the present invention are as follows:

[0025] Step 1, initialize the population.

[0026] The population size is N, and the initial population {V 1 ,V 2 ,...,V N} is P(0), that is, the evolutionary algebra t=0 at this time; set the termination evolutionary algebra G of the population max and the termination evolution time T max .

[0027] Step 2, calculate the fitness value of the individual according to the fitness criterion.

[0028] According to the objective function f(X) and constraint conditions g(X) described in the question, a suitable fitness evaluation function eval(V) is constructed, and the fitness value eval(V) corresponding to the individual in the population is calculated by the evaluation function i ), i=1,2,...,N.

[0029] Step 3, for the parent population P(t), select M dominant individuals according to the roulette or tournament method.

[0030] The operation steps of the roulette method are as ...

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 hybrid evolutionary optimization method based on a generative adversarial network model, which mainly solves the problem that the traditional evolutionary algorithm is difficult to process high-dimensional and non-convex optimization and the like when facing an optimization problem, and comprises the following implementation steps of: (1) initializing a population; (2) calculating fitness values of the individuals according to a fitness criterion; (3) selecting dominant individuals; (4) performing crossover and mutation operation on the dominant individuals to obtainnew individuals; (5) taking the dominant individuals as samples, and generating new individuals by training the generative adversarial network model; (6) combining the new individuals obtained after the crossover and mutation operation with the new individuals generated through the generative adversarial network to form a new filial generation population; and (7) judging whether to terminate: outputting the optimal value of the target function after the algorithm is terminated, otherwise, returning to the step (2). According to the method, the global search capability and the convergence speedof the evolutionary algorithm are improved, and the method can be used for solving the complex high-dimensional optimization problem.

Description

technical field [0001] The invention belongs to the field of optimization design, in particular to a hybrid evolution optimization method based on a generative confrontation network model, which can be used to deal with complex high-dimensional optimization problems. Background technique [0002] As a general term for a class of optimization methods, evolutionary algorithms are inspired by the biological evolution mechanism of nature. Compared with traditional calculus-based methods and optimization algorithms such as exhaustive methods, evolutionary computing is a mature global optimization method with high robustness and wide applicability, and has the characteristics of self-organization, self-adaptation and self-learning , can effectively deal with complex problems that are difficult to solve by traditional optimization algorithms without being limited by the nature of the problem. Therefore, since the 1990s, research results related to evolutionary algorithms have spru...

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
Patent Type & Authority Applications(China)
IPC IPC(8): G06N3/12G06N3/08
Inventor 马晶晶张育泽张明阳王善峰武越段莹莹陈澜涛焦李成
Owner XIDIAN UNIV
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