A Neutrosophic Compromise Programming Technique to Solve Multi-Objective Assignment Problem with T2TpFNs

Authors

  • Murshid Kamal Department of Statistics and Operations Research, Aligarh Muslim University, Aligarh- 202002, India
  • Prabhjot Kaur University Institute of Engineering and Technology, Panjab University, Chandigarh, India.
  • Irfan Ali Department of Statistics and Operations Research, Aligarh Muslim University, Aligarh- 202002, India
  • Aquil Ahmed Department of Statistics and Operations Research, Aligarh Muslim University, Aligarh- 202002, India

Keywords:

Multi-objective Optimization, Assignment Problem, Type-2 Fuzzy Logic, Neutrosophic Programming, Fuzzy Goal Programming, Intuitionistic Fuzzy Programming

Abstract

Multi-objective assignment problems (MOAPs) emerge in a wide range of real-world scenarios, from everyday activities to large-scale industrial operations. In this study, a MOAP with fuzzy parameters is investigated, and the fuzziness is represented by a Type-2 fuzzy logic system. Because the T2FLS is more efficient in dealing with the uncertainty of a decision-making process, the current problem's many parameters are represented by Type-2 trapezoidal fuzzy numbers
(T2TpFNs). T2TpFNs are first reduced to Type-1 fuzzy numbers, then to crisp numbers. Finally, the neutrosophic compromise programming technique (NCPT) is applied to produce a problem compromise solution. A numerical problem is used to demonstrate the validity and applicability of the NCPT for the current MOAP. Furthermore, a comparison of NCPT to other techniques such as FPT and IFPT shows its superiority.

Downloads

Download data is not yet available.

Downloads

Published

2022-08-01

Issue

Section

SI#1,2024: Neutrosophical Advancements And Their Impact on Research

How to Cite

Kamal, M. ., Kaur, P. ., Ali, I. ., & Ahmed, A. . (2022). A Neutrosophic Compromise Programming Technique to Solve Multi-Objective Assignment Problem with T2TpFNs. Neutrosophic Sets and Systems, 51, 172-204. https://fs.unm.edu/nss8/index.php/111/article/view/2558