Ant Colony OptimisationAnt Colony Optimization 1 A Seminar Report on Ant Colony Optimization A Seminar submitted in partial fulfilment of the requirements for the award of degree BACHELOR OF TECHNOLOGY In COMPUTER SCIENCE ENGINEERING Presented By Ranjith Kumar A (06J11A0534) Department of computer science engineering HITECH COLLEGE OF ENGG & TECHNOLOGY (Affiliated to Jawaharlal Nehru Technological University, Hyderabad) Himayathnagar, C.B.Post, Moinabad, Hyderabad-5000 2 075. CERTIFICATE This is to certify that the Seminar Report on Ant Colony Optimization, is a bonafide Seminar work done by Ranjith Kumar A (06J11A0534), in partial fulfillment for the award of the degree Bachelor of Technology in Computer Science engineering J.N.T.U Hyderabad during the year 2010. Y.V.S Pragathi M.Tech Head of CSE Department 3 Abstract Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build solutions step by step adding solution components that are represented by graph nodes. The existing ACO algorithms are suitable when the graph is not very large (thousands of nodes) but is not useful when the graph size can be a challenge for the computer memory and cannot be completely generated or stored in it. In this paper we study a new ACO model that overcomes the difficulties found when working with a huge construction graph. In addition to ...
To Order an Original Plagiarism Free Paper on the Same Topic Click Here
Other samples, services and questions:
When you use PaperHelp, you save one valuable — TIME
You can spend it for more important things than paper writing.
