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

A method based on cultural gene algorithm to solve the problem of uniform dyeing

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: 2022-07-19
SOUTHEAST UNIV
View PDF3 Cites 0 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
  • A method based on cultural gene algorithm to solve the problem of uniform dyeing
  • A method based on cultural gene algorithm to solve the problem of uniform dyeing
  • A method based on cultural gene algorithm to solve the problem of uniform dyeing

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0026] The present invention will be fully described below with reference to the accompanying drawings.

[0027] A method based on cultural gene algorithm to solve the problem of uniform dyeing, 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, and each coloring scheme is an individual in the population. This process is the initialization of the population. Specifically, first, a greedy algorithm is used to establish a k-coloring scheme S that is balanced and has as few conflicts as possible. c , (c=1). And use the second-order search algorithm for S c Perform optimization to generate a new solution S + , take this new solution S + Inserted into the population, in order to create a high-quality and well-differentiated populatio...

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 purpose of the present invention is to provide a method for quickly finding the optimal solution or approximate optimal solution of the uniform graph coloring problem. The invention discloses a method for solving the uniform dyeing problem based on a cultural gene algorithm. The algorithm is as follows: generating a population containing p elite solutions, designing a crossover operator, locally optimizing the offspring solutions, and judging whether the newly generated solution is suitable added to the population. The invention solves the problem of uniform graph coloring, that is, finds the minimum positive integer k value corresponding to the solution of uniform legal k-coloring of an undirected graph G=(V, E). This method adopts the cultural gene algorithm search framework, and designs the corresponding crossover algorithm, local search algorithm and mating pool upgrade algorithm according to the uniform graph coloring problem. The invention is quicker and more convenient, and is suitable for solving the load balancing problem in the real world.

Description

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

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 Patents(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