Survey on resource search technology in large-scale distributed network
大规模分布式资源搜索技术研究进展*

The optimization problem under uncertainty because of its closer to the real world environment, thus have become a growing reasearch area recently. This paper thoroughly reviewed ant colony optimization algorithms, and their applications to the class of stochastic combinatorial optimization problems under uncertainty conditions. Firstly, introduced the conceptual classification model for combinatorial problems under uncertainty conditions and a general definition for the stochastic combinatorial optimization problem. Then, pointed out the main difference between stochastic combinatorial optimization problem and deterministic combinatorial optimization problem, that was the computation of the objective function under uncertainty, and then summarized the current solutions for solvins this problem. Finally, proposed several possible research directions and the expectations of the development in this area.