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.
37 results about "Harmony memory" 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
Multi-object optimized deployment method for industrial wireless sensor network
InactiveCN102098687AEasy to implementAchieve intuitiveNetwork topologiesNetwork planningHarmony memoryWireless sensor networking
The invention discloses a multi-object optimized deployment method for an industrial wireless sensor network, comprising the following steps: (1) dividing a monitoring region into three-dimensional grids, and arranging sensor nodes, cluster heads and base stations on cross points of the grids; (2) generating obstacle matrixes; (3) representing harmony individuals; (4) setting algorithm control parameters; (5) setting communication radiuses of the sensor and the cluster heads; (6) judging whether the communication between the sensor nodes and the cluster heads satisfies the conditions; (7) judging whether the hop number of communication between the sensor nodes and the base stations satisfies the conditions; (8) initializing harmony matrixes by using a heuristic strategy; (9) calculating an objective function value of each harmony; (10) finding out the optimized harmony; (11) generating a new harmony; (12) comparing the quality of the new harmony with the quality of the corresponding harmony in a harmony memory vault; (13) updating the optimized harmony; and (14) judging whether the stopping conditions are satisfied or not. The method can realize multi-object optimization for system reliability, and real-time performance, sensor node deployment cost and maintenance cost of the industrial wireless sensor network, and can satisfy the industrial actual requirements.
Owner:SHANGHAI UNIV
Resource allocation method with minimized cloud system cost based on expiration date drive
InactiveCN103853618AMeet the requirements of optimal resource allocationEfficient use ofResource allocationTransmissionHarmony memoryObject function
The invention discloses a resource allocation method with minimized cloud system cost based on expiration date drive. The resource allocation method comprises the following steps of collecting an available resource of each physical node in a cloud system by a cloud server; collecting a task request of a user; finally allocating a virtual resource in the cloud system by adopting a harmony search method, i.e. initializing parameters of the harmony search method by the cloud server, generating a new solution of the harmony search method by the cloud server, determining an objective function value of the new solution, updating a solution vector in a harmony memory library, determining a solution with minimized cost in the harmony memory library and a cloud system cost value corresponding to the explanation with the minimized cost, repeatedly iterating to maximum iteration times and outputting an optimal harmony solution vector. According to the resource allocation method disclosed by the invention, the available resources in the cloud system are fully excavated; the resources are dynamically allocated from CPU (Central Processing Unit) resources, magnetic disk read-write speed resources and network wideband resources in a plurality of dimensionalities by using a virtual machine diversification technology; the technical support is provided for efficiently utilizing the resources in the cloud system and guaranteeing that tasks are finished within expiration dates.
Owner:NANJING UNIV OF SCI & TECH
Charging station layout programming method based on V-graph and HS algorithm
InactiveCN106503845ALow construction and operation costsSolving planning problems with uneven distributionForecastingApparatus for hiring articlesHarmony memoryComputer science
The invention discloses a charging station layout programming method based on a V-graph and an HS algorithm. The method comprises the steps of firstly, estimating the range of charging stations which are constructed in a programming area through anticipation of charging queuing waiting time; secondly, comprehensively considering multiple factors such as a charging requirement and a region characteristic, establishing a charging station layout programming object according to a charging station construction / operation cost, a charging on-the-way time consumption cost and an arrival-at-station queuing waiting time cost; and finally, randomly generating station address coordinates of the charging stations in the programming area, coding the station address coordinate for obtaining one-directional vectors, defining the service range of each charging station by means of a Voronoi-graph (the V-graph in short) and generating an initial harmony vector, calculating a solution by means of a harmony search (HS) algorithm and storing the solution in a harmony memory (HM), updating the harmony memory through studying the harmony memory and tone fine turning until a number of updating times of the harmony memory is reached, finding out a charging station layout programming objective value and determining an optimal charging station layout programming solution. The charging station layout programming method has advantages of effective integration of multiple factors and high calculating speed. Furthermore the charging station layout programming method can be used for finding out an optimal value.
Owner:YANTAI POWER SUPPLY COMPANY OF STATE GRID SHANDONG ELECTRIC POWER +1
Method for solving non-linear programming and absolute value equation through improved harmony search algorithm
InactiveCN103631758AFast convergenceFew parametersComplex mathematical operationsHarmony memoryNumerical stability
The invention discloses a method for solving non-linear programming and an absolute value equation through an improved harmony search algorithm. The method for solving the non-linear programming includes the steps of defining a question and parameter values, initializing a harmony memory bank, generating a new harmony by learning the harmony memory bank, finely adjusting embedded tones which are normally distributed and selecting the tones at random, evaluating a new solution, and detecting whether an algorithm end condition is met or not. The method for solving the absolute value equation includes the steps of defining a question and parameter values, initializing a harmony memory bank, generating a new harmony by learning the harmony memory bank, finely adjusting tones and selecting the tones, setting a probability WSR, selecting a harmony to be updated by comparing a random number Rand with the WSR, a new solution is evaluated, and detecting whether an algorithm end condition is met or not. According to the method for solving the non-linear programming and the absolute value equation, the non-linear programming and the absolute value equation are solved through the improved algorithm, and numerical stability and arithmetic speed and accuracy are improved.
Owner:SHAANXI UNIV OF TECH
Optimizing power flows using harmony search with machine learning
Systems and methods for optimizing power flows using a harmony search, including decoupling phases in a multi-phase power generation system into individual phase agents in a multi-phase power flow model for separately controlling at least one of phase variables or parameters. One or more harmony segments from harmony memory are ranked and selected based on a utility value determined for each of the decoupled phases. A harmony search with gradient descent learning is performed to move the selected harmony segments to a better local neighborhood. A new utility value for each of the selected segments is determined based on historical performance, and the harmony memory is iteratively updated if one or more of the new utility values are higher than a utility value of a worst harmony segment stored in the harmony memory.
Owner:NEC CORP
Distributed logistics inventory optimization method based on cloud calculation environment
InactiveCN108280538ASolve the costRealize dynamic managementForecastingLogisticsHarmony memoryLogistics management
The invention discloses a distributed logistics inventory optimization method based on a cloud calculation environment. The method includes the steps of S1, building the algebraic model and constraintcondition function of an evaluation function f(U); S2, calculating the value of each component, and building the optimal equation matrix HM of harmony inventory; S3, using probability P(Xi) to replace harmony memory considering rate HMCR, and generating a new solution vector according to a harmony searching algorithm; S4, calculating the target function value f(Ub) of the new solution vector according to the evaluation function f(U), comparing the target function value f(Ub) of the new solution vector with the target function value f(Ub) of an original solution vector, and updating the inventory; S5, repeating the steps from S2 to S4, stopping until preset maximum iteration times are reached, and outputting optimal solution. By the method which is fast in response and optimization speed and high in multi-target optimization calculation efficiency, distributed logistics inventory pre-warning and cost optimization under the cloud calculation environment are achieved, and the dynamic management of the distributed logistics inventory is achieved.
Owner:GUANGXI TEACHERS EDUCATION UNIV
Self-adaptive dual-harmony optimization method
ActiveCN102789493AImprove dynamic adaptabilityImprove performanceSpecial data processing applicationsHarmony memoryFunction optimization
The invention relates to a self-adaptive dual-harmony optimization method which comprises the following steps of: initially optimizing a harmony memory base and putting a generated initial solution into the harmony memory base; then equally dividing the initial solution into two groups, i.e. a master harmony library and an auxiliary harmony library respectively and respectively determining the tone trimming probabilities and the tone trimming bandwidths of the master harmony library and the auxiliary harmony library; iteratively searching from the opposite direction under the situation that the algorithm convergence rules are not satisfied to obtain two groups of new solutions; and replacing a solution in the existing memory bank by using an optimal solution in the two groups of new solutions obtained by multiple iteration, thereby obtaining an optimal solution to finally achieve the wonderful harmony. The self-adaptive dual-harmony optimization method has the beneficial effects that tone trimming probability and tone trimming bandwidth factors are continuously adjusted to improve the dynamic adaptability of an algorithm and the coordination ability of local search and full search; two groups of master and auxiliary harmonies which are different in the search direction and are mutually coordinated are constructed, so that the search range is expanded, the iteration number is reduced, and the global optimization is more quickly realized; the problem of complicated function optimization is solved; and the full search ability and the convergence rate are good.
Owner:ANYANG NORMAL UNIV
Traffic image segmentation method based on improved multi-object harmony search algorithm
InactiveCN104881871AGood global search abilityGood local search capabilityImage enhancementImage analysisHarmony memoryImage segmentation
The invention discloses a traffic image segmentation method based on an improved multi-object harmony search algorithm, and mainly solves problems of a conventional traffic image segmentation technology that the evaluation index is single, the anti-noise performance is poor, the segmentation accuracy is not high, and the number of image segmentation types is required by be determined manually. The implementation steps mainly comprise reading a gray scale image and counting a gray scale histogram; initializing a harmony memory bank; generating a group of new explanations, wherein the size the new explanations is equal to the size the harmony memory bank; updating the harmony memory bank; determining whether a termination condition is met or not; selecting the optimal cluster center from the harmony memory bank according to a PBM evaluation index; and classifying pixels of the image according to the optimal cluster center to obtain a segmentation result. Compared with the conventional traffic image segmentation technology, the method provided by the invention is diversified in evaluation index, high in segmentation accuracy and high in anti-noise performance, can automatically determine the number of segmentation types of the image, and can be applied to the traffic image segmentation.
Owner:HUNAN UNIV +1
Improved complex power distribution network reactive power optimization method of harmony search algorithm
ActiveCN105932691ASolve the problem of low credibilityPracticalData processing applicationsReactive power adjustment/elimination/compensationHarmony memoryData warehouse
The invention provides an improved complex power distribution network reactive power optimization method of a harmony search algorithm, and the method comprises steps of: building a power distribution network reactive power optimization model; building a harmony memory data warehouse; initializing harmony vectors; calculating a fitness function value of each harmony vector; updating the harmony memory data warehouse; and performing hierarchical clustering for the harmony memory data warehouse, thereby obtaining various clusters. The technical scheme provided by the invention gathers all scenes appeared in historical calculation to build the harmony memory data warehouse, uses a hierarchical clustering thought to guide updating of the harmony vectors and improve availability of calculation, and can realize an effect of reducing total calculation and improving optimization ability.
Owner:CHINA ELECTRIC POWER RES INST +2
Hybrid intelligent scheduling optimization method of manufacturing enterprise workshop
The invention discloses a hybrid intelligent scheduling optimization method of a manufacturing enterprise workshop. The method comprises the following steps of: initializing related parameters of an HS algorithm and an SA algorithm; according to different production tasks, inputting processing information relating to each task; using a coding mode based on working procedures to code questions, and then utilizing a random generation mode to generate harmony memory HM initial solutions; utilizing the SA algorithm to carry out neighborhood transformation on all the initial solutions, if the solutions after the transformation are better than the initial solutions, then receiving the solutions after the transformation; and if not, then receiving the solutions after the transformation with a probability which successively decreases with a temperature in the SA algorithm; utilizing three kinds of mechanism, such as harmony memory learning, variable fine tuning and new tone random generation, to generate new solutions; utilizing the SA algorithm to carry out neighborhood transformation on the new solutions and to determine whether to receive the new solutions; establishing a target optimization function, and updating the HM according to an optimization result; and if a maximum iteration number is reached, outputting an optimal harmony solution, and drawing a scheduling Gantt chart of the system. The hybrid intelligent scheduling optimization method has the advantages that the hardware requirements are low, and the optimal solution can be found easily.
Owner:NANJING UNIV OF SCI & TECH
Dynamic frequency spectrum distribution method of cognitive heterogeneous network
ActiveCN104168569AImprove adaptabilitySolving the optimization problem of discrete multi-constrained spectrum allocation parametersNetwork planningHarmony memoryDistribution matrix
The invention relates to a dynamic frequency spectrum distribution method of a cognitive heterogeneous network. A probability HMCR carrying out selection from a quantum harmony set is set and a quantum-harmony-based dynamic frequency spectrum method is initialized; a quantum tone of each quantum harmony is measured to obtain a harmony base x and a harmony memory base H, and fitness calculation is carried out on each harmony and the corresponding fitness values are respectively stored in a Fit and a Fit 1; if rand is less than HMCR, the quantum tone of the last-generation quantum harmony is inherited and a quantum rotating gate is started to generate a new solution; if the rand is larger than the HMCR, a tent pseudo chaos sequence is generated randomly to generate a new quantum harmony; the quantum tone of each quantum harmony is measured successively to obtain a corresponding harmony, and fitness calculation is carried out to replace the corresponding fitness value in the Fit 1; and a global optimum harmony in the harmony memory base H is outputted in a loop iteration mode and global optimum harmony mapping is carried out to obtain a frequency spectrum distribution matrix A that is the optimum frequency spectrum distribution scheme of the cognitive heterogeneous network.
Owner:HARBIN ENG UNIV
Wireless sensor network routing method based on improved harmony search algorithm
ActiveCN103916927AImprove energy efficiencyExtend the life cycleHigh level techniquesWireless communicationHarmony memoryNeighborhood search
The invention provides a wireless sensor network routing method based on the improved harmony search algorithm. The method comprises the following steps: 1, initializing relevant parameters HMS, HMCR and PAR of the algorithm and the evaluation time eval-Nomax; 2, utilizing a roulette to initialize a harmony memory bank HM; 3, evaluating the fitness of harmony paths in the harmony bank; 4, setting eval-No to be equal to 0; 5, setting i to be equal to 0; 6, generating candidate harmony; 7, setting eval-No to be ++, and executing the step 8 if eval-No is smaller than eval-Nomax, or else executing the step 11; 8, carrying out neighborhood search on the ith harmony Xi equal to (s, x2, ...xj, ..., d); 9, setting eval-No to be ++, and executing the step 10 if eval-No is smaller than eval-Nomax, or else executing the step 11; 10, setting i to be ++, executing the step 6 if i is smaller than HMS, or else executing the step 5; 11, recording the optimum harmony path in the harmony memory bank. The routing method has high energy efficiency and can effectively prolong the life cycle of the whole network.
Owner:HUAZHONG UNIV OF SCI & TECH
Defense penetration path planning method of underwater vehicle based on harmony search algorithm
InactiveCN104197941AImprove convergence accuracyFast convergenceNavigational calculation instrumentsHarmony memoryPlanning approach
The invention discloses a defense penetration path planning method of an underwater vehicle based on a harmony search algorithm. The method mainly comprises the following steps: (1) initializing parameters, and carrying out discretization on a space; (2) initializing a harmony memory bank; (3) generating a new path; (4) updating the harmony memory bank; (5) judging whether end conditions are met or not, if yes, ending, and outputting the optimal path, if not, returning to the step (3) to continue. According to the invention, collaborative evolutionary ideas are introduced into the harmony search (HS) algorithm, and then a collaborative harmony search (CHS) algorithm is put forward. Through a test of standard test functions, compared with the original algorithm, the CHS algorithm is greatly improved in convergence accuracy and convergence speed, furthermore, compared with simple genetic algorithm (SGA) and particle swarm optimizers (PSO) algorithm, the CHS algorithm can avoid the premature convergence problem to a great extent.
Owner:南京恒誉名翔科技有限公司
Cuckoo harmony search mechanism-based IIR (infinite impulse response) digital filter generating method
ActiveCN106447026AEfficient designExpand your searchDigital technique networkArtificial lifeHarmony memoryRate of convergence
The present invention provides a cuckoo harmony search mechanism-based IIR (infinite impulse response) digital filter generating method. Initialization is carried out, the fitness value of each cuckoo harmony in a cuckoo harmony memory bank is calculated, and the situational knowledge and normative knowledge of a belief space are initialized; a cuckoo harmony tone is randomly selected from the cuckoo harmony memory bank, if rand1 is smaller than PAR, fine adjustment is performed on the cuckoo harmony tone; if rand1 is larger than PAR, the cuckoo harmony tone is updated; the fitness value of the new cuckoo harmony in the cuckoo harmony memory bank is larger than the largest fitness value of the cuckoo harmonies in the cuckoo harmony memory bank, the new cuckoo harmony is replaced; the cuckoo harmonies in the cuckoo harmony memory bank are changed randomly, the fitness values of the cuckoo harmonies in the cuckoo harmony memory bank are calculated, a cuckoo harmony with a small fitness value is selected, and the situational knowledge and normative knowledge of the belief space are updated; and an optimal cuckoo harmony in the situational knowledge, namely, the parameter of an IIR (infinite impulse response) digital filter, is outputted cyclically and iteratively. The method has the advantages of fast convergence speed and good performance.
Owner:HARBIN ENG UNIV
Robot structure error compensation method and device
ActiveCN108858200AStructural Error CompensationHigh precisionProgramme-controlled manipulatorHarmony memoryAlgorithm
An embodiment of the invention provides a robot structure error compensation method and device which are applied to a robot comprising at least one joint. The method includes the steps: taking a builtinitial harmony memory as a current harmony memory and initializing HMCR (harmony memory considering rate), PAR (pitch adjusting rate) and BW (bandwidth); selecting a first target harmony from a preset / current harmony memory according to the relationship between a first random number and the HMCR; processing the first target harmony based on the BW according to the relationship between a second random number and the PAR; updating the current harmony memory according to the relationship among target function values of the processed harmony and harmonies of the current harmony memory; updatingthe PAR and the BW according to preset rules and returning to select the first target harmony if the updated harmony memory cannot meet preset conditions; replacing original joint variable values of joints by candidate joint variable values of the joints corresponding to the harmony with the minimum target function value in the updated harmony memory. When the robot is in any structures, structureerrors of the robot can be compensated.
Owner:遨博(北京)智能科技股份有限公司
Short-time overhaul plan optimization method and apparatus for power distribution network
ActiveCN107808200AImprove power supply reliabilityReduce maintenance costsForecastingResourcesHarmony memoryAlgorithm
The invention relates to a short-time overhaul plan optimization method and apparatus for a power distribution network. According to an upper layer optimization model, upper layer optimization constraint conditions, the size of a harmony memory library, a to-be-detected equipment number and a predicted fluctuation curve, a feasible solution with the same size as the harmony memory library and a first fitness value corresponding to the feasible solution are obtained; according to harmony algorithm rules and harmony algorithm parameters, a new solution is obtained; according to the new solution,lower layer optimization constraint conditions and the to-be-detected equipment number, lower layer optimization is performed, and a lower layer optimization scheme is output; according to the upperlayer optimization model, the lower layer optimization scheme, the new solution, the to-be-detected equipment number and the predicted fluctuation curve, a second fitness value is obtained; accordingto the second fitness value and the first fitness value corresponding to a worst solution of the harmony memory library, the harmony memory library is updated; an updating frequency is iterated to obtain an iterative frequency; and when the iterative frequency reaches a maximum iterative frequency, the updated harmony memory library is output. The power supply reliability of the power distributionnetwork is improved.
Owner:ELECTRIC POWER RESEARCH INSTITUTE, CHINA SOUTHERN POWER GRID CO LTD
Harmony search algorithm for solving mixed loading of various large-batch cold-chain articles
ActiveCN110503248AImprove decision support capabilitiesIncrease profitabilityForecastingLogisticsCold chainRefrigerator car
The invention provides a harmony search algorithm for solving mixed loading of various large-batch cold-chain articles. The method comprises the following steps: firstly, acquiring various parametersof to-be-conveyed cold-chain articles and a used single-temperature-zone refrigerator car, establishing a mixed loading model when different cold-chain articles are assembled to the single-temperature-zone refrigerator car, then establishing an initial harmony memory bank, obtaining an initial solution by adopting a random search algorithm, and repairing the solution through a repairing operator until a required number of solution vectors are obtained; secondly, calculating a new solution according to the parameters and harmony search rules and repaired, and finally obtaining a cold-chain article mixed loading scheme meeting the conditions. Under the condition that the temperature constraint, the volume constraint and the weight constraint of the single-temperature-zone refrigerator car are met, a harmony search algorithm is adopted for automatic calculation, and an assembling scheme with the minimum humidity difference, the minimum shelf life difference and the minimum mixed loading type difference as targets is generated.
Owner:中交信息技术国家工程实验室有限公司
Maximum power point tracking method under local shadow condition
ActiveCN113419593AIncrease profitStrong global search capabilityPhotovoltaic energy generationElectric variable regulationHarmony memoryPhotovoltaic arrays
The invention relates to a maximum power point tracking method under a local shadow condition, which comprises the following steps of: 1) constructing a photovoltaic cell model, a booster circuit model and a controller model based on a harmony search algorithm by combining current-voltage characteristics of a photovoltaic array under the local shadow; 2) initializing parameters of a self-adaptive harmony search algorithm, initializing a harmony memory bank, taking an optimized initial voltage value as harmony, generating a new harmony vector, and further obtaining an updated voltage; 3) updating the harmony vector in the harmony memory bank; and 4) judging whether an algorithm termination standard is reached or not, if so, outputting the optimal voltage and tracking the global maximum power point, otherwise, continuing to generate a new harmony vector and updating the harmony memory bank until the algorithm termination standard is reached. Compared with the prior art, the method has the advantages of improving the tracking speed and precision, improving the solar energy utilization rate and the like.
Owner:SHANGHAI DIANJI UNIV
Optimization method and device for distribution network short-term maintenance plan
ActiveCN107808200BImprove power supply reliabilityReduce maintenance costsForecastingResourcesHarmony memoryAlgorithm
The invention relates to a short-time overhaul plan optimization method and apparatus for a power distribution network. According to an upper layer optimization model, upper layer optimization constraint conditions, the size of a harmony memory library, a to-be-detected equipment number and a predicted fluctuation curve, a feasible solution with the same size as the harmony memory library and a first fitness value corresponding to the feasible solution are obtained; according to harmony algorithm rules and harmony algorithm parameters, a new solution is obtained; according to the new solution,lower layer optimization constraint conditions and the to-be-detected equipment number, lower layer optimization is performed, and a lower layer optimization scheme is output; according to the upperlayer optimization model, the lower layer optimization scheme, the new solution, the to-be-detected equipment number and the predicted fluctuation curve, a second fitness value is obtained; accordingto the second fitness value and the first fitness value corresponding to a worst solution of the harmony memory library, the harmony memory library is updated; an updating frequency is iterated to obtain an iterative frequency; and when the iterative frequency reaches a maximum iterative frequency, the updated harmony memory library is output. The power supply reliability of the power distributionnetwork is improved.
Owner:ELECTRIC POWER RESEARCH INSTITUTE, CHINA SOUTHERN POWER GRID CO LTD
Compensation method and device for robot structure error
ActiveCN108858200BStructural Error CompensationHigh precisionProgramme-controlled manipulatorHarmony memoryAlgorithm
An embodiment of the invention provides a robot structure error compensation method and device which are applied to a robot comprising at least one joint. The method includes the steps: taking a builtinitial harmony memory as a current harmony memory and initializing HMCR (harmony memory considering rate), PAR (pitch adjusting rate) and BW (bandwidth); selecting a first target harmony from a preset / current harmony memory according to the relationship between a first random number and the HMCR; processing the first target harmony based on the BW according to the relationship between a second random number and the PAR; updating the current harmony memory according to the relationship among target function values of the processed harmony and harmonies of the current harmony memory; updatingthe PAR and the BW according to preset rules and returning to select the first target harmony if the updated harmony memory cannot meet preset conditions; replacing original joint variable values of joints by candidate joint variable values of the joints corresponding to the harmony with the minimum target function value in the updated harmony memory. When the robot is in any structures, structureerrors of the robot can be compensated.
Owner:AUBO BEIJING ROBOTICS TECH CO LTD
An Improved Harmony Search Algorithm for Reactive Power Optimization of Complex Distribution Networks
ActiveCN105932691BSolve the problem of low credibilityPracticalData processing applicationsReactive power adjustment/elimination/compensationHarmony memoryData warehouse
The invention provides an improved reactive power optimization method of a complex distribution network based on an improved harmony search algorithm. The method includes: establishing a reactive power optimization model of a distribution network; establishing a harmony memory data warehouse; initializing a harmony vector; calculating each The fitness function value of the harmony vector; update the harmony memory data warehouse; perform hierarchical clustering on the harmony memory data warehouse to obtain each cluster. The technical solution provided by the invention integrates all the scenes that appear in the historical calculation to construct the harmony memory data warehouse, and uses the hierarchical clustering thought to guide and update the acoustic vector to increase the utilization of calculation, reduce the total amount of calculation and improve the optimization ability effect.
Owner:CHINA ELECTRIC POWER RES INST +2
A Signal Adaptive Control Method for Single Intersection
ActiveCN108898853BImprove search accuracyFast convergenceControlling traffic signalsArrangements for variable traffic instructionsHarmony memoryGreen-light
The invention discloses a control method of single intersection signal adaptation. A single intersection signal adaptation control model based on smallest delay time is firstly established, and then improved harmony searching algorithm solving is put forward. The control method comprises specific steps of (1) establishing single intersection signal adaptation control model; (2) initializing algorithm parameters; (3) generating a new timing scheme; (4) using the improved harmony searching algorithm to dynamically update the harmony memory library probability, the fine tuning disturbance rate and adjustment step length; (5) updating a harmony memory library; (7) judging whether the biggest iteration times is met; and (7) obtaining the optimal harmony to serve as a green light timing scheme corresponding to the intersection. According to the invention, a single intersection adaptive timing scheme can be effectively solved; and the method is suitable for an optimization problem of the single intersection signal adaptation.
Owner:GUANGDONG UNIV OF TECH
Single-machine production scheduling method and system with deteriorating maintenance duration
ActiveCN110209133BTotal factory controlProgramme total factory controlMemory retentionHarmony memory
Owner:HEFEI UNIV OF TECH
A method of iir digital filter generation based on cuckoo harmony search mechanism
ActiveCN106447026BEfficient designExpand your searchDigital technique networkArtificial lifeHarmony memoryAlgorithm
The present invention provides a cuckoo harmony search mechanism-based IIR (infinite impulse response) digital filter generating method. Initialization is carried out, the fitness value of each cuckoo harmony in a cuckoo harmony memory bank is calculated, and the situational knowledge and normative knowledge of a belief space are initialized; a cuckoo harmony tone is randomly selected from the cuckoo harmony memory bank, if rand1 is smaller than PAR, fine adjustment is performed on the cuckoo harmony tone; if rand1 is larger than PAR, the cuckoo harmony tone is updated; the fitness value of the new cuckoo harmony in the cuckoo harmony memory bank is larger than the largest fitness value of the cuckoo harmonies in the cuckoo harmony memory bank, the new cuckoo harmony is replaced; the cuckoo harmonies in the cuckoo harmony memory bank are changed randomly, the fitness values of the cuckoo harmonies in the cuckoo harmony memory bank are calculated, a cuckoo harmony with a small fitness value is selected, and the situational knowledge and normative knowledge of the belief space are updated; and an optimal cuckoo harmony in the situational knowledge, namely, the parameter of an IIR (infinite impulse response) digital filter, is outputted cyclically and iteratively. The method has the advantages of fast convergence speed and good performance.
Owner:HARBIN ENG UNIV
A cost-minimizing resource allocation method for cloud systems based on deadlines
InactiveCN103853618BMeet the requirements of optimal resource allocationEfficient use ofResource allocationTransmissionHarmony memoryCloud systems
Owner:NANJING UNIV OF SCI & TECH
Image omics feature selection method based on momentum adaptive harmony search
PendingCN114494163AAchieve adaptiveImprove robustnessImage enhancementImage analysisHarmony memoryAlgorithm
The invention discloses a radiomics feature selection method based on momentum adaptive harmony search, and belongs to the technical field of radiomics. The method comprises the following steps of: 1, checking a region of interest (ROI) of the medical image; 2, adrenal tumor CT image data containing the ROI are read; 3, extracting original image features from the read image data; 4, defining an objective function of the method for minimizing the problem; 5, initializing a harmony memory bank; 6, initializing the maximum number of iterations, the HMCR and the PAR; 7, generating a new solution j; 8, updating the harmony memory bank; and 9, repeating the steps 7-8, and outputting an optimal feature subset. According to the method, the HMCR and the PAR are dynamically adjusted, so that sinking into a local optimal solution is avoided, and the robustness of the algorithm is enhanced; the concept of momentum gradient descent is fused, and convergence is accelerated; the fitness function is adjusted, and the essence of the feature search optimization problem is better conformed.
Owner:ZHEJIANG UNIV OF TECH
Self-adaptive dual-harmony optimization method
ActiveCN102789493BImprove dynamic adaptabilityImprove performanceSpecial data processing applicationsHarmony memoryFunction optimization
The invention relates to a self-adaptive dual-harmony optimization method which comprises the following steps of: initially optimizing a harmony memory base and putting a generated initial solution into the harmony memory base; then equally dividing the initial solution into two groups, i.e. a master harmony library and an auxiliary harmony library respectively and respectively determining the tone trimming probabilities and the tone trimming bandwidths of the master harmony library and the auxiliary harmony library; iteratively searching from the opposite direction under the situation that the algorithm convergence rules are not satisfied to obtain two groups of new solutions; and replacing a solution in the existing memory bank by using an optimal solution in the two groups of new solutions obtained by multiple iteration, thereby obtaining an optimal solution to finally achieve the wonderful harmony. The self-adaptive dual-harmony optimization method has the beneficial effects that tone trimming probability and tone trimming bandwidth factors are continuously adjusted to improve the dynamic adaptability of an algorithm and the coordination ability of local search and full search; two groups of master and auxiliary harmonies which are different in the search direction and are mutually coordinated are constructed, so that the search range is expanded, the iteration number is reduced, and the global optimization is more quickly realized; the problem of complicated function optimization is solved; and the full search ability and the convergence rate are good.
Owner:ANYANG NORMAL UNIV
Dynamic scheduling method and system of orbital automatic guided vehicles based on harmony search
The invention provides a dynamic scheduling method and system of orbital automatic guided vehicles based on harmony search. The method comprises the steps of: setting initial state parameters, variousprocessing parameters and optimization parameters of various numerically-controlled machine tools; encoding the serial numbers of the numerically-controlled machine tools served by an RGV trolley forN times in the future as a harmony vector with a length N, constructing a plurality of harmony vectors according to a specified harmony vector length and an encoding scheme to form an initial harmonymemory vault, and calculating a fitness value of each harmony vector in the harmony memory vault; randomly taking values within a variable value taking range to form a new harmony, or selecting the harmony in HM and performing disturbance and fine tuning to calculate a new harmony, and calculating the fitness value of the new harmony; updating the harmony memory vault according to the fitness value of the new harmony; and judging whether the current number of iterations reaches the maximum number of iterations, and if so, selecting a harmony with the best quality from the harmony memory vaultfor decoding, and the using the decoding result as the process in which the RGV trolley sequentially provide services for the corresponding numerically-controlled machine tools according to the sequence of the serial numbers of the numerically-controlled machine tools in the harmony vector, or otherwise, returning to the step of forming the new harmony.
Owner:SHANDONG NORMAL UNIV
Energy efficient routing method based on harmony search
InactiveCN110798874AAvoid energy holesExtend the life cycleHigh level techniquesWireless communicationHarmony memoryPathPing
The invention relates to an energy efficient routing method based on harmony search, which comprises the following steps of: searching N paths which can be directly reached between a source node and adestination node; starting from a source node, generating a random number P1 between 0 and 1 randomly; if the random number P1 is smaller than the memory bank value probability HCMR, selecting a nexthop node corresponding to Ns from the generated HMS when the next hop node is selected, and after selection is completed, determining the position of the next hop node through a roulette method; calculating an objective function for measuring the energy consumption condition of the generation path in the whole network; and comparing the target function value of the newly generated path with theminimum target function value in the harmony memory bank, and if the generated new solution is smaller than the optimal solution in the harmony memory bank, updating the newly generated path to the harmony memory bank HM.
Owner:TIANJIN UNIV
Virtual machine placement method and device based on harmony search, equipment and storage medium
ActiveCN111443989AImprove efficiencyGood effectDigital data processing detailsEnergy efficient computingHarmony memoryMemory bank
The invention belongs to the technical field of cloud computing, and discloses a virtual machine placement method and device based on harmony search, equipment and a storage medium. The method comprises the following steps: acquiring a virtual machine set and a physical host set to be placed, and establishing a harmony memory bank according to the virtual machine set and the physical host set; generating a new harmony according to a preset harmony generation condition; performing fitness calculation on various harmonics and new harmonics in the harmonics memory bank, and updating the harmonicsin the harmonics memory bank according to a calculation result; determining a target harmony with the maximum fitness value according to the updating result, and taking tone information of the targetharmony as an optimal solution for virtual machine placement; and placing the virtual machines in the virtual machine set into physical hosts corresponding to the physical host set according to the virtual machine placement optimal solution. Under the condition that the resource utilization rate and the energy consumption of the physical host are constrained, low-energy-consumption optimization of virtual machine placement is formed by generating a new harmony, namely a new placement scheme.
Owner:WUHAN POLYTECHNIC UNIVERSITY
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