Results 21 to 30 of about 190,364 (297)
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2018 The robust design optimization (RDO) problem is generally formulated as a weighted sum of the nominal objective function and the robust term. In the RDO problem, a deterministic optimum design is regarded as one of the local optima.
Makoto ITO, Nozomu KOGISO, Taku HASEGAWA
doaj +1 more source
Topology of Pareto Sets of Strongly Convex Problems [PDF]
SIAM Journal on Optimization, 2020 21 pages. Remarks 4.4 and 4.5 are added. A new application is given in section 5.3.
Naoki Hamada +4 more
openaire +3 more sources
Application of reduced-set pareto-lipschitzian optimization to truss optimization [PDF]
, 2015 In this paper, a recently proposed global Lipschitz optimization algorithm Pareto-Lipschitzian Optimization with Reduced-set (PLOR) is further developed, investigated and applied to truss optimization problems.
Mockus, J +4 more
core +1 more source
Data-driven analysis of pareto set topology [PDF]
Proceedings of the Genetic and Evolutionary Computation Conference, 2018 8 pages, accepted at GECCO'18 as a full ...
Naoki Hamada, Keisuke Goto 0001
openaire +2 more sources
Frontiers in Energy Research, 2022 Based on summarizing and analyzing the typical applications of energy storage, the study established a model for an active distribution network, and analyzed the technical and economic benefits of its access to the distribution network.
Huiling Qin, Kui Li, Zhijun Chen
doaj +1 more source
Two Objective Public Service System Design Problem
Communications, 2021 The public service system serves population spread over a geographical area from a given number of service centers. One of the possible approaches to the problem with two or more simultaneously applied contradicting objectives is ...
Jaroslav Janáček +3 more
doaj +1 more source
Local Optimal Sets and Bounded Archiving on Multi-objective NK-Landscapes with Correlated Objectives [PDF]
, 2014 The properties of local optimal solutions in multi-objective combinatorial optimization problems are crucial for the effectiveness of local search algorithms, particularly when these algorithms are based on Pareto dominance.
E. Zitzler +11 more
core +5 more sources
A PROPERTY OF BICRITERIA AFFINE VECTOR VARIATIONAL INEQUALITIES
Tạp chí Khoa học Đại học Đà Lạt, 2012 By a scalarization method, it is proved that both the Pareto solution set and the weak Pareto solution set of a bicriteria affine vector variational inequality have finitely many connected. components provided that a regularity condition is satisfied. An
Nguyễn Thị Thu Hương +3 more
doaj +1 more source
Reduction of the Pareto Set in Bicriteria Asymmetric Traveling Salesman Problem
, 2018 We consider the bicriteria asymmetric traveling salesman problem (bi-ATSP). Optimal solution to a multicriteria problem is usually supposed to be the Pareto set, which is rather wide in real-world problems.
Kovalenko, Yulia V. +1 more
core +1 more source
Journal of Telecommunications and Information Technology, 2003 Multiple criteria evolutionary algorithms, being essentially parallel in their character, are a natural instrument of finding a representation of entire Pareto set (set of solutions and outcomes non-dominated in criteria space) for vector optimisation ...
Marcin Szczepański +1 more
doaj +1 more source