利用GA遗传算法解决欺骗函数最优问题，具体问题描述如下，如有问题请与我联系(The deceptive functions are a family of functions in which there exists
low-order building blocks that do not combine to form the higher-order
building blocks. Here, a deceptive problem that consists of 25 copies of
the order-4 fully deceptive function DF2 is constructed for this paper.
DF2 can be described as follows:
f(0000)=28 f(0001)=26 f(0010)=24 f(0011)=18
f(0100)=22 f(0101)=6 f(0110)=14 f(0111)=0
f(1000)=20 f(1001)=12 f(1010)=10 f(1011)=2
f(1100)=8 f(1101)=4 f(1110)=6 f(1111)=30
This problem has a maximal function value of 750.)