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.