GENI Ants for the Traveling Salesman Problem

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 o...

Full description

Saved in:
Bibliographic Details
Published in:Annals of operations research 2004-10, Vol.131 (1-4), p.187-201
Main Authors: Le Louarn, François-Xavier, Gendreau, Michel, Potvin, Jean-Yves
Format: Article
Language:English
Subjects:
Algorithms
Benchmarks
Food
Heuristic
Operations research
Optimization
Pheromones
Random variables
Studies
Trails
Traveling salesman problem
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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. [PUBLICATION ABSTRACT]
ISSN:0254-5330
1572-9338
DOI:10.1023/B:ANOR.0000039518.73626.a5