An ant colony approach to the orienteering problem (2001)
| Citations: | 2 - 0 self |
BibTeX
@TECHREPORT{Liang01anant,
author = {Yun-Chia Liang and Alice E. Smith},
title = {An ant colony approach to the orienteering problem},
institution = {},
year = {2001}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper develops an ant colony optimization approach to the orienteering problem, a general version of the well-known traveling salesman problem with many relevant applications in industry. Based on mainstream ant colony ideas, an unusual sequenced local search and a distance based penalty function are added to result in a method that is convincingly shown to be the best heuristic published for this problem class. Results on 67 test problems from the literature show that the ant colony method performs as well or better in all cases and does so at very modest computational cost. Furthermore, the ant colony method is insensitive to seed, problem instance, problem size and degree of constraint.
