Patents
Literature
Patsnap Eureka AI that helps you search prior art, draft patents, and assess FTO risks, powered by patent and scientific literature data.

37 results about "Genetic programming algorithm" patented technology

Interpretable database query optimization method and system

The invention discloses an interpretable database query optimization method and system, and relates to the field of database query optimizing.The method comprises the steps that a random forest model is constructed based on a genetic programming algorithm; obtaining a to-be-queried SQL statement; generating a prompt set based on a scanning method and a connection method, and generating a query plan set for each to-be-queried SQL statement according to the prompt set; encoding each query plan in the query plan set to obtain a feature vector set; inputting the feature vector set into a random forest model, and outputting a judgment rule set, feature importance ranking and a prediction execution time set; determining the query plan corresponding to the minimum prediction execution time in the prediction execution time set as an optimal query plan; based on the optimal query plan, a database query engine executes a query. According to the method, the database is queried through the determined optimal query plan, so that the execution efficiency and credibility of query can be improved.
Owner:HANGZHOU DIANZI UNIV

Bridge scour formula optimized reconstruction method based on symbol regression

PCT designated stageWO2025166914A1Geometric CADConfiguration CADAlgorithmGenetic programming algorithm
A bridge scour formula optimized reconstruction method based on symbol regression. The method comprises: obtaining statistical data of bridge scour, and separately using the statistical data as a training set and a test set; determining an initial structure of a bridge scour formula; firstly, determining a candidate operator, then introducing a function group having significant physical importance and a statistical relationship in scour, and determining a candidate operation variable; by using a symbol regression method based on genetic programming, generating an optimization formula by using data of the training set; adjusting parameters and generating an alternative formula group; and, on the basis of the test set, performing formula effect evaluation and filtering out a formula form having an optimal predicted effect and the simplest formula structure. On the basis of existing standard formulas, by using a symbol regression method based on a genetic programming algorithm, a machine learning method having a nonlinear representation capability is fused, in order to more accurately mine rich features in data. Meanwhile, by combining prior knowledge of scour and a physical relationship, prediction performance and generalization of a scour calculation formula can be improved.
Owner:SOUTHEAST UNIV

Program generation method and device combining evolution calculation and deep learning, equipment and storage medium

The invention discloses a program generation method and device combining evolutionary calculation and deep learning, equipment and a storage medium, and relates to the technical field of computers.The method comprises the steps that an initial population is constructed according to target input data, a deep learning model and a genetic programming algorithm; crossing a plurality of initial individuals in the initial population to obtain a to-be-evolved population; according to the target deep learning model, performing semantic mutation on to-be-mutated individuals in the to-be-evolved population, and constructing an iterative population until the iterative population meets an evolution termination condition; and determining a target individual according to the fitness value of each iteration individual in the iteration population so as to determine a target symbol program. Through the above mode, the powerful search capability of evolutionary computation and the generalization capability of a large-scale pre-trained neural network model are combined, under the coding task, the search efficiency is improved, the precision of the automatic programming task is ensured, and the symbol program corresponding to the automatic coding task can be efficiently and accurately generated.
Owner:PENG CHENG LAB

Image classification method based on collaborative optimization algorithms and feature selection mechanism

PCT designated stageWO2025232076A1Internal combustion piston enginesCharacter and pattern recognitionAlgorithmGenetic programming algorithm
Disclosed in the present invention is an image classification method based on collaborative optimization algorithms and a feature selection mechanism, which effectively improves the image feature extraction quality and the image classification accuracy. The technical solution comprises: step S1, preprocessing a collected image; step S2, constructing an image feature extraction model on the basis of a genetic programming algorithm, performing image feature extraction, using the concept of individual information optimization to assign position and velocity information to each individual in the algorithm, and updating the position and velocity information of each individual to adjust a selection operator; step S3, constructing a feature selection model to perform selection on the extracted features; step S4, by using the selected features as inputs, training an SVM classifier; and step S5, using the trained SVM classifier to classify express delivery images.
Owner:YTO EXPRESS CO LTD

Intelligent substation micro-station equipment energy consumption prediction method based on symbol regression algorithm

The invention relates to an intelligent power transformation micro-station equipment energy consumption prediction method based on a symbolic regression algorithm, and the method comprises the steps: selecting the daily average temperature # imgabs0 #, the daily average humidity # imgabs1 #, the sunshine duration t and the traffic flow VF as four input features which affect the daily total energy consumption of an intelligent power transformation micro-station; three modules of a symbol regression algorithm based on adaptive iteration and control variable genetic programming: an adaptive iteration module, a control variable module and a genetic programming algorithm module are used for training a standard genetic programming algorithm; and inputting the sorted historical energy consumption data set into an intelligent power transformation micro-station equipment energy consumption prediction model based on a symbol regression algorithm to obtain a total energy consumption prediction value of the intelligent power transformation micro-station on the day. The method can effectively mine the potential relation between the characteristics in the data set, obtains the displayed prediction equation, and accurately predicts the energy consumption of the intelligent power transformation micro-station equipment. The search space of the algorithm can be reduced, the training time of the prediction model is shortened, and the model energy consumption prediction precision is improved.
Owner:YUNNAN TRAFFIC PLANNING DESIGN RESEARCH INSTITUTE CO LTD

Multi-unmanned aerial vehicle search strategy optimization method based on genetic programming

PendingCN120909309AInternal combustion piston enginesVehicle position/course/altitude controlGenetic programming algorithmMathematical logic
The invention relates to a multi-unmanned aerial vehicle (UAV) search strategy optimization method based on genetic programming (GP), which is characterized in that under a distributed model predictive control (DMPC) framework, each UAV is guided by a target function to realize a search trajectory optimization process, and essentially, a search strategy is converted into a mathematical logic mapping relation. In a traditional method, objective function construction mainly depends on a design thought dominated by artificial experience, and the fixed search mode based on subjectivity has the limitations of insufficient environmental adaptability, weak strategy generalization ability and the like in a complex dynamic environment. In order to solve the problem, the invention provides a search strategy optimization method based on a genetic programming algorithm, and online dynamic evolution and parameter adaptive adjustment of a search strategy are realized by establishing a dynamic mapping model between a strategy parameter space and a search performance index.
Owner:CHINESE PEOPLES LIBERATION ARMY UNIT 92728

Interface scheduling optimization method and device, equipment, storage medium and program product

PendingCN121387452AProgram initiation/switchingBiological modelsGenetic programming algorithmGene
The invention relates to the technical field of interface calling, and provides an interface scheduling optimization method and device, equipment, a storage medium and a program product, and the method comprises the steps: carrying out the gene coding of each to-be-called application interface, and obtaining the gene sequence of each application interface; the gene sequence corresponds to a scheduling scheme of the application interface; generating a population based on the gene sequence, and constructing a fitness function according to the evaluation index of the application interface; the evaluation indexes comprise a bandwidth utilization rate, a calling success rate and response duration; performing iterative optimization on the population based on the fitness function by adopting an improved genetic programming algorithm to obtain an optimal individual; and performing scheduling optimization on the application interface based on the target scheduling scheme corresponding to the optimal individual. Through gene coding and an improved genetic programming algorithm, intelligent optimization of an interface scheduling scheme is realized, manual intervention is reduced, optimization efficiency and accuracy are improved, and an optimization effect is ensured.
Owner:CHINA MOBILE GROUP ZHEJIANG +1

Hazardous chemical substance physicochemical property management system and method

PendingCN120975481AData processing applicationsEnsemble learningData setGenetic programming algorithm
The invention relates to the technical field of hazardous chemical substance safety management, and discloses a hazardous chemical substance physicochemical property management system and method.The hazardous chemical substance physicochemical property management method comprises the steps that hazardous chemical substance physicochemical property data are preprocessed, and a standardized data set is obtained; carrying out feature extraction and transformation; pre-learning a feature extraction and transformation result by using a deep neural network containing physical consistency constraint, and extracting a complex mode in the data; self-adaptive symbol regression is carried out, wherein expression search space is defined, nerve-guided search space pruning is carried out, and an improved genetic programming algorithm is applied; carrying out optimization and verification, and selecting an optimal mathematical expression as a prediction model of the physicochemical properties of the hazardous chemical substances; according to the method, through a mathematical expression generation technology based on symbol regression, high precision and interpretability of the prediction model are realized, and a user can intuitively understand a calculation process and physical significance of a prediction result.
Owner:南京鼐云科技股份有限公司

Mechanism data hybrid process system modeling method based on genetic programming algorithm

The invention discloses a mechanism data hybrid process system modeling method based on a genetic programming algorithm, and the method comprises the steps: carrying out the induction and construction of a normative mechanism symbol system from the perspective of energy transmission for the hybrid modeling demands of the complementation of the mechanism and data in the process industry, and carrying out the modeling of the mechanism data hybrid process system based on the genetic programming algorithm. Furthermore, through three steps of a model generation step based on genetic programming, a model setting step based on heuristic Powell and a model evaluation step based on graph complexity, a high-quality explicit model considering fitting accuracy and structure simplification is autonomously constructed, so that a good twinborn analysis basis is provided for a complex industrial system data monitoring scene in the process industry.
Owner:BEIHANG UNIV

Intelligent substation micro-station equipment energy consumption prediction system and method based on symbol regression algorithm

The invention relates to an intelligent power transformation micro-station equipment energy consumption prediction system and method based on a symbol regression algorithm, and the method comprises the steps: selecting daily average temperature, daily average humidity, sunshine duration t and traffic flow VF as four input features which affect the daily total energy consumption of an intelligent power transformation micro-station; three modules of a symbol regression algorithm based on adaptive iteration and control variable genetic programming: an adaptive iteration module, a control variable module and a genetic programming algorithm module are used for training a standard genetic programming algorithm; and inputting the sorted historical energy consumption data set into an intelligent power transformation micro-station equipment energy consumption prediction model based on a symbol regression algorithm to obtain a total energy consumption prediction value of the intelligent power transformation micro-station on the day. The method can effectively mine the potential relation between the characteristics in the data set, obtains the displayed prediction equation, and accurately predicts the energy consumption of the intelligent power transformation micro-station equipment. The search space of the algorithm can be reduced, the training time of the prediction model is shortened, and the model energy consumption prediction precision is improved.
Owner:YUNNAN TRAFFIC PLANNING DESIGN RESEARCH INSTITUTE CO LTD

Genetic programming symbol regression method based on multi-population asynchronous parallelism

The invention discloses a genetic programming symbol regression method based on multi-population asynchronization and parallelism, which comprises the following steps of: constructing a sub-population of a symbol model based on a genetic algorithm, and taking the symbol model as an individual of the sub-population; applying for a shared memory for an elite group of the symbol model, and applying for a message queue used for collecting elite individuals in a sub-group of each symbol model; iteratively executing selection operation, crossover operation, mutation operation and fitness evaluation on each sub-population to optimize the sub-population; an independent thread is applied for executing a genetic programming algorithm for each sub-population, and a symbol model set is searched for the training data set of each sub-population; when each sub-population meets a sending condition, the sub-population sends an elite individual set in the population at the moment to a message queue; and after the termination condition of the genetic programming algorithm is met, performing primary sorting by adopting the root-mean-square error indexes of the elite individuals in the elite group, and taking the elite individual with the minimum root-mean-square error as a final output symbol model.
Owner:NORTHWEST ELECTROMECHANICAL ENG RES INST

Distributed energy storage resource aggregator optimization scheduling method and system

PendingCN119109004AAchieving Utilization Efficiencyincrease flexibilityData processing applicationsBiological modelsGenetic programming algorithmOptimal scheduling
The invention discloses a distributed energy storage resource aggregator optimization scheduling method and system, and relates to the technical field of energy storage optimization, and the method comprises the steps: building a distributed energy storage resource aggregator model according to the characteristic parameters and charging and discharging characteristics of distributed energy storage in combination with the characteristics of a resource aggregator; establishing a multi-target distributed energy storage resource aggregator optimization scheduling model, and setting constraint conditions according to the characteristics of the resource aggregator; unit information, characteristic parameters of distributed energy storage and initial operation parameters of a distributed energy storage resource aggregator are obtained, and parameters of a multi-target genetic programming algorithm are initialized; and searching an optimal solution for the multi-target distributed energy storage resource aggregator optimal scheduling model by using a multi-target genetic programming algorithm, and performing distributed energy storage resource aggregator optimal scheduling. According to the method, the utilization efficiency of adjustable resources in a resource aggregator is improved, distributed resources can be utilized more efficiently, and the shortage of power duration auxiliary service resources is relieved.
Owner:NARI TECH CO LTD +1

Small sample image classification method based on hierarchical learning genetic programming algorithm

A small sample image classification method based on hierarchical learning genetic programming algorithm, comprising the steps of: 1: constructing a small sample image classification system based on hierarchical learning genetic programming algorithm; 2: the image acquisition module acquires the image data set and divides it into a training set and a test set; 3: the PEGP module acquires the training set and performs image preprocessing and feature extraction operations on it to construct a feature storage table; 4: the DEGP module takes the features in the feature storage table as the terminal input, constructs an integrated solution, and optimizes the final classification effect through an integrated strategy based on individual difference values; 5: use the test set as the input of the image classification solution, output the predicted class label of the test set, and evaluate the performance of the image classification solution according to the actual label of the test set; 6: take the image data to be classified as the input of the image classification solution and output the image classification result. Effect: good classification effect can be achieved under the condition of limited sample quantity.
Owner:GUANGXI UNIV

A method and system for calculating constitutive model of fiber concrete material

ActiveCN118657061BHigh precisionEasy to find and use laterDesign optimisation/simulationComputational materials scienceFiberGenetic programming algorithm
The present invention discloses a method and system for calculating a constitutive model of a fiber concrete material, and belongs to the field of calculating a constitutive model of a fiber concrete material. The method comprises obtaining a stress-strain curve of the fiber concrete in a tensile state and a stress-strain curve in a compressive state respectively; obtaining a tensile data set and a compressive data set respectively according to the stress-strain curve in the tensile state and the stress-strain curve in the compressive state; obtaining a constitutive equation in a tensile state and a constitutive equation in a compressive state according to the tensile data set and the compressive data set by using a genetic programming algorithm; obtaining a constitutive model according to the constitutive equation in a tensile state and the constitutive equation in a compressive state. The present invention solves the problems of low efficiency and insufficient precision of the existing method for calculating a constitutive model of a fiber concrete material.
Owner:SHENZHEN UNIV +1

Reservoir output sand content prediction method based on multi-tree genetic programming

PendingCN121765677AEnsemble learningClimate change adaptationAlgorithmGenetic programming algorithm
The invention provides a reservoir ex-reservoir sand content prediction method based on multi-tree genetic programming, and relates to the technical field of hydraulic engineering, and the method comprises the following steps: S1, data collection and preprocessing: collecting daily scale water and sand of a reservoir and geometric feature data of the reservoir, and carrying out the normalization processing; s2, constructing a multi-tree genetic programming model, wherein the model is composed of symbol trees; s3, an objective function is defined, the objective function is a linear weighting function, and decision coefficients and complexity are comprehensively considered; s4, performing model training and evolution, training a multi-tree genetic programming population through a genetic programming algorithm and a training set, and evaluating population fitness; s5, model verification and evaluation: verifying the trained model by using a verification set; s6, outputting a prediction result; according to the method, through combination of multi-tree genetic programming and a linear weighted objective function, the model can simultaneously ensure high prediction precision and high generalization ability, and through integration of multiple symbol trees, the nonlinear relationship of the reservoir water-sediment process can be accurately captured.
Owner:YELLOW RIVER INST OF HYDRAULIC RES YELLOW RIVER CONSERVANCY COMMISSION +4

A dynamic tugboat scheduling method using multi-population multi-objective genetic programming algorithm

ActiveCN120805427BData processing applicationsGenetic algorithmsAlgorithmGenetic programming algorithm
The application provides a dynamic tug scheduling method using a multi-population multi-objective genetic programming algorithm, and comprises the following steps: establishing a simulation environment, defining a target function to be solved, and defining total flow time and total cost of tug operation as two optimization objectives; solving the target function to be solved through the multi-population multi-objective genetic programming algorithm to obtain an optimal decision rule individual; and calling allocation rules and sequence rules of the selected decision rule individual to make a tug scheduling decision according to a ship arrival event and an operation preparation event. The application improves the flexibility of ship scheduling, thereby improving the port operation efficiency and reducing the operation cost.
Owner:SOUTH CHINA UNIV OF TECH

A dynamic flexible job-shop scheduling method based on multi-rule combination

ActiveCN118331185BProgramme total factory controlGenetic programming algorithmCombinatorial optimization
The application discloses a kind of dynamic flexible workshop scheduling methods based on multi-rule combination, the method is divided into two processes of scheduling rule generation and scheduling rule combination for scheduling problem, first by genetic programming algorithm, automatically generate scheduling rule for current working condition, and save the well performance scheduling rule therein;Then based on a kind of hybrid differential evolution algorithm, a plurality of good scheduling rules are combined and optimized, to achieve better scheduling effect.The application realizes the combination optimization based on multi-scheduling rule in the scene of industrial workshop scheduling, breaks the limitation that only state quantity without weight coefficient in the scheduling rule generated based on genetic programming in tradition, compared with single scheduling rule, the combined scheduling rule has stronger generalization and better scheduling effect.
Owner:ZHEJIANG UNIV +1

Computing power network task flow scheduling method and system based on constrained multi-objective three-tree genetic programming

The invention discloses a three-tree genetic programming method based on multiple constraint objectives, which is used for solving a task flow scheduling problem in a computing power network environment, and comprises the following steps: (1) building a distributed netlike computing power network environment model; (2) obtaining a task flow structure and a task data set; (3) respectively designing genetic programming terminals according to scheduling rules generated by three-tree genetic programming, and initializing a three-tree genetic programming population; (4) designing a simulator, simulating an execution process of the workflow based on a scheduling rule generated by three-tree genetic programming in a simulation environment, and evaluating load balance and task flow average completion time by taking a task flow success rate as a hard constraint; (5) designing a constraint multi-objective genetic programming algorithm to update the population; and (6) outputting a non-dominated genetic programming scheduling rule set after a preset number of iterations is reached. According to the method, task flow scheduling simulation of a computing power network environment is realized, and compared with a traditional method, the performance of constrained multi-objective optimization is improved.
Owner:SUZHOU UNIV

GP-based hierarchical unmanned cluster task planning method

ActiveCN120450658ABiological modelsAlgorithmGenetic programming algorithm
The invention discloses a hierarchical unmanned cluster task planning method and device based on GP, equipment and a medium. The method comprises the following steps: constructing a hierarchical task individual tree with structured semantics; taking a strong type genetic programming algorithm as a population evolution baseline, inputting the hierarchical task individual tree into the strong type genetic programming algorithm to generate an initial population, and evaluating the performance of each initial individual to obtain a fitness evaluation result; judging that a termination condition is not met according to a fitness evaluation result, performing selection, crossover and mutation operation on each individual by utilizing a strong type genetic programming algorithm, and cleaning redundant nodes in each individual by utilizing a pruning algorithm based on domain knowledge in the crossover and mutation operation process; and converting the optimal hierarchical task individual tree into a task planning scheme of the unmanned cluster collaborative system. The technical problems of unclear task structure expression ability, imperfect feasibility guarantee mechanism, low search efficiency and no self-adaptability in the existing unmanned cluster collaborative task planning method are solved.
Owner:XIDIAN UNIV

Two-stage batch flow flexible job shop dynamic scheduling method and device

The invention belongs to the related technical field of workshop scheduling, and discloses a two-stage batch flow flexible job workshop dynamic scheduling method and equipment, and the method comprises the steps: (1) extracting product processing technology features to construct a multi-dimensional batch feature set, carrying out the automatic selection and combination of batch features in the multi-dimensional batch feature set through employing a genetic programming algorithm, and carrying out the automatic selection and combination of the batch features in the multi-dimensional batch feature set; generating a plurality of batch scheduling rules through evolution operation, wherein the plurality of batch scheduling rules form an initial batch scheduling rule set; and (2) carrying out weight dynamic optimization on the initial batch scheduling rule set by adopting a deep reinforcement learning algorithm, and then determining a current optimal workpiece sorting and machine selection strategy so as to obtain a scheduling scheme. Through cooperative work of the genetic programming algorithm and the deep reinforcement learning algorithm, real-time response and adaptive scheduling of dynamic disturbance such as new workpiece arrival and machine faults in the production process are realized, the optimization efficiency is effectively improved, and the workshop production efficiency and the resource utilization rate are improved.
Owner:HUAZHONG UNIV OF SCI & TECH +1

An efficient method for constructing rolling bearing health indicators

ActiveCN116245022BMachine part testingGeometric CADGenetic programming algorithmRolling-element bearing
This invention discloses an efficient method for constructing health indicators for rolling bearings, comprising: sampling monitoring data of the entire life cycle of rolling bearings; extracting primary features of the entire life cycle of rolling bearings and using them as input to generate an initial chromosome population; optimizing the output of higher-level features of the chromosomes based on evaluation function one; obtaining a higher-level feature population by outputting higher-level features of the chromosomes; evaluating the higher-level feature population constructed by the current chromosome population based on evaluation function two; if a termination condition is met, proceeding to the next step; otherwise, performing genetic operations on the current population according to evaluation function two, repeating the above steps until the termination condition is met; after meeting the termination condition, outputting the chromosome with the highest fitness in the final generation population, and using its corresponding higher-level feature as a health indicator reflecting the degradation trend of rolling bearings. This invention can solve the problem that traditional genetic programming algorithms cannot efficiently search for health indicators that effectively characterize the degradation trend of rolling bearings.
Owner:JIANGSU UNIV OF SCI & TECH

A hierarchical unmanned cluster task planning method based on GP

ActiveCN120450658BBiological modelsAlgorithmGenetic programming algorithm
The application discloses a GP-based hierarchical unmanned cluster task planning method and device, equipment and medium, constructs a hierarchical task individual tree with structured semantics; the strong type genetic programming algorithm is used as a population evolution baseline, the hierarchical task individual tree is input into the strong type genetic programming algorithm to generate an initial population, the performance of each initial individual is evaluated, and an adaptability evaluation result is obtained; it is judged whether the termination condition is not met according to the adaptability evaluation result, each individual is selected, crossed and mutated by using the strong type genetic programming algorithm, redundant nodes in each individual are cleaned by using a pruning algorithm based on domain knowledge in the crossing and mutation operation process, and the optimal hierarchical task individual tree is converted into a task planning scheme of an unmanned cluster cooperative system. The application solves the technical problems of unclear task structure expression ability, imperfect feasibility guarantee mechanism, inefficient search and non-adaptability in the existing unmanned cluster cooperative task planning method.
Owner:XIDIAN UNIV

Insurance calling rule mining method and device, computer equipment and storage medium

PendingCN119444437AFinanceKnowledge based modelsGenetic programming algorithmOriginal data
The invention belongs to the field of artificial intelligence, and relates to an insurance calling rule mining method which comprises the following steps: acquiring original data and processing the original data; constructing an insurance policy fraud factor library by the processed data through a factor combination model; screening a plurality of insurance calling rules from the insurance policy fraud factor library based on genetic programming; and based on a stepwise regression method, obtaining an optimal scheduling rule combination from the multiple insurance scheduling rules. The invention further provides an insurance calling rule mining device, computer equipment and a storage medium. The genetic programming algorithm adopted by the invention can simply and automatically extract the effective calling rules, the useful calling rules can be extracted from a large amount of factor information, the rules are further combined step by step, and the generated optimal rule combination represents the optimal effect of combining all the rules, so that the efficiency of calling is improved. And the data is simplified and the calling effect is ensured as much as possible.
Owner:PING AN TECH (SHENZHEN) CO LTD

Program generation method, device, equipment and storage medium combining evolutionary computing and deep learning

ActiveCN119292581BArtificial lifeIntelligent editorsAlgorithmGenetic programming algorithm
The present application discloses a program generation method, device, equipment and storage medium combining evolutionary computing and deep learning, and relates to the field of computer technology. The method includes: constructing an initial population according to target input data, a deep learning model, and a genetic programming algorithm; performing crossover on multiple initial individuals in the initial population to obtain a population to be evolved; performing semantic mutation on the individuals to be mutated in the population to be evolved according to the target deep learning model, and constructing an iterative population until the iterative population meets the evolution termination condition; determining the target individual according to the fitness value of each iterative individual in the iterative population, thereby determining the target symbolic program. Through the above method, the powerful search capability of evolutionary computing and the generalization capability of large-scale pre-trained neural network models are combined. Under the coding task, the search efficiency is improved while the accuracy in the automatic programming task is guaranteed, and the symbolic program corresponding to the automatic coding task can be generated efficiently and accurately.
Owner:PENG CHENG LAB

Behavior tree-based self-adaptive source searching method

PendingCN120409177ADesign optimisation/simulationKnowledge based modelsAlgorithmGenetic programming algorithm
The invention discloses a self-adaptive source searching method based on a behavior tree, and the method comprises the steps: obtaining a source searching task which comprises any target substance that a source searching device wants to search; according to a predefined action priority level in the source searching task, a self-adaptive source searching behavior tree is constructed, the self-adaptive source searching behavior tree comprises a root node, a first node, a second node and a switching node, the source searching task is used as the root node of the self-adaptive source searching behavior tree, and the switching node is used as the switching node of the self-adaptive source searching behavior tree; a first node, a second node and a switching node are used as control nodes of an adaptive source searching behavior tree, the first node is used for guiding a decision-making behavior of a source searching device by using environment information, and the second node is used for searching a search space for the source searching device to obtain a new behavior of sensing information. The switching node is used for switching the first node and the second node so as to enable the source searching equipment to adaptively search a source; and adopting a genetic programming algorithm to synthesize and evolve the self-adaptive source searching behavior tree to obtain an optimal behavior tree individual for self-adaptive source searching.
Owner:NAT INNOVATION INST OF DEFENSE TECH PLA ACAD OF MILITARY SCI

Integrated genetic programming method for random resource constrained project scheduling

PendingCN120297114ADesign optimisation/simulationConstraint-based CADAlgorithmGenetic programming algorithm
The invention discloses an integrated genetic programming method for random resource-constrained project scheduling. The method specifically comprises the following steps: carrying out SRCPSP analysis on a random resource-constrained project scheduling problem and constructing a mathematical model; solving the SRCPSP on the basis of a non-fixed-length integrated genetic programming algorithm NEGP; in a PR generation stage, designing a PR updating mechanism based on complementarity; in a PR integration stage, a non-fixed-length coding structure is constructed to represent PR in a decision set, a genetic operator and a local search operator based on the non-fixed-length coding structure are designed, and the search capability of NEGP is improved. According to the production scheduling plan obtained by the method, multiple optimization objectives can be met while the SRCPSP is solved, the requirements of solving quality, solving efficiency, stability and the like are met at the same time, and the method has high practicability.
Owner:SOUTHWEST JIAOTONG UNIV

Pulling type multi-workshop cooperative scheduling optimization method for complex product final assembly

The invention discloses a pull-type multi-workshop cooperative scheduling optimization method for a complex product final assembly, and the method specifically comprises the steps: putting forward a pull-type multi-workshop cooperative scheduling problem of the complex product final assembly and constructing a mathematical model through considering the internal constraints of workshops and the coupling constraints between different workshops for a pull mode of the complex product final assembly; according to the integrated genetic programming algorithm based on multi-priority rule set collaboration, CPMCSP-FAP solving is achieved by generating a more effective multi-priority rule set; based on a complementarity priority rule set updating mechanism and a multi-workshop order decoding mechanism, the effectiveness of the algorithm is improved, and a complete multi-workshop scheduling scheme is obtained. According to the method, the actual demand of multi-workshop collaborative scheduling in the complex product production process is described more accurately, and a more comprehensive and accurate mathematical basis is provided for subsequent optimization solution; the stability and the scheduling quality of the algorithm can be remarkably improved while the solving efficiency is ensured.
Owner:SOUTHWEST JIAOTONG UNIV

Dynamic tug scheduling method adopting multi-population multi-target genetic programming algorithm

ActiveCN120805427AData processing applicationsDesign optimisation/simulationAlgorithmGenetic programming algorithm
The invention provides a dynamic tug scheduling method adopting a multi-population multi-objective genetic programming algorithm. The method comprises the following steps: establishing a simulation environment, defining a to-be-solved objective function, and defining total process time and total cost of tug operation as two optimization objectives; solving the target function to be solved through a multi-population multi-target genetic programming algorithm to obtain an optimal decision rule individual; and according to the ship arrival event and the operation preparation event, calling the distribution rule and the sequence rule of the decision rule individuals to carry out tug scheduling decision. According to the invention, the flexibility of ship scheduling is improved, so that the port operation efficiency is improved, and the operation cost is reduced.
Owner:SOUTH CHINA UNIV OF TECH

Composite rectification sequence optimization method, equipment and storage medium

The invention relates to the field of chemical rectification, and discloses a composite rectification sequence optimization method which comprises the following steps: acquiring an initial mixture to be rectified and a group of composite rectification sequences for rectifying the initial mixture; based on a genetic programming algorithm, converting the composite rectification sequence into an initial tree species group; performing iterative optimization on the initial tree species group on the basis of a tournament algorithm to obtain an optimized tree species group, and performing iterative optimization on nodes of the initial tree species group on the basis of an exhaustion method or an elite genetic algorithm to obtain a first optimal node; based on an exhaustion method or an elite genetic algorithm, iteratively optimizing nodes of the optimized tree species group to obtain a second optimal node; updating the composite rectification sequence into an optimized rectification sequence; and updating the initial rectification unit of the composite rectification sequence to the optimized rectification unit. According to the method provided by the embodiment of the invention, the rectification sequence optimization efficiency is improved, and the global optimality of the rectification unit is ensured.
Owner:CHINA PETROLEUM & CHEMICAL CORP +1

A Sorting Similarity Software Abnormal Behavior Modeling Method and a Computer Readable Medium

The present invention provides a method for modeling abnormal behaviors of sorting similarity software and a computer-readable medium. The method of the present invention enables the effectiveness of applying a multi-fault program dataset and multiple external index evaluation fault characterization functions to the fault separation process, calculates fitness scores for fault sorting characterization based on the evaluation results, and based on the fitness scores, evolves the population of fault characterization functions through crossover, replication, and mutation operations of the genetic programming algorithm until a termination condition is reached. The evolved individual of the fault sorting characterization with the highest fitness is used as a fault classification model for fault separation of real multi-fault programs. The present invention solves the problems that there is currently no available automated generation method for fault sorting characterization for fault separation and it is impossible to establish a mapping relationship from fault sorting characterization to the ability of failure test case characterization. Moreover, using the method of the present invention, efficient automated generation of fault sorting characterization can be achieved and used for fault separation work in actual production.
Owner:WUHAN UNIV