| 摘要 |
A quantum evolution method includes steps of: according to the quantum evolution method, initializing a generation number t=0, and initializing a population Q(t)={q1t, q2t, . . . , qnt}; observing Q(t) and generating P(t)={x 1t, x2t, . . . , xnt}, wherein represents strings comprising 0 or 1 with a length of m; evaluating each xit with an evaluation function, and inputting evaluating results into a fitness function F(t), F(t)={f1t, f2t. . . , fnt}, wherein fit represents a fitness of each individual; selecting an elite group E(t) from P(t) according to the fitness; evolving Q(t) through U(Δθijt); inputting an optimal solution b of P(t) into B(t), wherein if the optimal solution is better than an original optimal solution in B(t), then replacing the original optimal solution; otherwise remaining the original optimal solution; and judging a shutdown condition, if satisfied, outputting the optimal solution; otherwise returning to the step (2) for further evolution. The method can effectively control a quantum evolution direction and improve method stability. |
