The Ant Colony Optimisation (ACO), Simulated Annealing (SA), and Iterated Local Search (ILS) algorithms are examples of the Operations Research methods used to explore the configuration space of an optimisation problem and arrive at a sub/optimal solution sufficiently quickly. These algorithms are provided in a collection of code titled, "ACO-ILS-SA" used to explore Travelling Salesperson Problem (TSP) like problem instances.
Please make sure you have read and understand our flexible licensing scheme before you download.
aco-ils-sa SVNsvn checkout svn://opensource.ihpc.a-star.edu.sg/aco-ils-sa/trunk aco-ils-sa
The methodology has been derived and extended from published work in the literature as indicate below:
Post a Comment
Could not execute select query.