Self-adaptive dual-harmony optimization method

Abstract

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.

Description

technical field [0001] The invention relates to an adaptive twin harmony optimization method, which can enhance the local search ability in the early stage and improve the search precision in the later stage. At the same time, through the cooperation of the two subharmonic sound banks, the search range is expanded, the combinatorial optimization problem can be better solved, the optimal value search ability is improved to a certain extent, and the number of iterations is reduced. Background technique [0002] The basic harmony search algorithm is a heuristic global search algorithm that came out recently, and has been successfully applied in many combinatorial optimization problems. In music performance, the musicians rely on their own memory to repeatedly adjust the pitch of each instrument in the band, and finally achieve a beautiful harmony state. Inspired by this phenomenon, Z.W.Geem etc. compared the instrument i (1, 2, ..., m) to the i-th design variable in the optimi...

AI Technical Summary

Problems solved by technology

The above methods all improve the HS algorithm, but when solving the complex function optimization problem, they fail to further expand the global search range and reduce the optimization of the solution.

Images