The aim is to implement four different algorithms which can solve the Travelling Salesman problem. These are: 1) Genetic algorithm 2) An Ant Colony Optimisation 3) An algorithm which works randomly, with no fixed method of choosing points within a given graph. 4) An Approximation algorithm, which would find an approximate solution to a graph. This project will have to be very specific, I will provide details on request.
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Complete ownership and distribution copyrights to all work purchased.
The program is to be done in Java. Which should work on all platforms, but I use unix and windows xp.