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.

Downloads

aco-ils-sa SVN

*If you wish to participate in aco-ils-sa development, please contact the project maintainer.*

Description

The methodology has been derived and extended from published work in the literature as indicate below:

A hybridization using ILS was made to the ACO heuristic to refine the optimality of the solution. Both ILS and ACO are not new, but their hybridization may be new.The perturbation methods used in both SA and ILS are the -Optimality methods, 2-Opt. and 3-Opt. (these are not new), which swap two and three arcs respectively, whilst maintaining tour feasibility: the optimality of the associated solutions is then compared and the more optimal configuration chosen. Please refer to the user guide for detailed information.

Post a Comment

Posted Comments

Copyright © 2006 Institute of High Performance Computing. All rights reserved.