A theoretical investigation of termination criteria for evolutionary algorithms

DOI10.1007/978-3-031-57712-3_11MaRDI QIDQ6635985FDO

Authors Jonathan E. Rowe

Publication date 12 November 2024

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Combinatorial optimization (90C27)

Cites work

• A cutoff time strategy based on the coupon collector's problem
• Do additional target points speed up evolutionary algorithms?
• Fitness levels with tail bounds for the analysis of randomized search heuristics
• Non-uniform mutation rates for problems with unknown solution lengths
• Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem
• Solving problems with unknown solution length at almost no extra cost
• The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm
• The linear hidden subset problem for the \((1 + 1)\) EA with scheduled and adaptive mutation rates

This page was built for publication: A theoretical investigation of termination criteria for evolutionary algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635985)