A distance based rule for removing population members in genetic algorithms
From MaRDI portal
Publication:816430
DOI10.1007/s10288-005-0064-zzbMath1084.68891OpenAlexW2025468705MaRDI QIDQ816430
Publication date: 9 March 2006
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-005-0064-z
Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (3)
New heuristic algorithms for solving the planar \(p\)-median problem ⋮ An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems ⋮ Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
This page was built for publication: A distance based rule for removing population members in genetic algorithms