The Ackley Problem |
||||
![]() |
Description:The Ackley Problem [ACK87] is a minimization problem. Originaly this problem was defined for two dimensions, but the problem has been generalized to N dimensions [BAC96]. Formally, this problem can be
described as finding a string Click here to get this description in tex format and here to get the figure in eps format. |
|||
Instances and best known solutions for those instances:In order to define an instance of this function we need to provide the dimension of the problem (N). The optimum solution of the problem is the vector v = (0,...,0) with F(v) = 0. |
||||
Related Papers:[ACK87] D. H. Ackley. "A connectionist machine for genetic hillclimbing". Boston: Kluwer Academic Publishers, 1987. [BAC96] T. Bäck. "Evolutionary algorithms in theory and practice". Oxford University Press, 1996. Click here to get the bibliography in bibtex fotmat. |
||||
|
||||