Saved in:
Bibliographic Details
Main Authors: Kadlec, Petr, Capek, Miloslav
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2409.14245
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912270480572416
author Kadlec, Petr
Capek, Miloslav
author_facet Kadlec, Petr
Capek, Miloslav
contents This paper deals with discrete topology optimization and describes the modification of a single-objective algorithm into its multi-objective counterpart. The result is a significant increase in the optimization speed and quality of the resulting Pareto front as compared to conventional state-of-the-art automated inverse design techniques. This advancement is possible thanks to a memetic algorithm combining a gradient-based search for local minima with heuristic optimization to maintain sufficient diversity. The local algorithm is based on rank-1 perturbations; the global algorithm is NSGA-II. An important advancement is the adaptive weighting of objective functions during optimization. The procedure is tested on four challenging examples dealing with both physical and topological metrics and multi-objective settings. The results are compared with standard techniques, and the superb performance of the proposed technique is reported. The implemented algorithm applies to antenna inverse design problems and is an efficient data miner for machine learning tools.
format Preprint
id arxiv_https___arxiv_org_abs_2409_14245
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Multi-objective Memetic Algorithm with Adaptive Weights for Inverse Antenna Design
Kadlec, Petr
Capek, Miloslav
Neural and Evolutionary Computing
This paper deals with discrete topology optimization and describes the modification of a single-objective algorithm into its multi-objective counterpart. The result is a significant increase in the optimization speed and quality of the resulting Pareto front as compared to conventional state-of-the-art automated inverse design techniques. This advancement is possible thanks to a memetic algorithm combining a gradient-based search for local minima with heuristic optimization to maintain sufficient diversity. The local algorithm is based on rank-1 perturbations; the global algorithm is NSGA-II. An important advancement is the adaptive weighting of objective functions during optimization. The procedure is tested on four challenging examples dealing with both physical and topological metrics and multi-objective settings. The results are compared with standard techniques, and the superb performance of the proposed technique is reported. The implemented algorithm applies to antenna inverse design problems and is an efficient data miner for machine learning tools.
title Multi-objective Memetic Algorithm with Adaptive Weights for Inverse Antenna Design
topic Neural and Evolutionary Computing
url https://arxiv.org/abs/2409.14245