Solving a Multi-Objective Optimization Problem on Combinatorial Point Configurations

Semenova, N. V.

doi:10.1007/s10559-026-00862-7

Solving a Multi-Objective Optimization Problem on Combinatorial Point Configurations

2026-03-01

0

PRE

AI

DOI：10.1007/s10559-026-00862-7

Original

Original request for help

Save

Abstract

En 中文

A mathematical model of a multi-objective problem for combinatorial configurations of polypermutations is proposed, and its features are analyzed taking into account the properties of combinatorial configurations and their graphs. A new algorithm for a horizontal approach to solving such problems of finding a set of Pareto-optimal solutions is developed, based on adaptive combinatorial search and heuristic methods. The operation of the proposed algorithm is illustrated by solving a test problem. Based on numerical experiments, the effectiveness of the algorithm on Euclidean configurations of polypermutations and permutations with repetitions is justified, taking into account modern approaches in combinatorial and vector optimization.

Keywords:

multi-objective optimization

combinatorial point configurations

configurations of permutations

polypermutations

linear function

structural graph

Solving a Multi-Objective Optimization Problem on Combinatorial Point Configurations

Abstract

Journal

Organization