511 research outputs found
Applying ACO To Large Scale TSP Instances
Ant Colony Optimisation (ACO) is a well known metaheuristic that has proven
successful at solving Travelling Salesman Problems (TSP). However, ACO suffers
from two issues; the first is that the technique has significant memory
requirements for storing pheromone levels on edges between cities and second,
the iterative probabilistic nature of choosing which city to visit next at
every step is computationally expensive. This restricts ACO from solving larger
TSP instances. This paper will present a methodology for deploying ACO on
larger TSP instances by removing the high memory requirements, exploiting
parallel CPU hardware and introducing a significant efficiency saving measure.
The approach results in greater accuracy and speed. This enables the proposed
ACO approach to tackle TSP instances of up to 200K cities within reasonable
timescales using a single CPU. Speedups of as much as 1200 fold are achieved by
the technique
Recommended from our members
Combinatorial optimization and metaheuristics
Today, combinatorial optimization is one of the youngest and most active areas of discrete mathematics. It is a branch of optimization in applied mathematics and computer science, related to operational research, algorithm theory and computational complexity theory. It sits at the intersection of several fields, including artificial intelligence, mathematics and software engineering. Its increasing interest arises for the fact that a large number of scientific and industrial problems can be formulated as abstract combinatorial optimization problems, through graphs and/or (integer) linear programs. Some of these problems have polynomial-time (“efficient”) algorithms, while most of them are NP-hard, i.e. it is not proved that they can be solved in polynomial-time. Mainly, it means that it is not possible to guarantee that an exact solution to the problem can be found and one has to settle for an approximate solution with known performance guarantees. Indeed, the goal of approximate methods is to find “quickly” (reasonable run-times), with “high” probability, provable “good” solutions (low error from the real optimal solution). In the last 20 years, a new kind of algorithm commonly called metaheuristics have emerged in this class, which basically try to combine heuristics in high level frameworks aimed at efficiently and effectively exploring the search space. This report briefly outlines the components, concepts, advantages and disadvantages of different metaheuristic approaches from a conceptual point of view, in order to analyze their similarities and differences. The two very significant forces of intensification and diversification, that mainly determine the behavior of a metaheuristic, will be pointed out. The report concludes by exploring the importance of hybridization and integration methods
- …