Pareto-Ranking Bisection Algorithm for Expedited Multiobjective Optimization of Antenna Structures

Abstract

The purpose of this letter is the introduction of a novel methodology for expedited multiobjective design of antenna structures. The key component of the presented approach is fast identification of the initial representation of the Pareto front (i.e., a set of design representing the best possible tradeoffs between conflicting objectives) using a Pareto-ranking bisection algorithm. The algorithm finds a discrete set of Pareto-optimal designs. Its operation principle is sequential partitioning of the line segments connecting the designs found in the previous iterations, and refining the new designs allocated this way by means of poll-type search involving Pareto ranking. Subsequently, the final Pareto set is obtained by means of response correction techniques. Our methodology is demonstrated using an ultrawideband monopole antenna and compared to state-of-the-art multiobjective optimization methods.