On deciding when to stop metaheuristics: Properties, rules and termination conditions

Albert Corominas

Operations Research Perspectives, 2023, vol. 10, issue C

Abstract: Most metaheuristics lack a termination condition based on reasonable premises and guaranteeing the quality of the solution provided by the algorithm. We propose a methodological frame that distinguishes the concepts of properties of the final incumbent solution, rules and termination conditions. The frame is applied to discuss the use of popular stopping rules (such as maximum number of iterations and maximum number of iterations without improvement) in the resolution of global optimization and combinatorial optimization problems via random restart metaheuristics. This allows finding simple formulas for determining the maximum number of iterations corresponding to diverse combinations of problem types and properties desired for the final incumbent solution. The suggestions for further research include the application of the probabilistic theory of records to the study of terminal conditions for metaheuristics.

Keywords: Metaheuristics; Stopping rules; Termination conditions; Combinatorial optimization; Global optimization (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S2214716023000180
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:oprepe:v:10:y:2023:i:c:s2214716023000180

DOI: 10.1016/j.orp.2023.100283

Access Statistics for this article

Operations Research Perspectives is currently edited by Rubén Ruiz Garcia

More articles in Operations Research Perspectives from Elsevier
Bibliographic data for series maintained by Catherine Liu ().