 |
From the left figure, it can be observed that, for the same number of iteration, FHO converges faster than the genetic algorithm when solving the frame optimization problems, as reflected by its consistently lower frame lengths. To provide a simple measure of computational complexity, we further compare the runtime of a single execution of each algorithm. FHO also requires less computation time than GA. The dashed lines indicate the average runtime, which is 1.05 seconds for GA and 0.87 seconds for FHO under our experimental settings. Therefore, the proposed FHO-based frame optimization algorithm outperforms the GA-based one in terms of both convergence speed and computational efficiency. |
IEEE/ICACT20260317 Slide.19
[Big Slide]
[YouTube]