These problems assume a bit encoding. They are an attempt to duplicate what De Jong did in his thesis, however the problems have been converted into maximization problems. The representation is simple - it assumes the GA individuals are encoded as arrays of integer 1's and 0's. The population is in a 2-D array called "c", so individual i is c[i], and bit j of individual i is c[i][j]. You will no doubt have to change this indexing scheme to use your own GA.
You will need to define a function ssrand() to return a (0,1) Gaussian random variable for function F4.
Please send email to wspears arobase cs.uwyo.edu if you find any errors in these functions.