یک مدل حمل و نقل چند منظوره در محیط نوتروسیفیک

In this paper, a new compromise algorithm for multi-objective transportation problem (MO-TP) is developed, which is inspired by Zimmermann's fuzzy programming and the neutrosophic set terminology. The proposed NCPA is characterized by assigning three membership functions for each objective namely, truth membership, indeterminacy membership and falsity membership. With the membership functions for all objectives, a neutrosophic compromise programming model is constructed with the aim to find best compromise solution (BCS). This model can cover a wide spectrum of BCSs by controlling the membership functions interactively. The performance of the NCPA is validated by measuring the ranking degree using TOPSIS approach. Illustrative examples are reported and compared with exists models in the literature. Based on the provided comparisons, NCPA is superior to fuzzy and different approaches.