paper-with-me

Papers

Multi-objective Memetic Algorithm with Adaptive Weights for Inverse Antenna Design

2024-08-07 · Petr Kadlec, Miloslav Capek

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.

📄 PDF Abstract BibTeX arXiv:2409.14245

Code (0)

등록된 구현이 없습니다.

Tasks

Diversity

Methods 이 논문이 사용한 방법론

SPEED The monocular depth estimation (MDE) is the task of estimating depth from a single frame. This information is an essential knowledge in many computer vision tasks such as scene…

Similar Papers 제목 키워드 기반

PasMoQAP: A Parallel Asynchronous Memetic Algorithm for solving the Multi-Objective Quadratic Assignment Problem

2017-06-27 · Claudio Sanhueza, Francia Jimenez, Regina Berretta, Pablo Moscato

Multi-Objective Optimization Problems (MOPs) have attracted growing attention during the last decades. Multi-Objective Evolutionary Algorithms (MOEAs) have been extensively used to address MOPs because are able to approx…

Evolutionary Algorithms

A GRASP-based memetic algorithm with path relinking for the far from most string problem

2024-05-27 · José E. Gallardo, Carlos Cotta

The FAR FROM MOST STRING PROBLEM (FFMSP) is a string selection problem. The objective is to find a string whose distance to other strings in a certain input set is above a given threshold for as many of those strings as …

Epoch-based Application of Problem-Aware Operators in a Multiobjective Memetic Algorithm for Portfolio Optimization

2024-12-05 · Feijoo Colomine Durán, Carlos Cotta, Antonio J. Fernández-Leiva

We consider the issue of intensification/diversification balance in the context of a memetic algorithm for the multiobjective optimization of investment portfolios with cardinality constraints. We approach this issue in …

Multiobjective OptimizationPortfolio Optimization

A Memetic Walrus Algorithm with Expert-guided Strategy for Adaptive Curriculum Sequencing

2025-06-16 · Qionghao Huang, Lingnuo Lu, Xuemei Wu, Fan Jiang 외

Adaptive Curriculum Sequencing (ACS) is essential for personalized online learning, yet current approaches struggle to balance complex educational constraints and maintain optimization stability. This paper proposes a Me…

Computational Efficiency

A Parallel Memetic Algorithm to Solve the Vehicle Routing Problem with Time Windows

2014-02-27 · Jakub Nalepa, Zbigniew J. Czech

This paper presents a parallel memetic algorithm for solving the vehicle routing problem with time windows (VRPTW). The VRPTW is a well-known NP-hard discrete optimization problem with two objectives. The main objective …