# Modified Approach for Optimization of Real Life Transportation Problem in Neutrosophic Environment

Authors: Akanksha Singh; Amit Kumar; S. S. Appadoo
Journal: Mathematical Problems in Engineering
 (2017)

---

## Abstract

To the best of our knowledge, there is only one approach for solving neutrosophic cost minimization transportation problems. Since neutrosophic transportation problems are a new area of research, other researchers may be attracted to extend this approach for solving other types of neutrosophic transportation problems like neutrosophic solid transportation problems, neutrosophic time minimization transportation problems, neutrosophic transshipment problems, and so on. However, after a deep study of the existing approach, it is noticed that a mathematical incorrect assumption has been used in these existing approaches; therefore there is a need to modify these existing approaches. Keeping the same in mind, in this paper, the existing approach is modified. Furthermore, the exact results of some existing transportation problems are obtained by the modified approach.


---

## Body

## 1. Introduction

In daily life problems several times there is a need to transport the product from various sources to different destinations. To find a way to transport the product in such a manner so that the total transportation cost is minimum is called the optimal way and the problem is called cost minimization transportation problems [1]. Different methods have been proposed in the literature to find the optimal way of such cost minimization transportation problems in which cost for transporting unit quantity of the product, availability of the product at the sources, and demand of the product at the destinations are represented as real numbers.However, to assume these parameters as real numbers is not always valid according to real life situations; for example, the transportation cost depends upon the circumstances like price of petrol/diesel, weather, travel time, traffic jam, and so on. Similarly, availability of crops varies according to the monsoon, fertilizers, chemicals, and so on; demands of the various clothes depend on the season, fashion trends, discount offers, and so on. Furthermore, the opinions of the experts about these parameters indicate that they cannot always be represented as real numbers; for example, generally experts provide their opinion about these parameters in terms of linguistic variables like high, very high, low, very low, and so on.Being one of the widely adopted ways in the literature, to deal with such situations is to represent these parameters as fuzzy numbers [2] and its extensions [3]. Thamaraiselvi and Santhi [4] pointed out that neutrosophic set [5], one of the extensions of fuzzy set, is used in different research areas. However, till now no one has used the neutrosophic set in transportation problems, while several researchers have used fuzzy numbers for representing various parameters of transportation problems [6–14]. Therefore, Thamaraiselvi and Santhi [4] proposed the approaches for solving neutrosophic transportation problem of Type I (transportation problem in which cost for transporting unit quantity of the product is represented as trapezoidal neutrosophic number, whereas availability and demands are represented as real numbers) and neutrosophic transportation problem of Type II (transportation problem in which cost for transporting unit quantity of the product, availability of a product, and demand of the product are represented as trapezoidal neutrosophic numbers).Since neutrosophic transportation problems are new area of research, others may be attracted to extend these approaches for solving other types of neutrosophic transportation problems like neutrosophic solid transportation problems, neutrosophic time minimization transportation problems, neutrosophic transshipment problems, and so on. However, after a deep study of these existing approaches, it is noticed that a mathematical incorrect assumption has been used in these existing approaches; therefore there is a need to modify these existing approaches. Keeping the same in mind, in this paper, these existing approaches are modified. Furthermore, the exact results of some existing transportation problems are obtained by the modified approaches.


## 2. A Brief Review of Thamaraiselvi and Santhi Approaches

To point out the mathematical incorrect assumptions in the approaches, proposed by Thamaraiselvi and Santhi [4], there is a need to describe these approaches. Therefore, in this section, a brief review of the approaches, proposed by the Thamaraiselvi and Santhi [4], for solving both types of neutrosophic transportation problems is discussed in a brief manner.


### 2.1. Thamaraiselvi and Santhi Approach for Solving Neutrosophic Transportation Problem of Type I

Using the approach, proposed by Thamaraiselvi and Santhi [4], the optimal solution of a neutrosophic transportation problem of Type I can be obtained as follows.Step 1.
Formulate the neutrosophic transportation problem as a neutrosophic linear programming problemP1.P1Minimize∑i=0m∑j=0nc~ijNxijSubject  to∑j=0nxij=ai,i=1,2,…,m,∑i=0nxij=bj,j=1,2,…,n,xij≥0,∀i,j,where xij is the number of units of the product transported from ith source to jth destination,c~ijN is the neutrosophic cost of one unit quantity transported from ith source to jth destination,ai is the total availability of the product at the source i,bj is the total demand of the product at the destination j.Step 2.
Transform the neutrosophic linear programming problemP1 into its equivalent crisp linear programming problem P2.P2MinimizeS∑i=0m∑j=0nc~ijNxijSubject  toConstraints  of  problemP1,where(1)Sa~N=Sa1,a2,a3,a4,μa~,νa~,λa~=116a1+a2+a3+a4μa~+1-νa~+1-λa~.Step 3.
Transform the crisp linear programming problemP2 into its equivalent crisp linear programming problem P3.P3Minimize∑i=1m∑j=1nSc~ijNxijSubject  toConstraints  of  problemP1.Step 4.
Represent the crisp linear programming problemP3 into tabular form shown in Table 1.Table 1
Tabular representation of transformed crisp transportation problem.
Sources
Destinations
Supply
D
1
D
2
D
3
…
D
n
S
1
S
(
c
~
11
N
)
S
(
c
~
12
N
)
S
(
c
~
13
N
)
…
S
(
c
~
1
n
N
)
a1
S
2
S
(
c
~
21
N
)
S
(
c
~
22
N
)
S
(
c
~
23
N
)
…
S
(
c
~
2
n
N
)
a
2
S
3
S
(
c
~
31
N
)
S
(
c
~
32
N
)
S
(
c
~
33
N
)
…
S
(
c
~
3
n
N
)
a
3
⋮
⋮
⋮
⋮
⋮
⋮
⋮
S
m
S
(
c
~
m
1
N
)
S
(
c
~
m
2
N
)
S
(
c
~
m
3
N
)
…
S
(
c
~
m
n
N
)
a
m
Demand
b
1
b
2
b
3
…
b
nStep 5.
Find the crisp optimal solutionsxij of crisp transportation problem presented in Table 1.Step 6.
Find the total minimum neutrosophic transportation cost by putting the optimal solutionxij, obtained from Step 5, in ∑i=1m∑j=1nc~ijNxij.


### 2.2. Thamaraiselvi and Santhi Approach for Solving Neutrosophic Transportation Problem of Type II

Using the approach, proposed by Thamaraiselvi and Santhi [4], the optimal solution of a neutrosophic transportation problem of Type II can be obtained as follows.Step 1.
Formulate the neutrosophic transportation problem as a neutrosophic linear programming problemP4.P4Minimize∑i=0m∑j=0nc~ijNx~ijNSubject  to∑j=0nx~ijN=a~iN,i=1,2,…,m,∑i=0mx~ijN=b~jN,j=1,2,…,n,x~ijN≥0,∀i,j.Step 2.
Transform the neutrosophic linear programming problemP4 into its equivalent neutrosophic linear programming problem P5.P5MinimizeS∑i=1m∑j=1nc~ijNx~ijNSubject  toConstraints  of  problemP4.Step 3.
Transform the neutrosophic linear programming problemP5 into its equivalent neutrosophic linear programming problem P6.P6Minimize∑i=1m∑j=1nSc~ijNx~ijNSubject  toConstraints  of  problemP4.Step 4.
Represent the neutrosophic linear programming problemP6 into tabular form shown in Table 2.Table 2
Tabular representation of neutrosophic transportation problem of Type II.
Sources
Destinations
Supply
D
1
D
2
D
3
…
D
n
S
1
S
(
c
~
11
N
)
S
(
c
~
12
N
)
S
(
c
~
13
N
)
…
S
(
c
~
1
n
N
)
a
~
1
N
S
2
S
(
c
~
21
N
)
S
(
c
~
22
N
)
S
(
c
~
23
N
)
…
S
(
c
~
2
n
N
)
a
~
2
N
S
3
S
(
c
~
31
N
)
S
(
c
~
32
N
)
S
(
c
~
33
N
)
…
S
(
c
~
3
n
N
)
a
~
3
N
⋮
⋮
⋮
⋮
⋮
⋮
⋮
S
m
S
(
c
~
m
1
N
)
S
(
c
~
m
2
N
)
S
(
c
~
m
3
N
)
…
S
(
c
~
m
n
N
)
a
~
m
N
Demand
b
~
1
N
b
~
2
N
b
~
3
N
…
b
~
n
NStep 5.
Find the neutrosophic optimal solutionx~ijN of transportation problem presented in Table 2.Step 6.
Find the total minimum neutrosophic transportation cost by putting the optimal solutionx~ijN, obtained in Step 3, in ∑i=1m∑j=1nc~ijNx~ijN.


## 2.1. Thamaraiselvi and Santhi Approach for Solving Neutrosophic Transportation Problem of Type I

Using the approach, proposed by Thamaraiselvi and Santhi [4], the optimal solution of a neutrosophic transportation problem of Type I can be obtained as follows.Step 1.
Formulate the neutrosophic transportation problem as a neutrosophic linear programming problemP1.P1Minimize∑i=0m∑j=0nc~ijNxijSubject  to∑j=0nxij=ai,i=1,2,…,m,∑i=0nxij=bj,j=1,2,…,n,xij≥0,∀i,j,where xij is the number of units of the product transported from ith source to jth destination,c~ijN is the neutrosophic cost of one unit quantity transported from ith source to jth destination,ai is the total availability of the product at the source i,bj is the total demand of the product at the destination j.Step 2.
Transform the neutrosophic linear programming problemP1 into its equivalent crisp linear programming problem P2.P2MinimizeS∑i=0m∑j=0nc~ijNxijSubject  toConstraints  of  problemP1,where(1)Sa~N=Sa1,a2,a3,a4,μa~,νa~,λa~=116a1+a2+a3+a4μa~+1-νa~+1-λa~.Step 3.
Transform the crisp linear programming problemP2 into its equivalent crisp linear programming problem P3.P3Minimize∑i=1m∑j=1nSc~ijNxijSubject  toConstraints  of  problemP1.Step 4.
Represent the crisp linear programming problemP3 into tabular form shown in Table 1.Table 1
Tabular representation of transformed crisp transportation problem.
Sources
Destinations
Supply
D
1
D
2
D
3
…
D
n
S
1
S
(
c
~
11
N
)
S
(
c
~
12
N
)
S
(
c
~
13
N
)
…
S
(
c
~
1
n
N
)
a1
S
2
S
(
c
~
21
N
)
S
(
c
~
22
N
)
S
(
c
~
23
N
)
…
S
(
c
~
2
n
N
)
a
2
S
3
S
(
c
~
31
N
)
S
(
c
~
32
N
)
S
(
c
~
33
N
)
…
S
(
c
~
3
n
N
)
a
3
⋮
⋮
⋮
⋮
⋮
⋮
⋮
S
m
S
(
c
~
m
1
N
)
S
(
c
~
m
2
N
)
S
(
c
~
m
3
N
)
…
S
(
c
~
m
n
N
)
a
m
Demand
b
1
b
2
b
3
…
b
nStep 5.
Find the crisp optimal solutionsxij of crisp transportation problem presented in Table 1.Step 6.
Find the total minimum neutrosophic transportation cost by putting the optimal solutionxij, obtained from Step 5, in ∑i=1m∑j=1nc~ijNxij.


## 2.2. Thamaraiselvi and Santhi Approach for Solving Neutrosophic Transportation Problem of Type II

Using the approach, proposed by Thamaraiselvi and Santhi [4], the optimal solution of a neutrosophic transportation problem of Type II can be obtained as follows.Step 1.
Formulate the neutrosophic transportation problem as a neutrosophic linear programming problemP4.P4Minimize∑i=0m∑j=0nc~ijNx~ijNSubject  to∑j=0nx~ijN=a~iN,i=1,2,…,m,∑i=0mx~ijN=b~jN,j=1,2,…,n,x~ijN≥0,∀i,j.Step 2.
Transform the neutrosophic linear programming problemP4 into its equivalent neutrosophic linear programming problem P5.P5MinimizeS∑i=1m∑j=1nc~ijNx~ijNSubject  toConstraints  of  problemP4.Step 3.
Transform the neutrosophic linear programming problemP5 into its equivalent neutrosophic linear programming problem P6.P6Minimize∑i=1m∑j=1nSc~ijNx~ijNSubject  toConstraints  of  problemP4.Step 4.
Represent the neutrosophic linear programming problemP6 into tabular form shown in Table 2.Table 2
Tabular representation of neutrosophic transportation problem of Type II.
Sources
Destinations
Supply
D
1
D
2
D
3
…
D
n
S
1
S
(
c
~
11
N
)
S
(
c
~
12
N
)
S
(
c
~
13
N
)
…
S
(
c
~
1
n
N
)
a
~
1
N
S
2
S
(
c
~
21
N
)
S
(
c
~
22
N
)
S
(
c
~
23
N
)
…
S
(
c
~
2
n
N
)
a
~
2
N
S
3
S
(
c
~
31
N
)
S
(
c
~
32
N
)
S
(
c
~
33
N
)
…
S
(
c
~
3
n
N
)
a
~
3
N
⋮
⋮
⋮
⋮
⋮
⋮
⋮
S
m
S
(
c
~
m
1
N
)
S
(
c
~
m
2
N
)
S
(
c
~
m
3
N
)
…
S
(
c
~
m
n
N
)
a
~
m
N
Demand
b
~
1
N
b
~
2
N
b
~
3
N
…
b
~
n
NStep 5.
Find the neutrosophic optimal solutionx~ijN of transportation problem presented in Table 2.Step 6.
Find the total minimum neutrosophic transportation cost by putting the optimal solutionx~ijN, obtained in Step 3, in ∑i=1m∑j=1nc~ijNx~ijN.


## 3. Mathematical Incorrect Assumption Considered in Thamaraiselvi and Santhi Approaches

In this section, the mathematical incorrect assumption, considered in Thamaraiselvi and Santhi approaches [4], is pointed out.It is obvious from Steps2 and 3 of the first approach, presented in Section 2.1, that Thamaraiselvi and Santhi [4] have assumed that the neutrosophic linear programming problem P2 can be transformed into neutrosophic linear programming problem P3. Similarly, it is obvious from Steps 2 and 3 of the second approach, presented in Section 2.2, that Thamaraiselvi and Santhi [4] have assumed that the neutrosophic linear programming problem P5 can be transformed into neutrosophic linear programming problem P6.It is pertinent to mention that, to transform the problemP2 into P3 as well as P5 into P6, Thamaraiselvi and Santhi [4] have considered that ∑i=0m∑j=0nc~ijNxij=∑i=1m∑j=1nSc~ijNxij; that is, Thamaraiselvi and Santhi [4] have considered the assumption that if a~N=a1,a2,a3,a4,μa~,νa~,λa~ and b~N=b1,b2,b3,b4,μa~,νa~,λa~ are two trapezoidal neutrosophic numbers, then(2)Sa~N+b~N=Sa~N+Sb~N.However, the following example clearly indicates that (3)Sa~N+b~N≠Sa~N+Sb~N.Leta~N=2,4,6,8;0.1,0.2,0.3 and b~N=3,6,9,12;0.4,0.5,0.6 be two trapezoidal neutrosophic numbers; then according to existing result [4, Def. 10, pp. 4](4)a~N+b~N=2,4,6,8;0.1,0.2,0.3+3,6,9,12;0.4,0.5,0.6=5,10,15,20;0.1,0.5,0.6.Furthermore, using the existing result [4, Def. 11, pp. 4](5)Sa~N+b~N=1165+10+15+200.1+0.5+0.4=3.125,while (6)Sa~N+Sb~N=1162+4+6+80.1+0.8+0.7+1163+6+9+120.4+0.5+0.4=2+2.4375=4.4375.It is obvious that(7)Sa~N+b~N≠Sa~N+Sb~N.Hence, the approaches for solving neutrosophic transportation problem, proposed by Thamaraiselvi and Santhi [4], are not valid.


## 4. An important Result

It is obvious from Section3 that, to modify the existing approaches [4], there is a need to find the exact relation between S(∑i=1nai) and ∑i=1nS(ai). Therefore, in this section, the exact relation between S(∑i=1nai) and ∑i=1nS(ai) is obtained.Leta~N=a1,a2,a3,a4,μa~,νa~,λa~ and b~N=b1,b2,b3,b4,μa~,νa~,λa~ be two trapezoidal neutrosophic numbers; then using the existing arithmetic operations [4, Def. 10, pp. 4] ∑i=1na~N=∑i=1nai1,∑i=1nai2,∑i=1nai3,∑i=1nai4;min1≤i≤n⁡(μai), max1≤i≤n⁡(νai),max1≤i≤n⁡(λai), and using the existing results [4, Def. 12, pp. 4],(8)S∑i=1na~N=S∑i=1nai1,∑i=1nai2,∑i=1nai3,∑i=1nai4;min1≤i≤n⁡μai⁡,max1≤i≤n⁡νai,⁡max1≤i≤n⁡λai=116∑i=1nai1+∑i=1nai2+∑i=1nai3+∑i=1nai4min1≤i≤nμai+1-max1≤i≤nνai⁡+1-max1≤i≤n⁡λai.Furthermore, using the existing results [4, Def. 12, pp. 4],(9)Sai=116ai1+ai2+ai3+ai4μai⁡+1-νai+1-λai.From (8) and (9),(10)S∑i=1na~N=min1≤i≤n⁡μai⁡+max1≤i≤n⁡1-νai+max1≤i≤n⁡1-λai∑i=1nSa~iNμai⁡+1-νai+1-λai.


## 5. Modified Approach for Solving Neutrosophic Transportation Problems

In this section, to resolve the flaws of the existing approaches, pointed out in Section3, the existing approaches [4] are modified.


### 5.1. Modified Approaches for Solving Neutrosophic Transportation Problem of Type I

In this section, the existing approach is modified to solve neutrosophic transportation problem of Type I.The steps of the modified approach are as follows.Step 1.
Use Steps1 and 2 of the existing approach [4] to obtain the problem P2.Step 2.
Using the relation, obtained in Section4, transform the problem P2 into its equivalent neutrosophic linear programming problem P7.P7Minimize∑i=1m∑j=1nMc~ijNxijSubject  toConstraints  of  problemP1,where(11)Mc~ijN=min1≤i≤n⁡μc~ijN⁡+max1≤i≤n⁡1-νc~ijN+max1≤i≤n⁡1-λc~ijN∑i=1m∑j=1nSc~ijNxijμc~ijN⁡+1-νc~ijN⁡+1-λc~ijN.Step 3.
Represent the neutrosophic linear programming problemP7 into tabular form as shown in Table 3.Table 3
Tabular representation of transformed crisp transportation problem.
Sources
Destinations
Supply
D
1
D
2
D
3
…
D
n
S
1
M
(
c
~
11
N
)
M
(
c
~
12
N
)
M
(
c
~
13
N
)
…
M
(
c
~
1
n
N
)
a
1
S
2
M
(
c
~
21
N
)
M
(
c
~
22
N
)
M
(
c
~
23
N
)
…
M
(
c
~
2
n
N
)
a
2
S
3
M
(
c
~
31
N
)
M
(
c
~
32
N
)
M
(
c
~
33
N
)
…
M
(
c
~
3
n
N
)
a
3
⋮
⋮
⋮
⋮
⋮
⋮
⋮
S
m
M
(
c
~
m
1
N
)
M
(
c
~
m
2
N
)
M
(
c
~
m
3
N
)
…
M
(
c
~
m
n
N
)
a
m
Demand
b
1
b
2
b
3
…
b
nStep 4.
Find the crisp optimal solutionsxij of crisp transportation problem presented in Table 3.Step 5.
Find the total minimum neutrosophic transportation cost by putting the optimal solutionxij, obtained from Step 4, in ∑i=1m∑j=1nc~ijNxij.


### 5.2. Modified Approach for Solving Neutrosophic Transportation Problem of Type II

In this section, the existing approach is modified to solve neutrosophic transportation problem of Type II.The steps of the modified approach are as follows.Step 1.
Use Steps1 and 2 of the existing approach to obtain problem P5.Step 2.
Using the relation, obtained in Section4, transform the problem P5 into problem P8P8MinimizeS∑i=1m∑j=1nMc~ijNx~ijNSubject  toConstraints  of  problemP4.Step 3.
Represent the neutrosophic linear programming problemP8 into tabular form as shown in Table 4.Table 4
Tabular representation of neutrosophic transportation problem of Type II.
Sources
Destinations
Supply
D
1
D
2
D
3
…
D
n
S
1
M
(
c
~
11
N
)
M
(
c
~
12
N
)
M
(
c
~
13
N
)
…
M
(
c
~
1
n
N
)
a
~
1
N
S
2
M
(
c
~
21
N
)
M
(
c
~
22
N
)
M
(
c
~
23
N
)
…
M
(
c
~
2
n
N
)
a
~
2
N
S
3
M
(
c
~
31
N
)
M
(
c
~
32
N
)
M
(
c
~
33
N
)
…
M
(
c
~
3
n
N
)
a
~
3
N
⋮
⋮
⋮
⋮
⋮
⋮
⋮
S
m
M
(
c
~
m
1
N
)
M
(
c
~
m
2
N
)
M
(
c
~
m
3
N
)
…
M
(
c
~
m
n
N
)
a
~
m
N
Demand
b
~
1
N
b
~
2
N
b
~
3
N
…
b
~
n
NStep 4.
Find the neutrosophic optimal solutionx~ijN of neutrosophic transportation problem presented in Table 4.Step 5.
Find the total minimum neutrosophic transportation cost by putting the optimal solutionx~ijN, obtained in Step 4, in ∑i=1m∑j=1nc~ijNx~ijN.


## 5.1. Modified Approaches for Solving Neutrosophic Transportation Problem of Type I

In this section, the existing approach is modified to solve neutrosophic transportation problem of Type I.The steps of the modified approach are as follows.Step 1.
Use Steps1 and 2 of the existing approach [4] to obtain the problem P2.Step 2.
Using the relation, obtained in Section4, transform the problem P2 into its equivalent neutrosophic linear programming problem P7.P7Minimize∑i=1m∑j=1nMc~ijNxijSubject  toConstraints  of  problemP1,where(11)Mc~ijN=min1≤i≤n⁡μc~ijN⁡+max1≤i≤n⁡1-νc~ijN+max1≤i≤n⁡1-λc~ijN∑i=1m∑j=1nSc~ijNxijμc~ijN⁡+1-νc~ijN⁡+1-λc~ijN.Step 3.
Represent the neutrosophic linear programming problemP7 into tabular form as shown in Table 3.Table 3
Tabular representation of transformed crisp transportation problem.
Sources
Destinations
Supply
D
1
D
2
D
3
…
D
n
S
1
M
(
c
~
11
N
)
M
(
c
~
12
N
)
M
(
c
~
13
N
)
…
M
(
c
~
1
n
N
)
a
1
S
2
M
(
c
~
21
N
)
M
(
c
~
22
N
)
M
(
c
~
23
N
)
…
M
(
c
~
2
n
N
)
a
2
S
3
M
(
c
~
31
N
)
M
(
c
~
32
N
)
M
(
c
~
33
N
)
…
M
(
c
~
3
n
N
)
a
3
⋮
⋮
⋮
⋮
⋮
⋮
⋮
S
m
M
(
c
~
m
1
N
)
M
(
c
~
m
2
N
)
M
(
c
~
m
3
N
)
…
M
(
c
~
m
n
N
)
a
m
Demand
b
1
b
2
b
3
…
b
nStep 4.
Find the crisp optimal solutionsxij of crisp transportation problem presented in Table 3.Step 5.
Find the total minimum neutrosophic transportation cost by putting the optimal solutionxij, obtained from Step 4, in ∑i=1m∑j=1nc~ijNxij.


## 5.2. Modified Approach for Solving Neutrosophic Transportation Problem of Type II

In this section, the existing approach is modified to solve neutrosophic transportation problem of Type II.The steps of the modified approach are as follows.Step 1.
Use Steps1 and 2 of the existing approach to obtain problem P5.Step 2.
Using the relation, obtained in Section4, transform the problem P5 into problem P8P8MinimizeS∑i=1m∑j=1nMc~ijNx~ijNSubject  toConstraints  of  problemP4.Step 3.
Represent the neutrosophic linear programming problemP8 into tabular form as shown in Table 4.Table 4
Tabular representation of neutrosophic transportation problem of Type II.
Sources
Destinations
Supply
D
1
D
2
D
3
…
D
n
S
1
M
(
c
~
11
N
)
M
(
c
~
12
N
)
M
(
c
~
13
N
)
…
M
(
c
~
1
n
N
)
a
~
1
N
S
2
M
(
c
~
21
N
)
M
(
c
~
22
N
)
M
(
c
~
23
N
)
…
M
(
c
~
2
n
N
)
a
~
2
N
S
3
M
(
c
~
31
N
)
M
(
c
~
32
N
)
M
(
c
~
33
N
)
…
M
(
c
~
3
n
N
)
a
~
3
N
⋮
⋮
⋮
⋮
⋮
⋮
⋮
S
m
M
(
c
~
m
1
N
)
M
(
c
~
m
2
N
)
M
(
c
~
m
3
N
)
…
M
(
c
~
m
n
N
)
a
~
m
N
Demand
b
~
1
N
b
~
2
N
b
~
3
N
…
b
~
n
NStep 4.
Find the neutrosophic optimal solutionx~ijN of neutrosophic transportation problem presented in Table 4.Step 5.
Find the total minimum neutrosophic transportation cost by putting the optimal solutionx~ijN, obtained in Step 4, in ∑i=1m∑j=1nc~ijNx~ijN.


## 6. Exact Solution of Numerical Problems

Thamaraiselvi and Santhi [4] solved a neutrosophic transportation problem of Type I and Type II to illustrate their proposed approaches. However as discussed in Section 3 that Thamaraiselvi and Santhi [4] have used some mathematical incorrect assumptions in their proposed approaches, the optimal solution of these problems, obtained by Thamaraiselvi and Santhi [4], is not exact. In this section, the exact solution of these problems is obtained by modified approaches.


### 6.1. Exact Solution of Neutrosophic Transportation Problem of Type I

Thamaraiselvi and Santhi [4] solved the neutrosophic transportation problem of Type I, presented in Table 5, by their proposed approach.Table 5
Input data for neutrosophic transportation problem.
D
1
D
2
D
3
D
4
Supply
O
1
3,5
,
6,8
;
0.6,0.5,0.4
5,8
,
10,14
;
0.3,0.6,0.6
12,15,19,22
;
0.6,0.4,0.5
14,17,21,28
;
0.8,0.2,0.6
26
O
2
0,1
,
3,6
;
0.7,0.5,0.3
5,7
,
9,11
;
0.9,0.7,0.5
15,17,19,22
;
0.4,0.8,0.4
9,11,14,16
;
0.5,0.4,0.7
24
O
3
4,8
,
11,15
;
0.6,0.3,0.2
1,3
,
4,6
;
0.6,0.3,0.5
5,7
,
8,10
;
0.5,0.4,0.7
5,9
,
14,19
;
0.3,0.7,0.6
30
Demand
17
23
28
12In this section the exact solution of this problem is obtained by the modified approach. Using the modified approach the exact solution of neutrosophic transportation problem of Type I, presented in Table5, can be obtained as follows.Step 1.
Using Steps1 to 3 of the modified approach the neutrosophic transportation problem, presented in Table 5, can be transformed into crisp transportation problem (presented in Table 6).Table 6
Crisp transportation problem.
D
1
D
2
D
3
D
4
Supply
O
1
3
4
8
9
26
O
2
1
4
8
6
24
O
3
4
2
3
5
30
Demand
17
23
28
12Step 2.
When solving the crisp transportation problem (Table6), the obtained optimal solution is (12)x12=23,x14=3,x21=17,x24=7,x33=28,x34=2.Step 3.
Using the optimal solution, the minimum total neutrosophic cost is(13)MinimizeZ~N=∑i=03∑j=04xijc~ijN=235,8,10,14;0.3,0.8,0.7+314,17,21,28;0.3,0.8,0.7+170,1,3,6;0.3,0.8,0.7+79,11,14,16;0.3,0.8,0.7+285,7,8,10;0.3,0.8,0.7+25,9,14,19;0.3,0.8,0.7=370,543,694,938;0.3,0.8,0.7.


### 6.2. Exact Solution of Neutrosophic Transportation Problem of Type II

Thamaraiselvi and Santhi [4] solved the neutrosophic transportation problem of Type II, presented in Table 7, by their proposed approach.Table 7
Input data for neutrosophic transportation problem.
D
1
D
2
D
3
D
4
Supply
O
1
3,5
,
6,8
;
0.6,0.5,0.4
5,8
,
10,14
;
0.3,0.6,0.6
12,15,19,22
;
0.6,0.4,0.5
14,17,21,28
;
0.8,0.2,0.6
22,26,28,32
;
0.7,0.3,0.4
O
2
0,1
,
3,6
;
0.7,0.5,0.3
5,7
,
9,11
;
0.9,0.7,0.5
15,17,19,22
;
0.4,0.8,0.4
9,11,14,16
;
0.5,0.4,0.7
17,22,27,31
;
0.6,0.4,0.5
O
3
4,8
,
11,15
;
0.6,0.3,0.2
1,3
,
4,6
;
0.6,0.3,0.5
5,7
,
8,10
;
0.5,0.4,0.7
5,9
,
14,19
;
0.3,0.7,0.6
21,28,32,37
;
0.8,0.2,0.4
Demand
13,16,18,21
;
0.5,0.5,0.6
17,21,24,28
;
0.8,0.2,0.4
24,29,32,35
;
0.9,0.5,0.3
6,10,13,15
;
0.7,0.3,0.4In this section, the exact solution of this problem is obtained by the modified approach. Using the modified approach the exact solution of neutrosophic transportation problem of Type II, presented in Table7, can be obtained as follows.Step 1.
Using Steps1 to 3 of the modified approach the neutrosophic transportation problem presented in Table 7 can be transformed into neutrosophic transportation problem (presented in Table 8).Table 8
Neutrosophic transportation problem with crisp cost.
D
1
D
2
D
3
D
4
Supply
O
1
1
2
3
4
22,26,28,32
;
0.7,0.3,0.4
O
2
1
2
4
3
17,22,27,31
;
0.6,0.4,0.5
O
3
2
1
2
2
21,28,32,37
;
0.8,0.2,0.4
Demand
13,16,18,21
;
0.5,0.5,0.6
17,21,24,28
;
0.8,0.2,0.4
24,29,32,35
;
0.9,0.5,0.3
6,10,13,15
;
0.7,0.3,0.4Step 2.
When solving the neutrosophic transportation problem with crisp cost (Table8), the obtained optimal solution is (14)x~11N=-6,2,7,11;0.7,0.3,0.4,x~12N=17,21,24,28;0.8,0.2,0.4,x~21N=2,9,16,27;0.5,0.5,0.6,x~24N=-10,6,18,29;0.5,0.5,0.6,x~33N=24,29,32,35;0.9,0.5,0.3,x~34N=-14,-4,3,13;0.8,0.5,0.4.Step 3.
Using the optimal solution the minimum total neutrosophic cost is(15)MinimizeZ~N=∑i=03∑j=04x~ijNc~ijN=-6,2,7,11;0.7,0.3,0.4×3,5,6,8;0.6,0.5,0.4+17,21,24,28;0.8,0.2,0.4×5,8,10,14;0.3,0.6,0.6+2,9,16,27;0.5,0.5,0.6×0,1,3,6;0.7,0.5,0.3+-10,6,18,29;0.5,0.5,0.6×9,11,14,16;0.5,0.4,0.7+24,29,32,35;0.9,0.5,0.3×5,7,8,10;0.5,0.4,0.7+-14,-4,3,13;0.8,0.5,0.4×5,9,14,19;0.3,0.7,0.6=27,420,880,1703;0.3,0.7,0.7.


## 6.1. Exact Solution of Neutrosophic Transportation Problem of Type I

Thamaraiselvi and Santhi [4] solved the neutrosophic transportation problem of Type I, presented in Table 5, by their proposed approach.Table 5
Input data for neutrosophic transportation problem.
D
1
D
2
D
3
D
4
Supply
O
1
3,5
,
6,8
;
0.6,0.5,0.4
5,8
,
10,14
;
0.3,0.6,0.6
12,15,19,22
;
0.6,0.4,0.5
14,17,21,28
;
0.8,0.2,0.6
26
O
2
0,1
,
3,6
;
0.7,0.5,0.3
5,7
,
9,11
;
0.9,0.7,0.5
15,17,19,22
;
0.4,0.8,0.4
9,11,14,16
;
0.5,0.4,0.7
24
O
3
4,8
,
11,15
;
0.6,0.3,0.2
1,3
,
4,6
;
0.6,0.3,0.5
5,7
,
8,10
;
0.5,0.4,0.7
5,9
,
14,19
;
0.3,0.7,0.6
30
Demand
17
23
28
12In this section the exact solution of this problem is obtained by the modified approach. Using the modified approach the exact solution of neutrosophic transportation problem of Type I, presented in Table5, can be obtained as follows.Step 1.
Using Steps1 to 3 of the modified approach the neutrosophic transportation problem, presented in Table 5, can be transformed into crisp transportation problem (presented in Table 6).Table 6
Crisp transportation problem.
D
1
D
2
D
3
D
4
Supply
O
1
3
4
8
9
26
O
2
1
4
8
6
24
O
3
4
2
3
5
30
Demand
17
23
28
12Step 2.
When solving the crisp transportation problem (Table6), the obtained optimal solution is (12)x12=23,x14=3,x21=17,x24=7,x33=28,x34=2.Step 3.
Using the optimal solution, the minimum total neutrosophic cost is(13)MinimizeZ~N=∑i=03∑j=04xijc~ijN=235,8,10,14;0.3,0.8,0.7+314,17,21,28;0.3,0.8,0.7+170,1,3,6;0.3,0.8,0.7+79,11,14,16;0.3,0.8,0.7+285,7,8,10;0.3,0.8,0.7+25,9,14,19;0.3,0.8,0.7=370,543,694,938;0.3,0.8,0.7.


## 6.2. Exact Solution of Neutrosophic Transportation Problem of Type II

Thamaraiselvi and Santhi [4] solved the neutrosophic transportation problem of Type II, presented in Table 7, by their proposed approach.Table 7
Input data for neutrosophic transportation problem.
D
1
D
2
D
3
D
4
Supply
O
1
3,5
,
6,8
;
0.6,0.5,0.4
5,8
,
10,14
;
0.3,0.6,0.6
12,15,19,22
;
0.6,0.4,0.5
14,17,21,28
;
0.8,0.2,0.6
22,26,28,32
;
0.7,0.3,0.4
O
2
0,1
,
3,6
;
0.7,0.5,0.3
5,7
,
9,11
;
0.9,0.7,0.5
15,17,19,22
;
0.4,0.8,0.4
9,11,14,16
;
0.5,0.4,0.7
17,22,27,31
;
0.6,0.4,0.5
O
3
4,8
,
11,15
;
0.6,0.3,0.2
1,3
,
4,6
;
0.6,0.3,0.5
5,7
,
8,10
;
0.5,0.4,0.7
5,9
,
14,19
;
0.3,0.7,0.6
21,28,32,37
;
0.8,0.2,0.4
Demand
13,16,18,21
;
0.5,0.5,0.6
17,21,24,28
;
0.8,0.2,0.4
24,29,32,35
;
0.9,0.5,0.3
6,10,13,15
;
0.7,0.3,0.4In this section, the exact solution of this problem is obtained by the modified approach. Using the modified approach the exact solution of neutrosophic transportation problem of Type II, presented in Table7, can be obtained as follows.Step 1.
Using Steps1 to 3 of the modified approach the neutrosophic transportation problem presented in Table 7 can be transformed into neutrosophic transportation problem (presented in Table 8).Table 8
Neutrosophic transportation problem with crisp cost.
D
1
D
2
D
3
D
4
Supply
O
1
1
2
3
4
22,26,28,32
;
0.7,0.3,0.4
O
2
1
2
4
3
17,22,27,31
;
0.6,0.4,0.5
O
3
2
1
2
2
21,28,32,37
;
0.8,0.2,0.4
Demand
13,16,18,21
;
0.5,0.5,0.6
17,21,24,28
;
0.8,0.2,0.4
24,29,32,35
;
0.9,0.5,0.3
6,10,13,15
;
0.7,0.3,0.4Step 2.
When solving the neutrosophic transportation problem with crisp cost (Table8), the obtained optimal solution is (14)x~11N=-6,2,7,11;0.7,0.3,0.4,x~12N=17,21,24,28;0.8,0.2,0.4,x~21N=2,9,16,27;0.5,0.5,0.6,x~24N=-10,6,18,29;0.5,0.5,0.6,x~33N=24,29,32,35;0.9,0.5,0.3,x~34N=-14,-4,3,13;0.8,0.5,0.4.Step 3.
Using the optimal solution the minimum total neutrosophic cost is(15)MinimizeZ~N=∑i=03∑j=04x~ijNc~ijN=-6,2,7,11;0.7,0.3,0.4×3,5,6,8;0.6,0.5,0.4+17,21,24,28;0.8,0.2,0.4×5,8,10,14;0.3,0.6,0.6+2,9,16,27;0.5,0.5,0.6×0,1,3,6;0.7,0.5,0.3+-10,6,18,29;0.5,0.5,0.6×9,11,14,16;0.5,0.4,0.7+24,29,32,35;0.9,0.5,0.3×5,7,8,10;0.5,0.4,0.7+-14,-4,3,13;0.8,0.5,0.4×5,9,14,19;0.3,0.7,0.6=27,420,880,1703;0.3,0.7,0.7.


## 7. Comparative Study

The score value of minimized neutrosophic transportation cost, obtained by existing approaches [4] and modified approaches, is shown in Table 9.Table 9
Existing and modified score values.
Minimum score value of neutrosophic transportation cost
Existing approaches [4]
Modified approaches
First problem
140.118
127.25
Second problem
182.981
170.437It is obvious from the results, shown in Table9, that the score value of minimum neutrosophic transportation cost, obtained by modified approach, is less than the score value of the minimum value of neutrosophic transportation cost obtained by the existing approach [4]. This clearly indicates that the optimal solution obtained by the modified approach is better than the neutrosophic transportation cost by existing approach [4].


## 8. Conclusion

It is pointed out that it is not genuine to use the existing approaches [4] as in these approaches mathematical incorrect assumption has been used. Therefore, the existing approaches [4] are modified. Furthermore, the exact solution of existing neutrosophic transportation problem is obtained by the modified approach.



---

*Source: 2139791-2017-08-22.xml*