The evaluating scale of the best-seeking efficiency in an intricate and difficult combining and optimizing problem

As a full domain searching algorithm in the area of intricate multi-apex functions solution, machine learning, production scheduling, large scale combination optimizing, adapting controlling and the best scheme seeking of the skill control, the GA has an increasingly remarkable application prospect. Accordingly, the evaluating scale of the best-seeking efficiency should become an important task of GA research. A reasonable and regular evaluating scale is the prerequisite for the construction of a highly efficient GA. This paper puts forward the evaluating scale of the best-seeking efficiency, taking an intricate and difficult combining and optimizing problem as an example.