Effective probabilistic stopping rules for randomized metaheuristics: GRASP implementations

Authors:
Celso C. Ribeiro;Isabel Rosseti;Reinaldo C. Souza
Affiliations:
Department of Computer Science, Universidade Federal Fluminense, Niterói, RJ, Brazil;Department of Computer Science, Universidade Federal Fluminense, Niterói, RJ, Brazil;Department of Electrical Engineering, Pontifícia Universidade Católica do Rio de Janeiro, Rio de Janeiro, Brazil
Venue:
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Year:
2011

Citing 9
Cited 0

Bayesian stopping rules for multistart global optimization methods

Mathematical Programming: Series A and B
Stopping rules for a random optimization method

SIAM Journal on Control and Optimization
Sequential Stopping Rules for Random Optimization Methods with Applications to Multistart Local Search

SIAM Journal on Optimization
Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial

Journal of Heuristics
A Parallel GRASP Heuristic for the 2-Path Network Design Problem (Research Note)

Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
A Hybrid Heuristic for the p-Median Problem

Journal of Heuristics
The 2-path network problem

Networks
Bayesian Stopping Rules for Greedy Randomized Procedures

Journal of Global Optimization
Efficient parallel cooperative implementations of GRASP heuristics

Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The main drawback of most metaheuristics is the absence of effective stopping criteria. Most implementations stop after performing a given maximum number of iterations or a given maximum number of consecutive iterations without improvement in the best known solution value, or after the stabilization of the set of elite solutions found along the search. We propose probabilistic stopping rules for randomized metaheuristics such as GRASP and VNS. We first show experimentally that the solution values obtained by GRASP fit a Normal distribution. Next, we use this approximation to obtain an online estimation of the number of solutions that might be at least as good as the best known at the time of the current iteration. This estimation is used to implement effective stopping rules based on the trade off between solution quality and the time needed to find a solution that might improve the best found to date. This strategy is illustrated and validated by a computational study reporting results obtained with some GRASP heuristics.