“…Some of the most important traditional analytical/deterministic methods are used for array antennas, such as WoodwardLawsen method, Chebyshev method, Schelkunoff method and Levenberg-Marquardt algorithm [14], steepest decent [15], gradient-minimax [16], and intersection approach [17,18], each of which is used to fulfill various purposes in designing array antennas patterns. Many drawbacks are associated with using deterministic methods such as shortcomings in designing array antennas with complex geometrical structures, consuming more computationally time as the number of the elements in the array increases, and some of these methods are from testing and trying type, having a large gap with the most efficient conditions.…”