Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/325768 
Year of Publication: 
2023
Citation: 
[Journal:] Operations Research Perspectives [ISSN:] 2214-7160 [Volume:] 10 [Article No.:] 100283 [Year:] 2023 [Pages:] 1-6
Publisher: 
Elsevier, Amsterdam
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.
Subjects: 
Combinatorial optimization
Global optimization
Metaheuristics
Stopping rules
Termination conditions
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by-nc-nd Logo
Document Type: 
Article

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.