CiteSeerX — An Ant Colony Optimization Approach to the Probabilistic Traveling Salesman Problem

An Ant Colony Optimization Approach to the Probabilistic Traveling Salesman Problem (2002) [11 citations — 6 self]

Popular Tags

No tags have been applied to this document.

BibTeX | Add To MetaCart

@MISC{Bianchi02anant,
    author = {Leonora Bianchi and Luca Maria Gambardella and Marco Dorigo},
    title = {An Ant Colony Optimization Approach to the Probabilistic Traveling Salesman Problem},
    year = {2002}
}

Years of Citing Articles

Bookmarks

OpenURL

Abstract:

The Probabilistic Traveling Salesman Problem (PTSP) is a TSP problem where each customer has a given probability of requiring a visit. The goal is to find an a priori tour of minimal expected length over all customers, with the strategy of visiting a random subset of customers in the same order as they appear in the a priori tour.

Citations

530	A.: Ant System: Optimization by a colony of cooperating agents – Dorigo, Maniezzo, et al. - 1996
377	Ant colony system: A cooperative learning approach to the traveling salesman problem – Dorigo, Gambardella - 1997
219	Ant algorithms for discrete optimization – Dorigo, Caro, et al. - 1999
44	Solving symmetric and asymmetric TSPs by ant colonies – Gambardella, Dorigo - 1996
27	Probabilistic Traveling Salesman Problems – Jaillet - 1985
22	Probabilistic Combinatorial Optimization Problems – Bertsimas - 1988
19	A priori optimization – Bertsimas, Jaillet, et al. - 1990
10	Further results on the probabilistic traveling salesman problem – Bertsimas, Howell - 1993
4	Probabilistic Vehicle Routing Problems – Jézéquel - 1985
4	An exact solution for the a priori optimization of the probabilistic traveling salesman problem – Laporte, Louveaux, et al. - 1994