RT - Journal Article
T1 - An approach for optimization of multi- objective assignment problems with neutrosophic numbers
JF - IUST
YR - 2020
JO - IUST
VO - 31
IS - 2
UR - http://ijiepr.iust.ac.ir/article-1-890-en.html
SP - 287
EP - 294
K1 - Multi-objective assignment problem
K1 - Neutrosophic numbers
K1 - Membership functions
K1 - Weighting Tchebycheff problem
K1 - Optimal compromise neutrosophic solution
AB - This paper aims to study multi- objective assignment (NMOAS) problem with imprecise costs instead of its prices information. The NMOAS problem is considered by incorporating single valued trapezoidal neutrosophic numbers in the elements of cost matrices. After converting the NMOAS problem into the corresponding crisp multiobjective assignment (MOAS) problem based on the score function, an approach to find the most preferred neutrosophic solution is discussed. The approach is used through a weighting Tchebycheff problem which is applied by defining relative weights and ideal targets. The advantage of this approach is more flexible than the standard multi- objective assignment problem, where it allows the decision maker (DM) to choose the targets he is willing. Finally, a numerical example is given to illustrate the utility, effectiveness and applicability of the approach.
LA eng
UL http://ijiepr.iust.ac.ir/article-1-890-en.html
M3 10.22068/ijiepr.31.2.287
ER -