Abstract

The paper provided some theoretical results about the convergence of ITO algorithm for combinatorial optimization problems. The transform probability of wave operator and move operator studied in detail. The almost sure convergence to the global optimum is obtained by transforming the search process of ITO algorithm to the discrete sub-martingale. Furthermore, the expected time of one particle in ITO algorithm is analyzed.

Paper Details