Please help support CiteULike by taking part in our survey.
CiteULike Search Register Log in
CiteULike is a free online bibliography manager. Register and you can start organising your references online.

MAX-MIN Ant System and local search for the traveling salesman problem

by: T. Stutzle, H. Hoos
Evolutionary Computation, 1997., IEEE International Conference on In Evolutionary Computation, 1997., IEEE International Conference on (1997), pp. 309-314.

X Abstract

Ant 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

View the full article here:

DOI, IEEE Explore

This article has been bookmarked once, on 2008-08-26.

2008-08-26 User japarejo
Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.