This paper was published through Galoá and has a deposited DOI. To cite this paper, use one of the standards below:
In case you are one of the co-authors and want to register this paper in your Lattes, use the following code: doi > 10.59254/sbpo-2021-131575
If you've NEVER registered a DOI in your Lattes, check our tutorial!Metaheuristics are high level heuristics and usually lack an effective stopping criteria, relying on generic information, like number of iterations or time, to decide when they should stop. To tackle this problem for the GRASP metaheuristic, past works proposed a probabilistic stopping criteria based on the fact that the solutions of GRASP iterations follow a normal distribution. However, that method has two drawbacks: it is slow to estimate the probabilities and it is not very accurate. In order to address those problems, the present work proposes an alternative method that makes use of Decision Tree Regression to produce a stopping rule. In this paper, we show that this approach can be faster and more precise. We demonstrate that, in some cases, models trained on an instance of a given problem can also be applied to instances belonging to the same problem or even to other problems.
With nearly 200,000 papers published, Galoá empowers scholars to share and discover cutting-edge research through our streamlined and accessible academic publishing platform.
Learn more about our products:
This proceedings is identified by a DOI , for use in citations or bibliographic references. Attention: this is not a DOI for the paper and as such cannot be used in Lattes to identify a particular work.
Check the link "How to cite" in the paper's page, to see how to properly cite the paper