Generation of the exact Pareto set in Multi-Objective Traveling Salesman and Set Covering Problems [PDF]
Applied Mathematics and Computation, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kostas Florios, George Mavrotas
openaire +3 more sources
Singular Continuation: Generating Piece-wise Linear Approximations to Pareto Sets via Global Analysis [PDF]
, 2011 We propose a strategy for approximating Pareto optimal sets based on the global analysis framework proposed by Smale (Dynamical systems, New York, 1973, pp. 531-544). The method highlights and exploits the underlying manifold structure of the Pareto sets,
Alberto Lovison, Debreu G.
core +2 more sources
Speeding up Martins' algorithm for multiple objective shortest path problems [PDF]
, 2013 The latest transportation systems require the best routes in a large network with respect to multiple objectives simultaneously to be calculated in a very short time.
Audenaert, Pieter +4 more
core +2 more sources
Predictive control of high-power three-level PWM rectifier without weighting coefficient
Gong-kuang zidonghua, 2021 A high-power three-level PWM rectifier predictive control algorithm without weight coefficients is proposed for the problem of complicated design of the weight coefficients of the cost function in the traditional predictive control algorithm.
CHENG Weiwei, WU Rui
doaj +1 more source
Efficient Identification of the Pareto Optimal Set [PDF]
, 2014 In this paper, we focus on expensive multiobjective optimization problems and propose a method to predict an approximation of the Pareto optimal set using classification of sampled decision vectors as dominated or nondominated. The performance of our method, called EPIC, is demonstrated on a set of benchmark problems used in the multiobjective ...
Ingrida Steponavice +3 more
openaire +1 more source
An Analysis on Selection for High-Resolution Approximations in Many-Objective Optimization [PDF]
, 2014 This work studies the behavior of three elitist multi- and many-objective evolutionary algorithms generating a high-resolution approximation of the Pareto optimal set.
Aguirre, Hernan +3 more
core +3 more sources
On the hierarchical structure of Pareto critical sets [PDF]
Journal of Global Optimization, 2019 In this article we show that the boundary of the Pareto critical set of an unconstrained multiobjective optimization problem (MOP) consists of Pareto critical points of subproblems considering subsets of the objective functions. If the Pareto critical set is completely described by its boundary (e.g.
Gebken, Bennet +2 more
openaire +3 more sources
Abstract and Applied Analysis, 2013 In general Banach spaces, we consider a vector optimization problem (SVOP) in which the objective is a set-valued mapping whose graph is the union of finitely many polyhedra or the union of finitely many generalized polyhedra.
Qinghai He, Weili Kong
doaj +1 more source
Directional Pareto Front and Its Estimation to Encourage Multi-Objective Decision-Making
IEEE Access, 2023 This work introduces the following concepts of directional and estimated directional Pareto front to encourage multi-objective decision making, especially when the Pareto front exists in limited regions in the objective space. The general output of multi-
Tomoaki Takagi +2 more
doaj +1 more source
Determining a Robust, Pareto Optimal Geometry for a Welded Joint [PDF]
, 2014 Multi-criteria optimization problems are known to give rise to a set of Pareto optimal solutions where one solution cannot be regarded as being superior to another.
Barrans, Simon, Radhi, H.E.
core +1 more source