Ant colonies for the travelling salesman problem.

@article{Dorigo1997AntCF,
  title={Ant colonies for the travelling salesman problem.},
  author={Marco Dorigo and Luca Maria Gambardella},
  journal={Bio Systems},
  year={1997},
  volume={43 2},
  pages={
          73-81
        }
}
A SURVEY ON ANT COLONY
This paper deals with Ant Colony Optimization, a heuristic algorithm with strong robustness and the ability of finding the optimal solution which has been applied to a number of combinatorial
Variation of ant colony optimization parameters for solving the travelling salesman problem
TLDR
The Ant Colony Optimization (ACO) algorithm for solving the Travelling Salesman Problem is described, a swarm intelligence approach where the agents (ants) communicate using a chemical substance called pheromone, which evaporates over time.
Solution of Travelling Salesman Problem Using Ant Colony Algorithm
TLDR
This study aims at solving the travelling salesman problem using ant colony system, a meta-heuristic method which has been developed based upon food searching characteristics of the ant colonies.
Solving Travelling Salesmen Problem using Ant Colony Optimization Algorithm
Ant Colony Optimization is a new meta-heuristic technique used for solving different combinatorial optimization problems. ACO is based on the behaviors of ant colony and this method has strong
Parallelized genetic ant colony systems for solving the traveling salesman problem
In this paper, we present a new method, called the parallelized genetic ant colony system (PGACS), for solving the traveling salesman problem. It consists of the genetic algorithm, including the new
An ant system with two colonies and its application to Traveling Salesman Problem
TLDR
An ant system with two colonies is proposed for the combinatorial optimization problems and results show that the proposed method performs better than the traditional ACO.
An Ant Colony Optimization approach to solve Travelling Salesman Problem
Ant Colony Optimization algorithms (ACO) are meta-heuristic algorithms inspired from the cooperative behavior of real ants that could be used to achieve complex computations and have been proven to
An adaptive weighted ant colony algorithm
TLDR
A new ant colony algorithm based on Adaptive Weighted Updating Rule is introduced, which provides a new approach for solving discrete optimization problems and demonstrates the effectiveness and flexibility of the new algorithm.
Two-Stage Ant Colony Optimization for Solving the Traveling Salesman Problem
TLDR
Experimental results obtained conclude that the Two-Stage approach significantly improves the Ant System and Ant Colony System in terms of the computation time needed.
Ant Colony Optimization for the Traveling Salesman Problem Based on Ants with Memory
We propose a new model of ant colony optimization (ACO) to solve the traveling salesman problem (TSP) by introducing ants with memory into the ant colony system (ACS). In the new ant system, the ants
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 36 REFERENCES
Applying evolutionary programming to selected traveling salesman problems
Natural evolution provides a paradigm for the design of stochastic-search optimization algorithms. Various forms of simulated evolution, such as genetic algorithms and evolutionary programming
Ant system: optimization by a colony of cooperating agents
TLDR
It is shown how the ant system (AS) can be applied to other optimization problems like the asymmetric traveling salesman, the quadratic assignment and the job-shop scheduling, and the salient characteristics-global data structure revision, distributed communication and probabilistic transitions of the AS.
Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This paper discusses a highly effective heuristic procedure for generating optimum and near-optimum solutions for the symmetric traveling-salesman problem. The procedure is based on a general
An analogue approach to the travelling salesman problem using an elastic net method
TLDR
This work describes how a parallel analogue algorithm, derived from a formal model for the establishment of topographically ordered projections in the brain, can be applied to the travelling salesman problem, and produces shorter tour lengths than another recent parallel analogue algorithms.
A Study of Some Properties of Ant-Q
TLDR
This article focuses on the experimental study of the sensitivity of the Ant-Q algorithm to its parameters and on the investigation of synergistic effects when using more than a single ant.
Ant Colonies for the QAP
This paper presents HAS-QAP, an hybrid ant colony s ystem coupled with a local search, applied to the quadratic assignment problem. HAS-QAP uses pheromon e trail information to perform modifications
A Method for Solving Traveling-Salesman Problems
The traveling-salesman problem is a generalized form of the simple problem to find the smallest closed loop that connects a number of points in a plane. Efforts in the past to find an efficient
Applying the genetic approach to simulated annealing in solving some NP-hard problems
TLDR
The authors' approach can be viewed as a simulated annealing algorithm with population-based state transition and with genetic-operator-based quasi-equilibrium control and as a genetic algorithm with the Boltzmann-type selection operator.
The traveling salesman: computational solutions for TSP applications
Basic Concepts.- Related Problems and Applications.- Geometric Concepts.- Candidate Sets.- Construction Heuristics.- Improving Solutions.- Heuristics for Large Geometric Problems.- Further Heuristic
...
1
2
3
4
...