Ant colonies for the travelling salesman problem.

By Marco Dorigo, Luca Maria Gambardella. 1997

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

GADMM: Fast and Communication Efficient Framework for Distributed Machine Learning (2019, methodology): “Decentralized heuristics for TSP have been proposed which can also be used (Peterson, 1990; Dorigo and Gambardella, 1997).”
Ant colony optimization techniques for the vehicle routing problem (2004, methodology): “The use of specialized groups or families of ants has been suggested in the literature [10,11], but has not been implemented in previous research for the VRP The concept of using separate groups of ants is based on observations that ants in nature sometimes have special job classifications, such as ”
The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances (2003, background): “ACS [42, 34, 33] improves over AS by increasing the importance of exploitation of information collected by previous ants with respect to exploration of the search space.”
Discrete cuckoo search algorithm for the travelling salesman problem (2014, methodology): “Many of metaheuristic algorithms have been applied to solve TSP by various researchers, such as SA [4], TS [20], GA [17], ACO [8], Discrete particle swarm optimisation (DPSO) [27], genetic –simulated annealing ant colony system with particle swarm optimisation techniques (GSAACS-PSOT) [6] and fuzzy ”
Ant colony optimization (2006, unknown): “1992 [7], [8] Ant-Q Gambardella & Dorigo 1995 [9] Ant Colony System Dorigo & Gambardella 1996 [10]–[12] MAX–MIN AS Stützle & Hoos 1996 [13]–[15] Rank-based AS Bullnheimer et al.”
Inspiration for optimization from social insect behaviour (2000, methodology): “Optimization and control algorithms inspired by models of co-operative food retrieval in ants have been unexpectedly successful and have become known in recent years as Ant Colony Optimization (ACO”
An ant colony optimization algorithm for the redundancy allocation problem (RAP) (2004, unknown): “Continue until a stopping criterion is reached.”
Disease Diagnosis in Smart Healthcare: Innovation, Technologies and Applications (2017, background): “Examples of such type of problems that are solved using combinatorial optimization are minimum spanning tree problem [30] and travelling salesman problem [31].”