Using objective clustering for solving many-objective optimization problems (Q474392): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59026934, #quickstatements; #temporary_batch_1712688784189 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Evolutionary Algorithms for Solving Multi-Objective Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4023085 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Mutual information functions versus correlation functions. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding Groups in Data / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5701623 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Evolutionary Multi-Criterion Optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Tradeoff Cut Approach to Multiple Objective Optimization / rank | |||
Normal rank |
Latest revision as of 07:52, 9 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Using objective clustering for solving many-objective optimization problems |
scientific article |
Statements
Using objective clustering for solving many-objective optimization problems (English)
0 references
24 November 2014
0 references
Summary: Many-objective optimization problems involving a large number (more than four) of objectives have attracted considerable attention from the evolutionary multiobjective optimization field recently. With the increasing number of objectives, many-objective optimization problems may lead to stagnation in search process, high computational cost, increased dimensionality of Pareto-optimal front, and difficult visualization of the objective space. In this paper, a special kind of many-objective problems which has redundant objectives and which can be degenerated to a lower dimensional Pareto-optimal front has been investigated. Different from the works in the previous literatures, a novel metric, interdependence coefficient, which represents the nonlinear relationship between pairs of objectives, is introduced in this paper. In order to remove redundant objectives, PAM clustering algorithm is employed to identify redundant objectives by merging the less conflict objectives into the same cluster, and one of the least conflict objectives is removed. Furthermore, the potential of the proposed algorithm is demonstrated by a set of benchmark test problems scaled up to 20 objectives and a practical engineering design problem.
0 references