Paola Pellegrini () (Department of Applied Mathematics, University of Venice) Elena Moretti () (Department of Applied Mathematics, University of Venice) Daniela Favaretto () (Department of Applied Mathematics, University of Venice)
Additional information is available for the following
registered author(s):
In this paper a definition of the exploration performed by stochastic algorithms is proposed. It is based on the observation through cluster analysis of the solutions generated during a run. The probabilities associated by an algorithm to solution components are considered. Moreover, a consequent method for quantifying the exploration is provided. Such a measurement is applied to MAX-MIN Ant System. The results of the experimental analysis allow to observe the impact of the parameters of the algorithm on the exploration.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Department of Applied Mathematics, University of Venice in its series Working Papers with number
169.