Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method for solving uniform dyeing problem based on cultural gene algorithm

A kind of cultural gene algorithm, uniform dyeing technology, applied in the direction of genetic model, calculation, genetic law, etc., can solve problems such as cultural gene method exploration

Active Publication Date: 2019-12-03
SOUTHEAST UNIV
View PDF3 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

So far, cultural gene methods have not been explored in the field of uniform graph coloring

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 solving uniform dyeing problem based on cultural gene algorithm
  • Method for solving uniform dyeing problem based on cultural gene algorithm
  • Method for solving uniform dyeing problem based on cultural gene algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0026] The present invention will be fully described below in conjunction with the drawings.

[0027] A method based on cultural genetic algorithm to solve the uniform dyeing problem, the specific algorithm flow is as follows figure 1 Shown. Specific steps are as follows:

[0028] 1) Generate a population containing p elite solutions. For a given graph G, the number of colors k, and the population size p, a series of excellent coloring schemes (solutions) are first generated. Each coloring scheme is an individual in the population. This process is the population initialization. Specifically, the greedy algorithm is first used to establish a balanced k-coloring scheme S with as few conflicts as possible c , (C=1). And use the second-order search algorithm to S c Perform optimization and generate a new solution S + , Put this new solution S + Inserted into the population, in order to create a high-quality and well-differentiated population, the first perturbation scheme is adopted ...

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 aims to provide a method for quickly finding an optimal solution or an approximate optimal solution of a uniform graph dyeing problem. The invention discloses a method for solving a uniform dyeing problem based on a cultural gene algorithm. The algorithm comprises the following steps: generating a population containing p elite solutions, designing a crossover operator, carrying out local optimization on offspring solutions, and judging whether a newly generated solution is suitable for being added into the population or not. The problem of uniform graph dyeing is solved, that is,the minimum positive integer k value corresponding to a uniform legal k-dyed solution of an undirected graph G = (V, E) is found. A cultural gene algorithm search framework is adopted, and a corresponding cross algorithm, a local search algorithm and a mating pool upgrading algorithm are designed according to a uniform graph dyeing problem. The method is faster and more convenient, and is suitable for solving the load balance problem in the real world.

Description

Technical field [0001] The invention belongs to the field of combinatorial optimization, and specifically relates to a method for solving the uniform dyeing problem based on a cultural gene algorithm. Background technique [0002] The problem of uniform graph coloring is proposed by the scheduling problem with load balancing requirements. In the application of the scheduling problem, a graph can be defined as: each vertex represents a basic task, and the edge connecting the two vertices represents that the two basic tasks cannot be executed at the same time. Therefore, the vertices of the graph are completely colored corresponding to the number of colors required It is the time step required to perform a given task. In addition, the scheduling problem of load balancing requires the execution of an equal or nearly equal number of tasks in each time step. The scheduling problem that meets this additional requirement can correspond to the uniform coloring of the graph. Other pract...

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/00G06N3/12G06F9/50G06T7/90
CPCG06N3/006G06N3/126G06F9/505G06T7/90
Inventor 孙雯殷广成林繁钊姜禹
Owner SOUTHEAST UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com