Product
Patsnap Eureka
For R&D, Patsnap Eureka makes reading and utilizing patents & technical documents easy.
Patsnap Eureka AIR
Designed for self-driven R&D workflows. Generate viable solutions, solve complex R&D challenges, empower your innovation with AI.
Patsnap Eureka Materials
Designed for material experts only. Revolutionize your material R&D, from search, analyze, to developing new materials.
Feature
TechResearch
Generate reliable direction feasibility study reports for your R&D in just a few steps.
TechSeek
Discover and master advanced knowledge NOW. Basics, ideas, possibilities, all at once.
TechMind
As an expert in R&D Theories, TechMind can generates customized viable solutions instantly.
TechRisk
Analyze your overall solution with one click, know your potential R&D risks in advance.
TechMonitor
Get weekly tech updates, stay abreast of the latest tech innovations and key insights.
Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
53 results about "Evolution algebra" patented technology
Efficacy Topic
Property
Owner
Technical Advancement
Application Domain
Technology Topic
Technology Field Word
Patent Country/Region
Patent Type
Patent Status
Application Year
Inventor
An evolution algebra is necessarily commutative and flexible but not necessarily associative or power-associative. Gametic algebras. A gametic algebra is a finite-dimensional real algebra for which all structure constants lie between 0 and 1. Genetic algebras
Structure robustness optimization design method containing interval parameter uncertainty
ActiveCN106096127AAvoid lossImprove effectivenessGeometric CADSpecial data processing applicationsEvolution algebraAlgorithm
The invention discloses a structure robustness optimization design method containing interval parameter uncertainty. The method comprises the following steps that a structure robustness optimization design model based on an internal is built; sample points are obtained by adopting a Latin hypercube sampling and co-simulating technique; a Kriging proxy model for predicting a target function and a constraint function is constructed; an interval robustness optimization design model is solved by adopting a double layer-nested genetic algorithm, left boundaries and right boundaries of the target function and the constraint function are calculated in the inner layer of the genetic algorithm, and in the outer layer of the genetic algorithm, total interval constraint violation degree vectors of all design vectors are calculated, and the feasibility of the total interval constraint violation degree vectors is judged; all the design vectors are subjected to advantage and disadvantage sorting according to a superior relationship criterion based on the interval constraint violation degree vectors; when a largest evolution algebra or convergence threshold value is achieved, the optimal solution of the robustness optimization design model is output, and the structure robustness optimization design containing interval parameter uncertainty is achieved.
Owner:ZHEJIANG UNIV
Structural performance optimum design method under non-probability conditions
InactiveCN105930562APracticalAvoid lossGeometric CADDesign optimisation/simulationEvolution algebraStructural reliability
The invention discloses a structural performance optimum design method under non-probability conditions. The method comprises following steps: an interval optimum design model considering structural reliability requirements is established; sample points are obtained by means of Latin hypercube sampling and collaborative simulation; a Kriging surrogate model for predicting objective functions and constraint functions is established; the interval optimum design model is solved by means of a double-layer nested genetic algorithm, wherein in the inner layer of the genetic algorithm, the left and right boundary of the interval values of the objective functions and the constraint functions are calculated, in the outer layer of the genetic algorithm, the interval reliability and reliability violation degree of each constraint function according to an unified formula are calculated to obtain the total reliability violation degree of a design vector, and the feasibility is determined; superiority ordering is performed on all design vectors according to a superior relation criterion based on the total reliability violation degree; the optimal solution of the interval optimum design model is output when maximum evolution algebra or convergence threshold is reached. By means of the method, structural performance optimum design method under non-probability conditions can be realized.
Owner:ZHEJIANG UNIV
Surface roughness prediction method based on GA-GBRT and method for optimizing process parameters
ActiveCN109828532AImprove test accuracyImprove generalization abilityProgramme controlComputer controlOptimality modelData set
The invention discloses a surface roughness prediction method based on GA-GBRT and a method for optimizing process parameters. The method comprises the steps of: collecting data to construct a data set, and dividing the data set to training set data and test set data, and employing the training set data to perform training of key parameters of a GBRT model; b, performing parameter coding and population initialization: randomly generating a chromosomal sequence for increasing the number of iterations, the maximum depth of the individual regression estimator and the learning rate; c, employing the k-folded cross-validation method to train the GBRT model, and employing the genetic algorithm to calculate the fit goodness fitting value of each individual; d, when the number of cycles does not reach the maximum number of iterations, allowing the population to be selected, crossed and mutated to produce a new generation of populations, and continuously performing training of the GBRT model; and e, repeatedly performing the steps c and d until the number of cycles reaches the maximum evolution algebra or exceeds the maximum number of iterations to obtain the optimal model parameters. The surface roughness prediction method based on GA-GBRT and the method for optimizing process parameters are high in test precision and superior in prediction performance and improves the surface processing precision of the workpiece.
Owner:GUIZHOU UNIV
Genetic evolution image rebuilding method based on Ridgelet redundant dictionary
ActiveCN102609910AReduce time complexityImprove refactoring efficiencyImage enhancementGenetic modelsEvolution algebraCluster algorithm
The invention discloses a genetic evolution image rebuilding method based on a Ridgelet redundant dictionary, and the method is used for solving the problem that the image rebuilt by the existing L0 norm rebuilding technology is poor in visual effect. A rebuilding process comprises the following steps of: clustering all partitioning observation vectors according to the level of similarity by selecting a proper clustering algorithm; initiating clusters; carrying out the common genetic evolution on the initiated clusters; rebuilding an initial image; updating by means of filtering and convex projecting; judging whether evolution algebra reaches a maximum value or not; updating the sparsity; updating the clusters; carrying out the independent genetic evolution on the image blocks; and rebuilding the image. In the method, the similar clusters of the image blocks are used, and the optimal Ridgelet redundant dictionary base atom is found for each image block of each cluster by a genetic evolution computation thought, so that the time complexity of the algorithm is reduced, the blocking effect in the rebuilt image is removed by means of filtering and convex projecting, the search space of the optimal solution is shortened, the image is high in rebuilding precision, and the image is good in rebuilding effect, so that the method can be used for the fields of image processing and computer vision.
Owner:XIDIAN UNIV
Method for identifying hydrodynamic coefficients of dynamic positioning ships
InactiveCN102789538AReduce design costSpecial data processing applicationsEvolution algebraSystems design
The invention relates to the ship dynamic positioning field, in particular to a method for identifying hydrodynamic coefficients of dynamic positioning ships based on the modeling of dynamic positioning ships by means of an adaptive genetic algorithm of a least square method. The method comprises the steps of determining a ship hydrodynamic coefficient; obtaining a longitudinal velocity u, a transverse velocity v and a rotation rate datum r of the sailing of an actual ship; obtaining a longitudinal velocity us, a transverse velocity vs and a rotation rate datum rs of a ship model; determining a target function J; determining a fitness function F; encoding the ship hydrodynamic coefficient; performing selective genetic operation on a population; performing crossover mutation genetic operation on the population, converting a binary code into a hydrodynamic coefficient estimation value; and setting maximum evolution algebra and performing multi-generation inheritance calculation. According to the method for identifying hydrodynamic coefficients of dynamic positioning ships, only the actual ship sailing velocity is needed to be recorded, and the model experiment is not needed, so that the design cost of a dynamic positioning system is saved.
Owner:HARBIN ENG UNIV
Main line green wave coordination control signal time method for optimizing exhaust gas emission
ActiveCN103593986AExcellent delayReduce pollutionControlling traffic signalsEvolution algebraControl signal
The invention discloses a main line green wave coordination control signal time method for optimizing exhaust gas emission. The method comprises the following steps that first, the basic traffic parameter of a main line is surveyed and obtained, and a vehicle exhaust gas emission calculating platform is initialized; second, the basic parameter of a multi-objective genetic method is set, and a population of the multi-objective genetic method is initialized; third, based on the platform, the adaptive degrees of all individuals in the population are calculated; fourth, the non-domination sequence and the visual adaptive degree of the individuals in the population are calculated, a progeny population is generated through genetic section, genetic cross and genetic variation, and the adaptive degrees of all individuals of the progeny population are calculated; fifth, the population and the progeny population are combined to obtain a new population, the non-domination sequence and the congestion degree of all individuals of the new population are calculated, the individuals are chosen based on the non-domination sequence and the congestion degree, and the next generation population is obtained; six, when evolution algebra is larger than the best evolution algebra, execution of the method is completed, all the individuals with the non-domination sequence being equal to 1 in the last generation population are used as a final noninferior solution to be output, and the timing scheme in which the vehicle average delay and vehicle exhaust gas emission are comprehensively considered is obtained.
Owner:SOUTHEAST UNIV
Image enhancement method based on adaptive immunity genetic algorithm
InactiveCN104123706AIncrease contrastEnhance detailsImage enhancementGenetic modelsPattern recognitionVaccination
The invention discloses an image enhancement method based on an adaptive immunity genetic algorithm. The image enhancement method based on the adaptive immunity genetic algorithm includes steps that S1, normalizing an image pixel gray level f(x, y) to obtain n(x, y); S2, coding parameters (alpha, beta) to be optimized, randomly generating a group of initial individuals to form an initial population, and inputting a control parameter crossover probability p<c>, a mutation probability p<m>, a population size N, a maximum running algebra G and the like; S3, judging whether an evolution algebra t is equal to G, if so, ending the algorithm, and outputting the optimal solution of (alpha, beta), otherwise, turning to the next step; S4, using a roulette strategy to select M individuals, and carrying out crossover and mutation operations on the individuals according to crossover and mutation methods in genetic operation; S5, selecting two vaccines, the individuals to be vaccinated and a vaccination point number to perform immunization, making a immunization choice after the vaccination, and using the optimal individual retention strategy for the vaccinated population; S6, obtaining the corresponding nonlinear transformation function F(u) of each group of (alpha, beta), and using the nonlinear transformation function to perform an image gray level transformation to obtain an output image g(x, y).
Owner:XUZHOU UNIV OF TECH
Water transportation pipe network leakage positioning method based on Bayesian decision theory and genetic algorithm
InactiveCN103559399AGuaranteed timelinessEnsure positioning accuracySpecial data processing applicationsEvolution algebraBayes decision rule
The invention provides a water transportation pipe network leakage positioning method based on a Bayesian decision theory and a genetic algorithm, and relates to the water transportation pipe network leakage positioning method based on the Bayesian decision theory and the genetic algorithm. The water transportation pipe network leakage positioning method aims at solving the problems that the existing water transportation pipe network adopts a sound listening leakage positioning method, the work intensity is high, and in addition, the efficiency is low. The water transportation pipe network leakage positioning method is realized through the following steps that a PDD leakage model is built according to DMA; a water transportation pipe network with leakage is subjected to water pressure signal collection; according to the Bayesian decision theory, the leakage node number and the leakage quantity are used as independent variables, and the probability density of leakage accidents is used as a dependent variable to build a target function; the genetic algorithm is utilized for solving the functional expressions, after the evolution algebra is completed, individuals with the probability greater than the given value f' in the population are output, and the possible leakage occurring position is obtained; according to calculation results, monitoring personnel are assigned to the possible leakage occurring position for checking or restoring pipelines. The water transportation pipe network leakage positioning method is applicable to the field of water transportation pipe network engineering.
Owner:GUANGDONG HLDG +2
WSN node locating method based on heterogeneous double-population particle swarm optimization
The invention discloses a WSN node locating method based on heterogeneous double-population particle swarm optimization. According to the method, community self-adaptation activity behavior of animals in the nature is merged in a particle swarm optimization algorithm, a fitness function is designed based on the distance between an anchor node and an unknown sensor node, two heterogeneous child populations are used for maintaining good variety by simulating the community activity mode of the animals in the nature, a composite reverse learning strategy and an elite chaos search strategy are merged in the two child populations respectively by simulating the natural law that the animals in different communities in the nature have different preferences and habits, different search modes are carried out on the two child populations, advantage complement of various search modes is achieved, so that global searching ability is enhanced, and locating accuracy is improved. Meanwhile, communicating behavior of the animals in different communities in the nature is simulated, in appointed evolution generations at intervals, individuals are exchanged between the two child populations, sharing of high-quality search information and a guiding effect are achieved, and accordingly convergence speed is improved, and locating real-time performance is improved.
Owner:JIANGXI UNIV OF SCI & TECH
RNA secondary structure prediction method for quantum genetic algorithm based on multi-population assistance
The invention belongs to the technical field of bioinformatics and discloses an RNA secondary structure prediction method for a quantum genetic algorithm based on multi-population assistance. According to the method, a stem pool and a stem compatibility matrix of an RNA sequence is established according to the RNA sequence; quantum bit vectors are used to initialize multiple chromosome populations; quantum measurement is performed on each population; optimal individuals are acquired according to measurement results; the optimal individual b in all the populations is obtained and used to replace worst individuals, nonhomologous to b, among the optimal individuals in other populations, then all the populations are updated by use of different rotational angles, and other populations not participating in replacement are updated by use of a fixed rotational angle; and the process is iterated till a stop condition is met. Through the method, the global search capability and search efficiencyof the quantum genetic algorithm are effectively improved, and the evolution algebra of the genetic algorithm is lowered. Meanwhile, all the populations suppress competition and cooperate mutually, so that the globality of the algorithm is improved, and prediction accuracy is substantially enhanced.
Owner:XIDIAN UNIV
Discrete particle cluster algorithm based V-BLAST system detecting method
InactiveCN101159517AImprove bit error rate performanceVerify validitySpatial transmit diversityError prevention/detection by diversity receptionEvolution algebraCluster algorithm
The invention discloses a V-BLAST system detection method based on discrete particle swarm algorithm, which belongs to the technical filed of artificial intelligence and aims to overcome the disadvantages in the prior art, such as high calculation complexity and code error rate. The inventive method can provide better performance of code error rate and reduce the actual complexity. The method is implemented by the steps: 1. initializing a particle swarm with a size of m, randomly generating a position vector of each particle, the dimensional number of the position vector being the same as the transmitting antenna, wherein the setup variation rate is m, the evolution algebra t is zero and the condition of ending the determined algorithm is that the maximal iterative algebra is ga; 2. calculating the particle adaptability, judging whether the particle adaptability meets the condition of iterative termination, if meeting the condition, the algorithm is ended, otherwise going to the step 3; step 3, updating the particle position, executing the variation operation, updating the individual extreme value and the overall extreme value, and going to the step 2. The invention can be used to solve the detection problem of vertical layered space-time system in the field of wireless communication.
Owner:XIDIAN UNIV
Guidance tool error distinguishing method based on experiment design and evolutionary optimization
ActiveCN108827343AImprove search efficiencyAvoid the reverse solution processNavigation by speed/acceleration measurementsGenetic algorithmsEvolution algebraTime error
The invention provides a guidance tool error distinguishing method based on experiment design and evolutionary optimization. The guidance tool error distinguishing method comprises the following steps: S1: obtaining data information; S2: preprocessing the data information; S3: setting parameters: setting a target function, setting a constrain condition, setting a search space, setting a populationrange, and setting an evolution algebra; S4: according to an experiment design method, finishing multiple-time error coefficient distinguishing, and carrying out statistics on analysis results. According to the guidance tool error distinguishing method, under a condition of inertia / starlight combined guidance, multi-source measurement information is used, a ballistic trajectory recurrence methodbased on evolutionary optimization is adopted to carry out distinguishing on error coefficient, meanwhile, an experiment design scheme of multiple-time optimization is put forward, the optimization effect of a genetic evaluative algorithm is improved, and guidance tool error coefficients can be effectively separated. Compared with a traditional tool error distinguishing method, the guidance toolerror distinguishing method disclosed by the invention has obvious advantages.
Owner:NAT UNIV OF DEFENSE TECH
Multi-core SoC software mapping method based on multi-objective optimization
ActiveCN104536831AAvoid remapping workload problemsResource allocationBiological modelsEvolution algebraSoftware engineering
The invention relates to a multi-core SoC software mapping method based on multi-objective optimization. The method includes the following steps that, (1) objectives of multi-core SoC software mapping are optimized, wherein (11), decision variables in the multi-core SoC software mapping are determined, (12), constraint conditions of the multi-core SoC software mapping are determined, (13), a total objective function of the multi-core SoC software mapping is determined, (14), mapping expenditure between tasks and a processor is established based on the tasks and the processor, and (15), a corresponding expenditure matrix between communication events and the processor is established; (2), multi-objective evolution of the multi-core SoC software mapping is conducted, wherein multi-objective evolution of the multi-core SoC software mapping is conducted includes the following procedures of (21), coding, (22), initial chromosome population generation, (23), constraint regulation violation inspection, (24), fitness calculation, (25), selection, (26), variation, (27), hybridization, and (28), repeating of the procedure (23) to the procedure (27) till a preset evolution algebra is acquired.
Owner:北京神舟航天软件技术股份有限公司
Wireless microwave rain measurement link planning method based on fitness optimization
ActiveCN110533233AFast convergenceImprove robustnessForecastingResourcesMathematical modelPlanning method
The invention discloses a wireless microwave rain measurement link planning method based on fitness optimization, and the method comprises the following steps: 1), obtaining the spatial distribution data of a wireless microwave base station, carrying out the preprocessing, and building a topological rule for a station and a to-be-selected link; 2) establishing a precision and cost mathematical model of the microwave rain measurement link; and 3) searching for an optimal solution by using an adaptive algorithm, decoding the optimal solution, and drawing a planned route. The invention aims at the influence of planning of a wireless microwave rain measurement link on actually measured rainfall precision and expense cost. Five types of influence factors are comprehensively considered for refined analysis, an objective function of rain measurement precision and link cost is established, a mutation operator and a crossover strategy based on the maximum evolution algebra are adopted for solving, a self-adaptive multi-objective optimization algorithm oriented to multi-objective optimization is achieved, and high robustness is achieved while convergence is accelerated. The method is suitable for optimal layout of the wireless microwave rain measurement link of the urban high-density base station.
Owner:HOHAI UNIV
Recommendation method and device
ActiveCN107169029AAccurate, novel and comprehensive personalized recommendationsIncrease adoption rateSpecial data processing applicationsEvolution algebraPreference data
The invention is suitable for the technical field of computer, and provides a recommendation method and device. The method comprises the following steps of: receiving history recommendation preference data; obtaining an extreme point of a recommendation target; generating a corresponding current population; calculating a target function value of the current population; selecting a preset quantity of individuals from the current population according to the target function value to group a parent population; carrying out an evolution operation on the parent population; generating a child population; when the current evolution algebra does not exceed a preset evolution algebra threshold value, combining the parent population and the child population to generate a next generation of evolution population; setting the next generation of evolution population as the current population; adding 1 to the current evolution algebra; calculating the target function value of the current population again; repeating the steps until the current evolution algebra achieves an evolution algebra threshold value; and setting the parent population as a recommendation result so as to realize correct, novel and comprehensive personalized recommendation and then improve the recommendation adoption rate.
Owner:SHENZHEN UNIV
Radar sub-array dividing optimization method based on difference algorithm
ActiveCN105842666AThe principle is simpleSatisfied with the optimization effectRadio wave reradiation/reflectionEvolution algebraRadar
The invention discloses a radar sub-array dividing optimization method based on a difference algorithm, comprising steps of obtaining a covariance matrix of a reception signal of the radar array and a beam pointing guiding vector, respectively arranging a radar array to divide the quantity of the sub-array, the number of the difference algorithm populations, and the variation operator, and a first generation variation rate, a crossover rate and a maximal evolution algebra in the difference algorithm, obtaining a target function and a Gth generation population XG of the sub-array of the radar array on the basis of the difference algorithm, calculating the Gth generation variation population of the sub-array of the radar array on the basis of the difference algorithm according to the first generation variation rate, obtaining the Gth generation crossover population of the sub-array of the radar array on the basis of the difference algorithm, performing comparison on the target function value corresponding to each of the crossover individuals and the target function value corresponding to each of the individuals in the XG in one-to-one correspondence to obtain the Gmth generation population X<Gm> of the sub-array of the radar array on the basis of the difference algorithm, and using the individual which has the biggest target function value in the X<Gm> as the optimal sub-array of the radar array based on the difference algorithm.
Owner:XIDIAN UNIV
Genetic fuzzy control method of joint angles by functional electrical stimulation
ActiveCN101846977AEasy to controlAdjust the quantization factor in real timeAdaptive controlCurrent modeProportionality factor
The invention relates to the field of physical rehabilitation by functional electrical signal stimulation for accurately and stably controlling a current mode of an FES (Functional Electrical Stimulation) system in real time and effectively improving the accuracy and the stability of the FES system. The technical scheme adopted by the invention comprises the following steps of: firstly, confirming a quantifying factor, a proportionality factor and membership function parameters of fuzzy control; secondarily, selecting suitable final evolution algebra G, crossover probability Pc and mutation probability of a genetic algorithm; optimizing by the genetic algorithm to reach the optimal state and acquiring a fuzzy control decision variable kfuzzi; calculating system output and a deviation between the system output and a muscle model under new fuzzy control parameters, and entering the self-adaptive fuzzy controller parameter adjusting step of the next genetic algorithm; and repeating the process to finally realize the self-adaptive online adjustment of the fuzzy controller parameters to be used in the FES system. The invention is mainly applied to the genetic fuzzy control of joint angles by the functional electrical stimulation.
Owner:大天医学工程(天津)有限公司
Improved evolutionary neural network architecture search method based on super network
PendingCN112561039AImplement global searchSolve the deep coupling relationshipCharacter and pattern recognitionArtificial lifeEvolution algebraAlgorithm
The invention relates to an improved evolutionary neural network architecture search method based on a super network. The method comprises the following steps of S1, taking an input layer as a first layer, and packaging five calculation modules; S2, binarizing the connection of the computing nodes in the neural network; S3, learning a structure weight for each computing node, and S4, constructinga parent population P by adopting a binary fancy competition selection method. S5, forming a filial generation population Q; and S6, performing mutation operation on individuals in the filial generation population Q. S7, decoding each individual in the filial generation population Q into a corresponding neural network to obtain a structural weight; and S8, combining the parent population P and thechild population Q into a population R, selecting a plurality of individuals as an original population of the next generation by adopting an environment selection method, and feeding back to the stepS4 until a predetermined maximum evolution algebra is reached, and after the evolution is finished, outputting the individual with the highest fitness value as the optimal neural network architecture.
Owner:上海悠络客电子科技股份有限公司
BGA (Ball Grid Array) welding spot structure parameter optimization method for reducing power cyclic stress
ActiveCN108875219AImprove reliabilityDiversity guaranteedArtificial lifeDesign optimisation/simulationEvolution algebraRegression analysis
The invention discloses a BGA (Ball Grid Array) welding spot structure parameter optimization method for reducing a power cyclic stress. The method comprises the following steps that: 1) establishinga COMSOL welding spot simulation analysis model; 2) obtaining the thermal stress value of a welding spot; 3) determining the influence factor of the thermal stress value; 4) determining a parameter level value of the influence factor; 5) obtaining an experiment sample; 6) obtaining a function relational expression between the influence factor and the thermal stress value; 7) carrying out regression analysis on the function relational expression to obtain a regression equation; 8) determining the correctness of the function relational expression; 9) adopting a random way to generate an initialpopulation; 10) obtaining a current evolution algebra gen and an optimal fitness value; 11) randomly forming M / 2 groups of paired individuals by M individuals, and carrying out an interlace operationon each group of paired individuals; 12) carrying out a mutation operation on the paired individuals; 13) carrying out evolution reversion on the paired individuals; 14) selecting the individual withthe optimal fitness value; and 15) after the population is updated, carrying out judgment again. The method has the advantages of good robust performance and simple calculation method, and great convenience is brought to later-stage BGA welding spot structure parameter optimization design.
Owner:GUILIN UNIV OF ELECTRONIC TECH
Return track way arrangement method for subway vehicle segment
The invention discloses a return track way arrangement method for a subway vehicle segment. The method comprises following steps: firstly, collecting the required to-be-returned vehicle information and the required to-be-returned track way information and establishing parameter sets of practical problems; secondly, selecting a proper encoding mode to configure the chromosomes and making population initialization rules so as to generate Z chromosomes to form an initial population P; then, according to the practical problems, determining an optimal target function and a constraint; and finally, determining a selection rule of individuals and a specific operation mode of hybridization and variation, calculating an adaptive value of each individual and storing the individual with the biggest adaptive value according to a fitness function and repeating the operation until reaching to a maximum evolution algebra. By use of the return track way arrangement method, train tasks can be properly selected or rejected and an optimal track way arrangement scheme can be found under a resource constraint condition; a decision support is provided for subsequent daily inspection and shunting operation; and working efficiency of the vehicle segment is greatly increased.
Owner:NANJING UNIV OF SCI & TECH
Switch rectifier multi-objective optimization design method based on NSGA-II algorithm
ActiveCN110633494AImprove performanceSolve the selection problemElectric energy managementSpecial data processing applicationsEvolution algebraLeading edge
The invention provides a Switch rectifier multi-objective optimization design method based on an NSGA-II algorithm, and belongs to the technical field of rectifier parameter optimization design. The method comprises the following steps: 1, determining an optimized component and carrying out power and volume modeling; 2, defining a target function; 3, initializing a population; 4, selecting; 5, selecting binary match; 6, crossing; 7, realizing variation; 8, combining the parent population and the offspring population to obtain a first generation population; 9, forming populations by utilizingthe parent population and the offspring population; 10, reaching the maximum evolution algebra gen; and 11, outputting a Pareto optimal solution leading edge and a parameter matrix, according to the selected target performance indexes, obtaining corresponding decision variable values, namely solutions of the optimization problem, and selecting and designing components according to the parameters.
Owner:HARBIN UNIV OF SCI & TECH
Multi-cleaning robot task assignment method in large-scale indoor environment
ActiveCN108594813AEvenly distributedPosition/course control in two dimensionsVehiclesEvolution algebraRobotic systems
The invention discloses a multi-cleaning robot task assignment method in a large-scale indoor environment, comprising the following steps of: performing global environment segmentation; encoding segmented sub-regions; setting an evolution algebra counter t=1, the number of iterations T, the number of robots k, and the number of populations N; selecting an initial route P(t) and a breakpoint B(t);calculating the sum of sub-map areas Ai (I = 1, 2, .. k) connected to sub-paths of sub-travel paths Hi (I = 1, 2, ... k) of each individual robot i, and calculating the maximum of k values; recordingthe best solution in the contemporary population according to an objective function; performing genetic operator operation to obtain a next generation path P(t+1) and a breakpoint B(t+1); performing termination condition judgment that whether the maximum number of iterations is reached; and for the output optimal solution, using the 2-opt algorithm to optimize each sub-travel path itself. This method enables the entire robot system to perform tasks with greater efficiency.
Owner:苏州灵视视觉科技有限公司
Improved image enhancement method
ActiveCN107507157AIncrease contrastEnhance detailsImage enhancementArtificial lifeGenetics manipulationControl parameters
The present invention provides an improved image enhancement method. The method comprises: S1, performing normalization processing of image pixel gray level f(x, y) to obtain n(x, y), wherein an improved normalization processing mode is employed: (img file='dest_path_image001. TIF' wi='255' he='183' / ); S2, performing coding of parameters to be optimized (img file='dest_path_image002. TIF' wi='37' he='71' / ), randomly generating one group of initial individuals to form an initial population, and inputting a control parameter crossover probability pc, a mutation probability pm, a population size N, the maximum operation algebra G and the like; S3, determining whether an evolution algebra t is equal to the G or not, if the evolution algebra t is equal to the G, finishing the algorithm, and outputting the optimal solution of the (img file='dest_path_image003. TIF' wi='37' he='88' / ), or else, turning to the next step; S4, employing a roulette strategy to select M individuals, and performing crossover and mutation operation of the individuals according to the crossover and mutation method in the genetic manipulation; S5, selecting two vaccines, individual number to be inoculated and the inoculation site number to perform immunization operation, making out immunization selection after inoculation, and employing the optimal individual reservation strategy of the population after the inoculation; and S6, allowing one group (img file='dest_path_image004. TIF' wi='37' he='71' / ) to correspond to one non-linear transformation function F(u), and employing a non-linear transformation function to perform image gray scale transformation to obtain an output image g (x, y).
Owner:XUZHOU UNIV OF TECH
Polarity searching method of fixed-polarity Reed-Muller logic circuit
ActiveCN107330201AAbility to avoid prematureFast convergenceSpecial data processing applicationsLocal optimumEvolution algebra
The invention provides a polarity searching method of a fixed-polarity Reed-Muller logic circuit. The best polarity of an FPRM logic circuit is searched by using the new binary differential evolution algorithm, compared with a polarity searching method of the FPRM logic circuit based on the genetic algorithm, the capacity of local optimum and the capacity of premature convergence are avoided, and the convergence rate and the polarity searching efficiency are improved. The method comprises the following steps that firstly, a Boolean logic circuit is read; secondly, an evolution parameter is input; thirdly, an initial population is generated randomly, wherein the polarity is encoded into a binary individual; fourthly, the improved binary stochastic mutation operation is performed; fifthly, the binomial crossover operation is performed; an FPRM expression of the target individual and the FPRM expression of a test individual of the target individual are obtained; seventhly, the fitness value of the target individual and the fitness value of the test individual of the target individual are calculated; eighthly, the greedy selection operation and an elitism selection strategy are performed; ninthly, if the current evolution algebra is smaller than the maximum evolution algebra, the fourth to eighth steps are executed in sequence, and otherwise, the best polarity is output.
Owner:BEIHANG UNIV
A Timing Method of Mainline Green Wave Coordinated Control Signals for Optimizing Exhaust Emission
ActiveCN103593986BReduce pollutionReduce traffic delaysControlling traffic signalsEvolution algebraControl signal
Owner:SOUTHEAST UNIV
Method and device for selecting histidine terahertz absorption spectrum wavelength based on differential evolution
ActiveCN106706551AHigh precisionImprove applicabilityMaterial analysis by optical meansArtificial lifeEvolution algebraLength wave
The invention relates to a method and a device for selecting histidine terahertz absorption spectrum wavelength based on differential evolution. The method comprises the following steps of firstly, performing differential-based mutation operation and crossing operation on an initial population, so as to obtain a crossing population; respectively utilizing the initial population and the crossing population to select from the terahertz absorption spectrum of a histidine sample, and utilizing a constructed fitness function to respectively calculate the fitness of each individual of the initial population and the crossing population; reserving the individual with higher fitness, so as to obtain a new generation of population; finally, using the new generation of population as a new initial population to perform evolution and iteration, until an evolution algebra reaches the setting threshold value, and selecting the individual with highest fitness value in the final population as the selected optimal solution of the histidine terahertz absorption spectrum wavelength. The method has the advantage that by performing gradual-point depth selection on the terahertz absorption spectrum of the histidine sample, the useful information is selected, so as to obviously improve the accuracy of quantitative analysis, and obtain a good application effect.
Owner:HENAN UNIVERSITY OF TECHNOLOGY
Multi-jobshop scheduling method and apparatus
ActiveCN106875031AHigh feasibilityFast convergenceGenetic modelsForecastingEvolution algebraDual mode
The invention is suitable for the technical field of a computer, and provides a multi-jobshop scheduling method and apparatus. The multi-jobshop scheduling method includes the steps: when receiving a request of multi-jobshop scheduling, establishing a mathematical model of multi-jobshop scheduling, and using a preset dynamic population strategy and a dual-mode difference evolution operator to perform evolution on the individuals in the current population of the mathematical model; and when the current evolution algebra of the current population does not satisfy a preset population evolution termination condition, setting the non-dominated individuals in the evolved current population as the current population of the next generation of mathematical model, repeatedly executing the step of evolving the individuals in the current population of the mathematical model until the current evolution algebra satisfies the population evolution termination condition, and then setting the non-dominated individuals in the evolved current population as the solution of a parameter to be solved in the mathematical model so as to obtain the solution of multi-jobshop scheduling, thus improving the convergence capability and robustness during the multi-jobshop scheduling process.
Owner:SHENZHEN UNIV
A forest fire monitoring system node effective dynamic coverage method based on the Internet of Things
InactiveCN109784465AImprove efficiency of optimized deploymentsReduce computational costGenetic modelsComplex mathematical operationsEvolution algebraAlgorithm
The invention discloses a forest fire monitoring system node effective dynamic coverage method based on Internet of Things. The method comprises the following steps: setting parameters: a population size NP, a scale factor F, a cross probability CR and a maximum evolution algebra Gmax; Randomly generating an initial population with a population size of NP, and solving a fitness value of an NP individual; Judging whether a termination criterion is met or not, and performing DE variation operation, DE crossover operation and DE selection operation on the current population individual; Executinga local search algorithm SQI; And finally outputting the obtained best result. According to the invention, the problems of high calculation cost and low efficiency of effective coverage of forest firemonitoring Internet of Things nodes in the prior art are solved.
Owner:YANAN UNIV
Super-multi-objective optimization method, system and terminal based on dynamic decomposition and selection
The invention belongs to the technical field of computers, and discloses a super-multi-objective optimization method, system and terminal based on dynamic decomposition and selection, and the method comprises the steps: randomly initializing a population P with N individuals; selecting N excellent individuals as the next generation evolution filial generation P by using the DDS, and calculating the distance between the selected individual and the hyperplane and the distance between the reference points corresponding to the individuals; initializing a filial generation population O as a null set; aiming at N individuals in the parent generation, starting circular processing; initializing R used for storing offspring individuals, and selecting a mating individual from the current parent by utilizing MatingSelection; using SBX and PM for generating a filial generation R for the two parent generations, and adding the filial generation R into the filial generation population O; and repeatedly carrying out population selection until the maximum evolution algebra is reached. According to the method, the convergence of each generation of individuals and the diversity among the individuals are used as information of mating variation of the individuals, so that progenies can be promoted to evolve towards a better direction.
Owner:CHINA UNIV OF GEOSCIENCES (WUHAN)
Rapid high-path coverage rate test case generation method
ActiveCN109918304AReduce build timeImprove path coverageSoftware testing/debuggingEvolution algebraRelationship - Father
The invention provides a rapid high-path coverage rate test case generation method, which comprises the following steps of: obtaining a control flow graph of a target program, and determining father-child relations in multiple nodes in the flow graph; judging whether each node is a branch node or not; obtaining a test case set, taking each test case as an individual in a genetic algorithm, and forming an initial population by a plurality of individuals; constructing a branch crossing matrix; calculating a branch deviation degree of crossing any one branch node in the current generation population according to the constructed branch crossing matrix; Calculating the branch deviation degrees of all the branch nodes in the program, and taking the sum of the branch deviation degrees of all thebranch nodes as the program deviation degree of the individual traversing program in the current generation of population; and performing iterative optimization according to the constructed branch crossing matrix and the program deviation degree by using a genetic algorithm, and obtaining the next generation of population and the program deviation degree of the next generation of population crossing the tested program until a test case covering the target path is generated or the maximum evolution algebra of the genetic algorithm is reached.
Owner:MUDANJIANG NORMAL 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 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