[1]Holland J H.Outline for A Logical Theory of Adaptive Systems[J].Journal of the Association for Computing Machinery,1962,9(3):297-314.
[2]Dorigom,Stutzle T.Ant Colony Optmization[M].
张军,胡晓敏,罗旭耀,等,译.北京:清华大学出版社,2006.
[3]Stutzle T,Hhoos H.The MAX-MIN Ant System and Local Search for the Traveling Salesman Problem[C].Indianapolis,USA:Proceedings of the IEEE Inernational Conference on Evolutionary Computation(ICEC97),1997:309-314.
[4]高尚,杨静宇.群智能算法及其应用[M].北京:中国水利水电出版社,2006.
[5]Dorigom,Blum C.Ant Colony Optimization Theory:Asurvey[J].Theoretical Computer Science,2005,344:243-278.
[6]Acan A.GAACO:AGA+ACO Hybrid for Faster and Better Search Capability[C].Brussels Proceeding of the 3rd International Workshop on ant Algorithms/ANTS2002,2002:300-301.
[7]丁建立,陈增强,袁著祉.遗传算法与蚂蚁算法的融合[J].计算机研究与发展,2003,40(9):1351-
1356.
[8]Zhang Xiong,Li S K,Chen J H.Hardware/Software Partitioning Based on Dynamic Combination of Gentic Algorithm and Ant Algorithm[J].Journal of Software,2005,16(4):503-512.
[9]Van Rijsbergen C J.Information Retrieval[M].2nd edition.London:Butterworths,1979.
[10]段海滨.蚁群算法的原理及其应用[M].北京:科学出版社,2005.
[11]Whitley D.Scheduling Problems and Traveling Salesmen:the Genetic Edge Recombination Operator[C].Morgan Kaufnmannn:Proceeding of 3th International Conference on Genetic Algorithms,1989:133-140.
[12]Davis L.Adapting Operator Probabilities Genetic Algorithms[C].Morgan Kaufmann:Proceedings of 3th International Conference on Genetic Algorithms,1989:61-69.
[13]Oliver L M.A Study of Permutation Crossover Operators on the Traveling Salesman Problem[C].Proceeding of 2th International Conference on Genetic Algorithms,1987:224-230.
[14]田贵超,黎明.旅行商问题(TSP)的几种求解方法[J].计算机仿真,2006(8):153-157. |