“…A downhill proceeding algorithm monotonically decreasing the value of an objective function may get stuck into a locally optimal design other than the globally optimal one. For this reason, some researchers preferred global search algorithms like genetic algorithms, 184,226,248,249,254,255,260,286,288,291,296,313,315,321,324,328,329,339,362,373,379,395,398,402,404,405,415,421,424,428,430,443,445,448,457,458,465,467,468,473,477,494,495,497,499–501,504,505,508,511,518,520,526,537,547– 549,552,555,558,563,…”