On deciding when to stop metaheuristics: Properties, rules and termination conditions
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 stop