Economics at your fingertips  

Neutrosophic compromise programming approach for multiobjective nonlinear transportation problem with supply and demand following the exponential distribution

Ahmad Yusuf Adhami (), Mohd Faizan () and Anas M ()

Operations Research and Decisions, 2022, vol. 32, issue 3, 1-15

Abstract: Decision-making is a tedious and complex process. In the present competitive scenario, any incorrect decision may excessively harm an organization. Therefore, the parameters involved in the decision-making process should be looked into carefully as they may not always be of a deterministic nature. In the present study, a multiobjective nonlinear transportation problem is formulated, wherein the parameters involved in the objective functions are assumed to be fuzzy and both supply and demand are stochastic. Supply and demand are assumed to follow the exponential distribution. After converting the problem into an equivalent deterministic form, the multiobjective problem is solved using a neutrosophic compromise programming approach. A comparative study indicates that the proposed approach provides the best compromise solution, which is significantly better than the one obtained using the fuzzy programming approach.

Keywords: fuzzy approach; multiobjective optimization; supply chain; transportation; uncertainty (search for similar items in EconPapers)
Date: 2022
References: Add references at CitEc
Citations: Track citations by RSS feed

Downloads: (external link) (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link:

DOI: 10.37190/ord220301

Access Statistics for this article

More articles in Operations Research and Decisions from Wroclaw University of Science and Technology, Faculty of Management Contact information at EDIRC.
Bibliographic data for series maintained by Adam Kasperski ().

Page updated 2023-02-09
Handle: RePEc:wut:journl:v:32:y:2022:i:3:p:1-15:id:1