In order to overcome the shortcoming of the efficiency of the Ito algorithm for the discrete combinatorial optimization problems

an improved Ito algorithm based on collaborative diffusion coefficient and Hill climbing was proposed in this paper.To be consistent with the principle of Brownian motion

the drift and wave should be moved simultaneously

when it found a feasible solution

which continued to be a degree of renewed volatility.Experimental results show that the improved Ito algorithm for solving vehicle routing problem with a soft time window is valid

with the convergence speed

robustness and stability

especially Ito algorithm combines the ability of local search algorithms after climbing method performance has been greatly improved.Finally

according the nature of Markov chain to move to its attractive element and the transformation of the relationship between each state

the Markov chain approximation simulation algorithm which structures the Ito stochastic differential equation and its convergence was proved in this paper.