|
Home
News
Citegeist
|
Browse Groups
Search Groups
Journals
|
FAQs
Howto
Discussion
|
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
MAX-MIN Ant System and local search for the traveling salesman problemby: T. Stutzle, H. Hoos
Evolutionary Computation, 1997., IEEE International Conference on In Evolutionary Computation, 1997., IEEE International Conference on (1997), pp. 309-314.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting HistoryNEW
AbstractAnt System is a general purpose algorithm inspired by the study of the behavior of ant colonies. It is based on a cooperative search paradigm that is applicable to the solution of combinatorial optimization problems. We introduce MAX-MIN Ant System, an improved version of basic Ant System, and report our results for its application to symmetric and asymmetric instances of the well known traveling salesman problem. We show how MAX-MIN Ant System can be significantly improved, extending it with local search heuristics. Our results clearly show that MAX-MIN Ant System has the property of effectively guiding the local search heuristics towards promising regions of the search space by generating good initial tours
BibTeX record
RIS record