Page 563 - Mathematical Techniques of Fractional Order Systems
P. 563

Parameters Identification of Fractional Order Chapter | 18  541



                                                Start

                            Initialize the Grasshopper Population (n) and maximum number of
                                           iteration (I), cmax, cmin


                                      Calculate the fitness of each search agent


                                      Define the best search agent (T)



                                  No              i<I

                  Display the best solutions   Yes
                                          C = cmax-i*( cmax-cmin)/I
                         End

                                                 J<n
                                                    Yes
                            No
                                  Update the position of the search agent by Eq.19


                                                 J = j+1

                                       Calculate the fitness of each search agent


                                        Update T  if there is a better solution

                                                 i = i+1

             FIGURE 18.4 GOA algorithm flowchart.

             1 to 0 over the course of iterations to improve the fluctuation of c as in
             Eq. (18.20).

                                         ðc f 2 c i Þ
                                c 5 c i 2 i:     :ChaosðiÞ;           ð18:20Þ
                                            I
             where c i ; c f are the initial and final values of the parameters c, they are
             adjusted as 1 and 0.00001 respectively. i, I are the current iteration and the
                                                    -
             maximum number of iterations respectively. Chaos is the chaotic map.
   558   559   560   561   562   563   564   565   566   567   568