Chryssis Georgioua, Kowalskib Dariusz R, Shvartsmanc Alexander A. Efficient gossip and robust distributed computation[J]. Theoretical Computer Science, 2005, 34(4): 130-166.
[2]
Liu Yu-Hsin. Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem[J]. European Journal of Operational Research, 2008, 191(2): 332-346.
[3]
Amilkar Puris, Rafael Bello, Yailen Martínez, et al. Two-stage ant colony optimization for solving the traveling salesman problem[J]. Nature Inspired Problem-Solving Methods in Knowledge Engineering, 2007, 28(4): 307-316.
[4]
Hani Y, Amodeoa L, Yalaouia F, et al. Ant colony optimization for solving an industrial layout problem[J]. European Journal of Operational Research, 2007, 18(5): 633-642.
[5]
Heinonen J, Petterssona F. Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem[J]. Applied Mathematics and Computation, 2007, 187(2): 989-998.
[6]
骆正虎. 移动Agent系统若干关键技术问题研究. 合肥: 合肥工业大学, 2002. Luo Zhenghu. Research on key issues of mobile agent system. Hefei: Hefei University of Technology, 2002.
[7]
Moizumi K. The mobile agent planning problem. Hanover: Thayer School of Engineering, Darmouth College, 1998.
[8]
Dorigo M, Di Caro G. Ant colony optimization: a new meta-heuristie//Proceedings of the Evolutionary Computation. Washington DC: , 1999: 1470-1477.
