Neutrosophy-based transportation problem and its solution approach
by Tuhin Bera; Nirmal Kumar Mahapatra
International Journal of Mathematics in Operational Research (IJMOR), Vol. 22, No. 2, 2022

Abstract: This study designs a transportation problem (Tp-problem) by taking the transportation cost, availabilities, demands and quantity of goods to be transported as single valued trapezoidal neutrosophic number (svtn-number). Then experts can include their hesitancy in decision making independently in an uncertain climate. The proposed form of Tp-problem is solved in four distinct methods, and optimality test of their initial outcomes are performed. The respective algorithms are developed with the help of existing crisp notions. A parameter-based linear ranking function of svtn-number is drawn here. This parameter of ranking function helps to incorporate the relevant characters involved indirectly in a Tp-problem beside the provided constraints in its solution approach. The way of treatment of uncertainty and the incorporation of relevant character in a Tp-problem designed here make its outcome more realistic and acceptable to the experts. The efficiencies of proposed concepts are tested in real ground. The optimal values are analysed to opt the better method applicable for that problem.

Online publication date: Mon, 11-Jul-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com