DORIGO M,COLOMI A,MANIEZZO V.Distributed optimization by ant colonies[C]∥Proc of the First European Conf ofArtificial Life.Paris:Elsevier,1991:134-142.
[2]
DORIGO M,MANIEZZO V,COLOMI A.The ant system:optimization by a colony of cooperating agents[J].IEEETransactions on Systems,Man,and Cybernetics,Part B,1996(1):29-41.
[3]
DORIGO M,GAMBARDELLA L M.Ant colony system:a cooperative learning approach to the travelling salesman problem[J].IEEE Transactions on Evolutionary Computation,1997,1(1):53-66.
[4]
BLUM C,DORIGO M.The hyper-cube framework for ant colony optimization[J].IEEE Trans Systems,Man,andCybernetics,2004,34(2):1161-1172.
[5]
REIMANN M.Guiding ACO by problem relaxtion:a case study on the symmetric TSP[J].Lecture Notes in ComputerScience,2007,4771:45-55.
[6]
朱庆保,杨志军.基于变异和动态信息素更新的蚁群优化算法[J].软件学报,2004,15(2):185-192.ZHU Qing-bao,YANG Zhi-jun.An ant optimization algorithm based on mutation and dynamic pheromone updating[J].Journal of Software,2004,15(2):185-192.(in Chinese)
[7]
冀俊忠,黄振,刘椿年.一种快速求解旅行商问题的蚁群算法[J].计算机研究与发展,2009,46(6):968-978.JI Jun-zhong,HUANG Zhen,LIU Chun-nian.A fast ant colony optimization algorithm for traveling salesman problems[J].Journal of Computer Research and Development,2009,46(6):968-978.(in Chinese)
[8]
STUZLE T,HOOS H.MAX-MIN ant system and local search for the traveling salesman problem[C]∥IEEE Intl Conf onEvolutionary Computation.Indianapolis:IEEE Press,1997:309-314.
[9]
JONES T,FORRESTS.Fitness distance correlation as a measure of problem difficulty for genetic algorithm[C]∥Proceedingof the 6th International Conference on Genetic Algorithm.San Mateo,CA:Morgan Kaufmann,1995:184-192.
[10]
王东,吴湘滨,毛先成,等.旅行商问题优化解之间关系的分析[J].小型微型计算机系统,2008,29(5):879-884.WANG Dong,WUXiang-bin,MAO Xian-cheng,et al.Relationship analysis between optimal solutions of TSP[J].Journalof China Computer Systems,2008,29(5):879-884.(in Chinese)
