蚂蚁算法在TSP问题中的应用与研究-电路与系统专业毕业论文.docxVIP

蚂蚁算法在’fSP问题中的压用与研究Application 蚂蚁算法在’fSP问题中的压用与研究 Application and Research ofAnt Colony Algorithm in Travelling Salesman Problem circuit and system Postgraduate：Liao Xingxin Tutor：Wang Yong Abstract Combinatorial optimization problem is an important embranchment of operational research。The mathematical methods can be used to search optimization arrange，grouping，sequence or ridding of the discrete events． These problems belong to the Non—polynomial—complete(NPC)questions， which can’t be solved in polynomial time。With the enlargement of the scale of question．the question space makes the characteristic of exploding up，is unlikely solved with general methods。 As a NPC problem，Traveling Salesman Problem(TSP)is a classical combinatorial optimization question，which now can only be solved by meta-heuristics to get the approximate solution。 Sioce creating bionics in middle period of 1950’s，people are being inspired from the mechanism of the biological evolution constantly。 Many new methods had been applied to solve the complicated optimization problems are proposed。Such as neural network，genetic algorithm， simulated annealing，and evolution computation。These new methods had been successfu]ly applied to solve the practice problems。Ant colony nl 四JJ 四JJ 5赶学硕士学位论文 system(AS)WaS first proposed by Italy scholar M，Dorigo，V．Maniezzo， A．C()lorni in 1992 as a novel bi chic evolutionary atgorithm for solving comp]1cated combinator Jal optimi zation problems，like the TSP，the quadratic assignment problem(QAP)and job—shop problem，etc。At present， the research work about AS already arouse the attention from more scholars and expert gradually。Though，this research approach lies at primary stage，but some research results have already demonstrated the superiority of AS。 The major features of ACO i s Positive feedbacking and Parallel nature．The Positive feedbacking can make ACO quickly to find answers and the paral lel nature can make i t more Accurate．The parallel nature can exchange the