Crossing over genetic algorithms: the Sugal generalised GA

DOI10.1023/A:1009629730631zbMath1071.90579OpenAlexW1604459122MaRDI QIDQ2567857

Andrew Hunter

Publication date: 13 October 2005

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009629730631

zbMATH Keywords

simulated annealinggenetic algorithmssoftware package

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Packaged methods for numerical algorithms (65Y15)

Related Items (3)

A genetic algorithm for solving the economic lot scheduling problem in flow shops ⋮ Solving the economic lot scheduling problem with multiple facilities in parallel using the time-varying lot sizes approach ⋮ Sugal

This page was built for publication: Crossing over genetic algorithms: the Sugal generalised GA