2016
DOI: 10.1109/tevc.2016.2564158
|View full text |Cite
|
Sign up to set email alerts
|

Minimum Manhattan Distance Approach to Multiple Criteria Decision Making in Multiobjective Optimization Problems

Abstract: Abstract-A minimum Manhattan distance (MMD) approach to multiple criteria decision making in multiobjective optimization problems (MOPs) is proposed. The approach selects the finial solution corresponding with a vector that has the MMD from a normalized ideal vector. This procedure is equivalent to the knee selection described by a divide and conquer approach that involves iterations of pairwise comparisons. Being able to systematically assign weighting coefficients to multiple criteria, the MMD approach is eq… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
40
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 113 publications
(40 citation statements)
references
References 42 publications
0
40
0
Order By: Relevance
“…Hence, in the absence of any preferences, the knee-point structures can be considered for further analysis. To this end, Minimum Manhattan Distance (MMD) approach has been selected, which is similar to Divide & Conquer approach to identify the knee-point solution, albeit MMD is computationally more efficient [67].…”
Section: Minimum Manhattan Distancementioning
confidence: 99%
“…Hence, in the absence of any preferences, the knee-point structures can be considered for further analysis. To this end, Minimum Manhattan Distance (MMD) approach has been selected, which is similar to Divide & Conquer approach to identify the knee-point solution, albeit MMD is computationally more efficient [67].…”
Section: Minimum Manhattan Distancementioning
confidence: 99%
“…In practice, the knee of the approximate Pareto front is often preferred for several reasons: it can achieve excellent overall system performance if the front is bent; it represents the solution closest to the ideal one that is not reachable; and it has rich geometrical and physical meanings [85], [86]. In Step 3, the knee solution is selected according to [87]:…”
Section: End Whilementioning
confidence: 99%
“…An exhaustive search of all possible term subsets to solve (19) is often intractable even for a moderate number of NARX terms 'n', as it requires the examination of 2 n term subsets/structures. Hence, it is clear that an effective search strategy is crucial to optimize the multi-objective structure selection problem given by (19). This can be accomplished by any multi-objective evolutionary algorithm such as NSGA-II [15], SPEA-II [16], MOEA/D [17] and others.…”
Section: B Multi-objective Structure Selectionmentioning
confidence: 99%
“…The comparative analysis of these algorithms on the structure selection problem in [18] indicates that NSGA-II often yields an improved Pareto front in comparison to SPEA-II and MOEA/D. Hence, in this study, NSGA-II is selected to solve the structure selection problem given in (19).…”
Section: B Multi-objective Structure Selectionmentioning
confidence: 99%
See 1 more Smart Citation