A Chaotic Multi-Objective Runge–Kutta Optimization Algorithm for Optimized Circuit Design

Algorithm 1

The Pseudocode of RUN.

 Part 1. Initialization

 Initialization

 Randomly generate the initial population of the RUN

 Evaluate the objective function for each population member

 Obtain , , and

 Part 2. RUN operators

  forit = 1 : MaxIt

   fori = 1 : np

    forj = 1 : dim

     Evaluate position (Equation 30)

    end for

    ESQ

     if

     Evaluate position (Equation 31)

      if

       if rand <

       Evaluate position (Equation 35)

      end

     end

    end

   Modernize positions and

   endfor

   Modernize position

  it = it + 1

  end

 Part 3. return