Off-line vs. On-line tuning: A study on MAX - MIN ant system for the TSP

17Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Stochastic local search algorithms require finding an appropriate setting of their parameters in order to reach high performance. The parameter tuning approaches that have been proposed in the literature for this task can be classified into two families: on-line and off-line tuning. In this paper, we compare the results we achieved with these two approaches. In particular, we report the results of an experimental study based on a prominent ant colony optimization algorithm, MAX - MIN - Ant System, for the traveling salesman problem. We observe the performance of on-line parameter tuning for different parameter adaptation schemes and for different numbers of parameters to be tuned. Our results indicate that, under the experimental conditions chosen here, off-line tuned parameter settings are preferable. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Pellegrini, P., Stützle, T., & Birattari, M. (2010). Off-line vs. On-line tuning: A study on MAX - MIN ant system for the TSP. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6234 LNCS, pp. 239–250). https://doi.org/10.1007/978-3-642-15461-4_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free