An approach for optimization of multi- objective assignment problems with neutrosophic numbers

Khalifa, Hamiden

doi:10.22068/ijiepr.31.2.287

Volume 31, Issue 2 (IJIEPR 2020) IJIEPR 2020, 31(2): 287-294 | Back to browse issues page

‎ 10.22068/ijiepr.31.2.287

Mendeley

Zotero

RefWorks

Khalifa H. An approach for optimization of multi- objective assignment problems with neutrosophic numbers. IJIEPR 2020; 31 (2) :287-294
URL: http://ijiepr.iust.ac.ir/article-1-890-en.html

An approach for optimization of multi- objective assignment problems with neutrosophic numbers

Hamiden Khalifa

Cairo University , hamiden_2008@yahoo.com

Abstract: (3134 Views)

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.

Keywords: Multi-objective assignment problem, Neutrosophic numbers, Membership functions, Weighting Tchebycheff problem, Optimal compromise neutrosophic solution

Full-Text [PDF 600 kb] (1490 Downloads)

Type of Study: Research | Subject: Operations Research
Received: 2019/03/16 | Accepted: 2020/04/25 | Published: 2020/06/27