Generalized insertion ants for the traveling salesman problem

Generalized insertion ants for the traveling salesman problem

0.00 Avg rating0 Votes
Article ID: iaor20051156
Country: Netherlands
Volume: 131
Issue: 1
Start Page Number: 187
End Page Number: 201
Publication Date: Oct 2004
Journal: Annals of Operations Research
Authors: , ,
Keywords: heuristics
Abstract:

In this paper, the probabilistic nearest neighbor heuristic, which is at the core of classical ant colony systems for the Traveling Salesman Problem, is replaced by an alternative insertion procedure known as the GENI heuristic. The benefits provided by GENI-based ants are empirically demonstrated on a set of benchmark problems, through a comparison with the classical ant colony system and an iterated GENI heuristic.

Reviews

Required fields are marked *. Your email address will not be published.