428 results about "Selection (genetic algorithm)" patented technology

The invention discloses an intelligent layout method used for a rectangular part. The method comprises the steps that S1 relative parameters of the genetic algorithm are initialized; S2 relative information of the rectangular part is extracted from a rectangular part bank to be laid out; S3 relative information of raw material boards is extracted from a board tank; S4 the obtained information is coded, and primary species are generated randomly; S5 one-by-one decoding is conducted on the primary species by means of the lowest horizontal line search algorithm to obtain solution using efficiency; S6 selection, crossover and mutation operation is conducted according to the genetic algorithm until iteration is finished, and the optimal layout scheme is output. According to the intelligent layout method, the process requirement of the rectangular part can be met well, the intelligent algorithm and the heuristic algorithm are combined, one optimizing scheme can be found rapidly and efficiently, and therefore the material using rate of an enterprise is greatly improved, layout time can be obviously shortened, and layout efficiency is improved.

The invention relates to a task observation plan solution method and system based on a genetic algorithm for multiple agile satellites. The method and system can support task planning of the agile satellites, and a target function and a constraint analysis model are constructed according to the features of the agile satellites; by figuring out a solution to the constructed constraint analysis model satisfying task planning, selection, overlapping and variation of genetic searching algorithms are conducted to achieve conflict between every two adjacent tasks, an observation planning scheme is optimized, an optimal observation plan satisfying constraint conditions is generated, the resource utilization rate of the satellites is improved, and a timeliness problem during task execution of theagile satellites is solved. For different task conditions, different disposal methods are selected to achieve reasonable distribution of satellite resources, the quantity of single-track observation tasks is increased, and the response timeliness is improved.

The invention belongs to the technical field of personalized recommendation, and particularly relates to a method and system for solving a cold start problem in a collaborative filtering technology. The method for solving the cold start problem in the collaborative filtering technology comprises the steps that a data set is selected; an initial user or project clustering model is built through an optimized genetic algorithm; clustering is conducted on the basis of the initial user or project clustering model, and a user or project clustering model is obtained; entropy values of new users or new projects to all kinds of clusters in the clustering model are calculated, and the new users or the new projects are subjected to class cluster dividing; the new users or the new projects are recommended. The invention further provides a system for solving the cold start problem in the collaborative filtering technology. The system comprises a selection module, an initial model building module, a clustering module, a class cluster dividing module and a recommendation generation module. Accordingly, an improved genetic algorithm is utilized for conducting K-Means clustering, the initial user or project clustering model is generated, and recommendation is generated for the new users or the new projects.

The invention discloses an intelligent stock-layout optimization method for woodworking sheet parts. The intelligent stock-layout optimization method includes the steps of S1, initializing relative parameters of a genetic algorithm, S2, selecting information of rectangular parts to be subjected to stock layout from a part library, S3, selecting relative information of woodworking sheets, capable of being used for stock layout of the rectangular parts, from a woodworking stock library, S4, encoding the information of the rectangular parts to be subjected to stock layout and generating an initial population randomly, S5, decoding the initial population one by one by a surplus rectangle filling based 'guillotine cutting' algorithm to acquire utilization rate of each stock layout scheme, and S6, optimizing the stock layout schemes by means of selection, crossover and mutation operations through the genetic algorithm, and outputting the optimal scheme correspondingly. According to the intelligent stock layout optimization method, 'guillotine cutting' process requirements for woodworking rectangular parts can be met, the optimal scheme can be found rapidly by means of combination of the intelligent algorithm and the heuristic algorithm, and thus, stock layout time is shortened obviously while material utilization rate of enterprises is increased greatly, and stock layout efficiency is increased.

The present invention discloses an active power distribution network frame planning method on the basis of a bi-level planning. The active power distribution network frame planning method on the basis of the bi-level planning comprises the following steps: the first step, bi-level planning model constitution; the second step, gene code; the third step, formation of an original scheme; the fourth step, individual good and bad evaluation; the fifth step, genetic operation; and the sixth step, selection of an optimal scheme. According to the invention, a model is established about an active power distribution network frame planning problem on the basis of a bi-level planning concept, and an improved genetic algorithm is used for solution. Compared with a traditional active power distribution network frame planning method, the bi-level planning concept and the improved genetic algorithm are led in the active power distribution network frame planning method on the basis of a bi-level planning to solve problems. In respect of modeling, the bi-level planning model adopted by the invention is converted to a bi-level planning problem, namely an upper layer planning problem is the construction of a line and the lower layer planning problem is minimum active power output excised amount of distributed generation under the network frame.

The invention discloses a method for optimizing cutting consumption and energy consumption of a machine tool based on an adaptive genetic algorithm, comprising the following steps: 1) a step of determining model optimization variables; 2) a step of determining an optimization objective function; 3) a step of determining constraint conditions in the model; 4 ) using an adaptive genetic algorithm to determine the cutting amount. The advantages of the present invention are: because the present invention adopts the self-adaptive genetic algorithm scheme, it is more reasonable in the selection of the cutting amount, effectively improves the utilization efficiency of the machine tool, and reduces energy consumption.

The invention discloses an air source heat pump multi-objective optimization design method of a non-dominated sorting genetic algorithm assisted by a SVR neural network. The method comprises the following steps: step 1, carrying out parameter selection and data processing according to design requirements; step 2, creating, training and testing a neural network; step 3, performing multi-objective optimization on the air source heat pump by using a non-dominated sorting genetic algorithm based on the trained SVR neural network; and step 4, obtaining the parameter value of the input variable of the optimal solution according to the Pareto solution through the above steps, thereby obtaining the design parameter value of each component, and feeding back the design parameter value to a designer.The SVR neural network assisted non-dominated sorting genetic algorithm-based air source heat pump multi-objective optimization design method provided by the invention is relatively high in precisionand can quickly realize COP and cost multi-objective optimization of a system.

The invention relates to a soft measurement method for granularity of cement raw material grinded by ball mill. The method comprises: selection of auxiliary variables, wherein a rotating speed of a powder concentrator, a feeding flow, an inlet wind pressure of the powder concentrator and a load of the powder concentrator are used as auxiliary variables of the soft measurement model for granularity of finished products; Data pre-treatment, wherein original data are screened, filtered and standardized; soft measurement modeling based on GA-NN (genetic algorithm optimized neural network), wherein a learning algorithm used for neural network training is brought forward based on GA (genetic algorithm), weights needed to be adjusted in a network are recognized as chromosomal genes, and the network training process is completed through chromosome selection, crossover and mutation; and correction of the soft measurement model by using a long-term correction way. The method can measure quite important finished product granularity parameters which are hard to be directly detected, thereby being capable of implementing advanced control and optimized method for a raw material grinding process by the ball mill.

The invention relates to the rehabilitation training field and aims to optimize the quantifying factor and scale factor of a fuzzy controller and the fuzzy control rules, then control the current mode of an FES system accurately, stably and instantly and effectively improve the accuracy and stability of the FES system. The technical scheme adopted by the invention is as follows: the walking aid electrostimulation fine control method based on genetic-ant colony fusion fuzzy controller comprises the following steps: firstly, converting the selection of fuzzy control decision variable to the combinational optimization problem adapting to the genetic-ant colony algorithm, coding the decision variable, randomly generating a chromosome composed of n-numbered individuals; secondly, using the genetic algorithm to generate the initial pheromone distribution of the ant algorithm, utilizing the ant colony algorithm to randomly search and optimize the membership function, quantifying factor and scale factor of the fuzzy controller; and performing repeated self-learning and self-regulating according to the system output, and finally using the processes in the FES system. The invention is mainly used for rehabilitation training.

The invention relates to a multi-objective optimization computing unloading method in a mobile edge computing network, and belongs to the field of Internet of Things and artificial intelligence. The method is based on a joint optimization model oriented to time delay and energy consumption, and power selection and proportional unloading of multiple users during task unloading are realized by designing an intelligent algorithm GPSO. Firstly, a network architecture of mobile edge computing is determined, modeling is conducted according to the network architecture, models comprise a system model,an application program model, a communication model and a computing model, then an objective function is solved according to the established models, and a problem is converted into a mixed nonlinearprogramming problem. And finally, a hierarchical calculation algorithm GPSO based on a particle swarm algorithm and a genetic algorithm is designed, thereby realizing user unloading proportion strategy and power selection under delay and energy consumption joint optimization. According to the method, optimal selection of a multi-user task unloading strategy in mobile edge computing is realized byutilizing related intelligent algorithms in the field of artificial intelligence.

Systems and methods are disclosed that utilize a genetic algorithm to search for an index configuration for a collection of data such as, e.g., a database. Genetic algorithms can include stochastic search heuristics that mimic processes of natural evolution including inheritance, mutation, crossover, and selection. A population of chromosomes representing candidate index configurations can evolve to increase or optimize the fitness of the population and to identify the best (e.g., most fit) index configuration. Fitness of a chromosome may be measured based at least in part on the cost of computer resources used for executing Structured Query Language (SQL) statements in the indexed database. In various implementations, virtual indexing may be used to simulate building an index, chromosomes may be encoded using non-bitmapped representations of index configurations, chromosomes may include genes representing a column in a table in a database, dropping an index from a table in a database, or a composite index for a database, and/or a participation pool may be used to select fitter genes for an initial population of chromosomes.

The invention discloses an air source heat pump multi-objective optimization design method integrating a BP neural network and a multi-parent genetic algorithm. The air source heat pump multi-objective optimization design method comprises the following steps that 1, performing parameter selection and data processing according to design requirements; Step 2, creating, training and testing a neuralnetwork; Step 3, performing multi-objective optimization on the air source heat pump by using a multi-parent genetic algorithm based on the trained neural network; And step 4, obtaining the parametervalue of the input variable of the optimal solution according to the Pareto solution through the above steps, thereby obtaining the design parameter value of each component, and feeding back the design parameter value to a designer. The BP neural network assisted multi-parent genetic algorithm air source heat pump multi-target optimization design method is high in precision and capable of rapidlyachieving multi-target optimization of COP and cost of a system.

The invention relates to an AGV scheduling method, in particular to an AGV scheduling method based on an ant colony and a genetic algorithm. A vehicle capacity factor and a time window factor are introduced into the ant colony algorithm to improve the ant state transition probability, and a pheromone volatilization factor is improved, so that the pheromone volatilization factor can be automatically adjusted along with a calculation process, meanwhile, a pheromone updating strategy is improved, and elite ants exceeding a globally optimal solution are rewarded. And finally, local optimization isperformed on an optimal solution obtained by the ant colony algorithm by using selection, crossover and mutation operators in the genetic algorithm. The algorithm convergence speed is increased, thesolution quality is improved, the defects that when a traditional optimization algorithm is used for path planning, the convergence speed is low, and local optimum is likely to happen can be obviouslyovercome, the solving efficiency of actual problems can be improved, and blindness of the iteration process is reduced.

The invention discloses a double-resource die job shop scheduling optimization method based on an AMAS-GA nested algorithm. On the basis of comprehensively analyzing energy consumption, completion time and equipment and personnel load conditions of a workshop, a double-resource job shop multi-target scheduling problem model is established, wherein the load balance condition of equipment and personnel is measured by calculating the standard deviation of the accumulated load of the equipment and personnel, and the energy consumption of the shop considers the energy consumption of the equipment in standby and processing states; secondly, an AMMS-GA nested algorithm is designed to carry out scheduling model optimization solution, and procedure sorting is carried out by adopting a genetic algorithm by an inner layer according to a resource selection result as a constraint; and finally, a scheduling scheme result is fed back to an outer layer algorithm to influence selection of ants on resources. The method can be used for workshop scheduling and production scheduling, the workshop production efficiency is improved, energy consumption is reduced, green and energy-saving production is promoted, and meanwhile equipment and personnel load balance in production can be met.

The invention discloses a BP neural network wind speed prediction method based on genetic algorithm optimization. The method comprises the following steps: firstly, collecting wind speed data of a wind power plant, establishing a BP neural network prediction model, and estimating an initial value range; then, performing real number coding on the weight and the threshold of the neural network, randomly generating a group of initial individuals to form an initial population, and each initial individual represents an initial solution of a problem; calculating the fitness of each individual in thepopulation, performing selection, crossover and mutation operations to form a next generation of population, evaluating the fitness of the individuals in the new population, judging convergence conditions, selecting an optimal individual, and taking the optimal individual as an initial weight and a threshold of the neural network; and finally, training by utilizing matlab to obtain a wind speed prediction value. According to the method, the wind speed prediction efficiency and accuracy of the BP neural network are improved.

An ant-colony-algorithm-based extraction method of intelligent olfaction spectrum characteristics representing the difference of honey is disclosed. The ant colony algorithm belongs to the heuristic feature selection approach, and automatically starts to find the best result from the characteristic points by utilizing the automatic iterative evolution of algorithm until the best result is found. The extraction method is characterized in that: ant colony algorithm is applied to selection of characteristic points, and the ant colony algorithm is applied to simulate genetic algorithm. Bayes of selected characteristic points is utilized to judge the accurate rate, and selected characteristic points are utilized to construct a fitness function to find an optimum vector combination. The main innovation points of the algorithm comprises: (a) the number of selected characteristic points is added into the fitness function, a cost parameter is set, through the adjustment of the parameter, the number of the characteristic points and judgment accurate rate can be selected according to the needs; (b) in order to avoid the update direction error caused by special points, an optimum collection is established, and the optimum collection replaces the single optimum point to carry out selection; (c) the update grade of biotin is in a direct ratio relationship with the improvement of the fitness function, the optimizing effect of the algorithm is good, and thus the upgrade range is increased; (d) in order to accelerate the calculation speed, the volatile speed of vectors with a bad effect is accelerated, thus the concentration of pheromone is decreased, so that the disturbance on the latter calculation is reduced.

The invention relates to an algorithm for identifying a key protein based on a genetic algorithm in a PPI network. The algorithm comprises the steps of generating an initial population in a protein interaction network; calculating the fitness of individuals; performing selection operation by a roulette wheel method; performing crossing operation and mutation operation among the randomly selected individuals; and performing local optimization on multiple individual solutions. According to the algorithm, the defects of existing methods are overcome; indexes are optimized and bio-information is fused, so that the reliability is higher and lots of unnecessary calculations are reduced; and the predicted key protein can be locally optimized, so that the efficiency of key protein identification is improved, and the application range and practicality of the technology in the field of the bio-information are expanded and improved.

The invention discloses a hybrid genetic algorithm-based calculation unloading method in mobile edge calculation, which comprises the following steps: S1, establishing a system model to obtain calculation time delay of a sub-task set in each processor and transmission time delay among the processors, and determining each task layer value in the sub-task set according to a constraint relationship of the sub-task set; S2, initializing a population according to the determined task layer value and a random strategy to obtain initial population individuals of the sub-task set, performing symbol coding to obtain a task scheduling sequence, and optimizing the individuals in the initial population; S3, constructing a fitness evaluation function, and performing selection operation on individuals inthe optimized initial population; S4, constructing a crossover mechanism, and crossover individuals in the new population by using crossover operation based on a tabu table search algorithm; S5, performing mutation operation on individuals in the new population by using mutation operation based on a simulated annealing algorithm; and S6, judging whether the iteration step length is reached or not, and if not, repeating the step S3-S5; and if so, outputting a globally optimal solution.

The invention relates to a fingerprint image segmentation method based on artificial immunogenetics and morphology, belonging to the technical field of image processing. In the invention, an optimal segmentation threshold is calculated by an artificial immunogenetic method; the algorithm integrates the immune mechanism and evolution mechanism, absorbs the advantage of parallel searching in the genetic algorithm, can effectively prevent the phenomenon of colony degradation on the basis of quick searching by vaccine inoculation and vaccine selection, and uses fingerprint image grey scale value consistency and antibody concentration in the segmentation method based on grey scale and gradient distribution as the affinity function of the antibody to carry out genetic iteration, thereby generating the optimal antibody; and therefore, the method can effectively segment the fingerprint image, has the characteristics of favorable segmentation effect, high robustness, low calculation amount and low time consumption, and can satisfy the requirement for real-time fingerprint identification.

The invention discloses a mobile robot path planning method based on an improved genetic algorithm. The mobile robot path planning method comprises the following steps of carrying out environment modeling on a robot moving space by using a grid map, setting algorithm parameters and initializing a population, constructing a fitness function by utilizing the path length function and the smoothness function, introducing an elitist retention strategy, namely, when roulette selection is carried out, retaining the optimal individual to the next generation, and continuously carrying out crossover mutation operation, dynamically adjusting the population by adopting an adaptive crossover rate and a mutation rate, and judging whether the evolutionary frequency reaches the maximum or not, if so, outputting an optimal solution, and if not, repeating the steps. When the method is applied to path planning of the mobile robot, the optimal solution searching capacity of the mobile robot is enhanced, the convergence speed of the mobile robot is increased, and the turning frequency is reduced.

The invention discloses an optimized and improved fuzzy classification model construction method based on a nondominated sorting genetic algorithm II (NSGA-II). The optimized and improved fuzzy classification model construction method based on the NAGA-II reduces characteristic variable, a fuzzy rule and redundancy of antecedent of the fuzzy rule, and improves explanatory of a fuzzy classification model. The optimized and improved fuzzy classification model construction method based on the NSGA-II comprises the following steps: firstly an initial decision tree is constructed by a C4.5 algorithm, the characteristic variable and fuzzy set numbers are selected; then a triangle subordinate function is utilized to convert the decision tree into the fuzzy classification model; and finally based on a NSGA-II optimized fuzzy classification model, the redundancy of the fuzzy rule is simultaneously deleted by selection of the fuzzy rule and the antecedent of the fuzzy rule, thereby improving accuracy and explanatory of the fuzzy classification model.