Probability distribution of solution time in GRASP: An experimental investigation

R.M. Aiex, M.G.C. Resende, and C.C. Ribeiro

Journal of Heuristics, vol. 8, pp. 343-373, 2002.

ABSTRACT

A GRASP (greedy randomized adaptive search procedure) is a multi-start metaheuristic for combinatorial optimization.  We study the probability distributions of solution time to a sub-optimal target value in five GRASPs that have appeared in the literature and for which source code is available.  The distributions are estimated by running 12,000 independent runs of the heuristic. Standard methodology for graphical analysis is used to compare the empirical and theoretical distributions and estimate the parameters of the distributions.  We conclude that the solution time to a sub-optimal target value fits a two-parameter exponential distribution.  Hence, it is possible to achieve linear speed-up by implementing GRASP in parallel.

PDF file of full paper

Go back

Mauricio G.C. Resende's Home Page

Last modified: 15 December 2000

Copyright Notice