Pareto Ranking Bisection Algorithm for Expedited Multi-Objective Optimization of Antenna Structures
The purpose of this letter is introduction of a novel methodology for expedited multi-objective 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 trade-offs 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. Out methodology is demonstrated using a UWB monopole antenna and compared to state-of-the-art multi-objective optimization methods.
Sławomir Kozieł, Adrian Bekasiewicz. (2017). Pareto Ranking Bisection Algorithm for Expedited Multi-Objective Optimization of Antenna Structures, (16), 1488-1491. https://doi.org/10.1109/lawp.2016.2646842
wyświetlono 18 razy