Next Article in Journal
A Novel Improved Feature Extraction Technique for Ship-Radiated Noise Based on IITD and MDE
Previous Article in Journal
Improving Neural Machine Translation by Filtering Synthetic Parallel Data
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Two Phase Method for Solving the Distribution Problem in a Fuzzy Setting

Department of Computer Science, Czestochowa University of Technology, Dabrowskiego 73, 42-201 Czestochowa, Poland
*
Author to whom correspondence should be addressed.
Submission received: 15 October 2019 / Revised: 5 December 2019 / Accepted: 7 December 2019 / Published: 11 December 2019
(This article belongs to the Section Multidisciplinary Applications)

Abstract

:
In this paper, a new method for the solution of distribution problem in a fuzzy setting is presented. It consists of two phases. In the first of them, the problem is formulated as the classical, fully fuzzy transportation problem. A new, straightforward numerical method for solving this problem is proposed. This method is implemented using the α -cut approximation of fuzzy values and the probability approach to interval comparison. The method allows us to provide the straightforward fuzzy extension of a simplex method. It is important that the results are fuzzy values. To validate our approach, these results were compared with those obtained using the competing method and those we got using the Monte–Carlo method. In the second phase, the results obtained in the first one (the fuzzy profit) are used as the natural constraints on the parameters of multiobjective task. In our approach to the solution of distribution problem, the fuzzy local criteria based on the overall profit and contracts breaching risks are used. The particular local criteria are aggregated with the use of most popular aggregation modes. To obtain a compromise solution, the compromise general criterion is introduced, which is the aggregation of aggregating modes with the use of level-2 fuzzy sets. As the result, a new two phase method for solving the fuzzy, nonlinear, multiobjective distribution problem aggregating the fuzzy local criteria based on the overall profit and contracts breaching risks has been developed. Based on the comparison of the results obtained using our method with those obtained by competing one, and on the results of the sensitivity analysis, we can conclude that the method may be successfully used in applications. Numerical examples illustrate the proposed method.

1. Introduction

The problem of optimal distribution and the transportation problem are similar mathematical formulations and may be considered as the particular cases of the general linear programming problem. The first effective algorithm for solution of transportation problem was developed in 1979 by Isermann [1]. Since then a lot of papers devoted to this problem in the case of real-valued parameters were published in the scientific journals.
Nevertheless, in practice, we often meet different kinds of uncertainty when the parameters of these optimization problems are presented by intervals or fuzzy values. In [2], Zimmermann first presented the mathematical formulation of fuzzy linear programming problem (FLPP) with its approximate solution.
Based on the literature analysis, we can say that for the solution of FLPP, two main approaches seem to be dominating.
In compliance with the first of them, a fuzzy linear programming problem is solved with the suggestion that decision variables are real values. Therefore, the real-valued solution of fuzzy problem is obtained. The real-valued solutions of FLPP were obtained with different simplifications of the form of fuzzy parameters in [3,4,5]. In [6,7], the approximate solutions of fuzzy transportation problem were obtained with the assumption that decision variables are real-values.
In the framework of second approach, the decision variables are assumed to be fuzzy values. Therefore, a fuzzy solution of F L P P is obtained. The FLPP problem with all fuzzy parameters and decision variables is named a fully fuzzy linear programming (FLPP) problem. It is clear that such an approach is more natural because it provides more useful information for decision makers, since a real-values solution is less informative than a fuzzy one. On the other hand, this approach needs a more general problem formulation and the solutions of more difficult, additional mathematical problems.
In the relatively few papers devoted to FLPP problems, only approximate solutions have been presented. Usually some simplifications of fuzzy parameters are used (triangular or trapezoidal fuzzy numbers, L R fuzzy numbers, and so on) [8,9,10].
Of course, it is hard to estimate all possible negative consequences of above-mentioned restrictions and simplifications. Therefore, the approaches based on the α -cuts representation of fuzzy values seem to be more promising because they are free of any restrictions on the shape of fuzzy values used for the solution of real-world problems.
In [11], the solution of fully fuzzy reverse logistics network design (FFRLND) problem is presented. A new parametric method for the solution of the problem in the form of fuzzy decision variables is proposed. The method is based on the α -cuts representation of fuzzy numbers. Unfortunately, the ranking function used for the fuzzy values comparison (FVC) based on the comparing of the mean values of triangular fuzzy numbers seems to be too simplified, whereas FVC plays an important role in the solution of the problem considered. In [12], the detailed literature review on fuzzy transportation problem is presented. Taking into account the restrictions and drawbacks of known methods, the authors proposed a direct approach to the solution of fully fuzzy transportation problems. The method is based on the α -cuts representation of fuzzy values and fuzzy decoding procedure based on constrained fuzzy arithmetic operations and a fuzzy ranking technique. In our opinion, the use of constrained fuzzy arithmetic and simplified fuzzy ranking technique makes it possible to avoid some known problems, but generates new ones.
Based on the above literature analysis and especially on the comprehensive literature review presented recently in [12], we can say that the most informative solutions of fuzzy linear transportation problem and fuzzy linear distribution problem having similar mathematical formulations that may be obtained in the framework of fully fuzzy linear transportation problem FFLTP. In this framework, all or part of parameters are fuzzy values and the decision variables are fuzzy values too. There are many approximate solutions of fully fuzzy linear programming problem based on different simplifications of fuzzy parameters proposed in the literature. It is hard to estimate the possible negative consequences of such simplifications when we deal with real-world problems. Therefore, it seems to be promising to use approaches based on the α -cut representation of fuzzy numbers with corresponding operations on them and an adequate method for fuzzy numbers’ comparison. Nevertheless, we found in the literature, only two papers [11,12] in which this approach was used. Unfortunately, in these papers, the so-called constrained fuzzy arithmetic, which has many undesirable properties, was applied. The extremely simplified method for the fuzzy numbers’ comparison based only on the means of triangular fuzzy numbers was used. So we can say that the methods proposed in these papers should be assumed to be rather unreliable ones.
It is important to note that in all considered cases the fuzzy distribution problem was treated as a fuzzy, single-criterion task with fuzzy constraints. On the other hand, oppositely to the classical transportation problem, the fuzzy constraints in the distribution problem may be naturally treated as local fuzzy criteria of contracts breaching risks, and therefore, a more specified and correct form of the fuzzy distribution problem is a non-linear fuzzy multiobjective task. For its formulation, the corresponding criterion of profit maximization is needed. Such a criterion may be obtained on the base of solution of the fully fuzzy distribution problem in the form of fuzzy single-criterion task with fuzzy constraints, which provides the optimal fuzzy profit. It is worth noting that we did not find similar approaches in the literature. Therefore, we have two phases of the solution to our problem.
In the fist of them, we obtain the solution of fully fuzzy single-criterion linear distribution problem (FFDP) with fuzzy constraints. In the second phase, using the results obtained in the first one, the non-linear fuzzy multiobjective distribution problem FDP is formulated and solved.
In the first phase, to avoid the above-mentioned shortcomings of known approaches, a new approach to the solution of fully fuzzy linear distribution problem (FFDP) based on the straightforward fuzzy extension of the simplex method is proposed. The traditional fuzzy arithmetic rules with probabilistic approach to the interval and fuzzy values comparison are applied in this fuzzy extension. The use of α -cut representation of fuzzy values allows us to avoid any simplifications of their forms. The proposed fuzzy extension is implemented using an object-oriented technique.
In the second phase, the multiobjective non-linear fuzzy distribution problem is formulated. The local criterion of profit maximization is introduced using a fuzzy optimal profit obtained at the first phase as a range of achievable profits. To obtain a general criterion, all local criteria are aggregated, taking into account their relative importance. The local criteria are aggregated with the use of most popular aggregation modes. To obtain a compromise solution, the general compromise criterion is introduced, which is the aggregation of aggregating modes with the use of level-2 fuzzy sets. Finally the solution is obtained using a numerical method.
The main advantages of the proposed method in comparison with the existing ones are as follows:
  • The straightforward fuzzy extension of simplex method allows us to avoid the use of rather unreliable meta-heuristic method used for the solution of FFLTP in the competing approach proposed in [12].
  • The treatment of fuzzy constraints as local risk criteria reflects better the specificity of FDP, and provide the opportunity to formulate the FDP for the first time as the fuzzy nonlinear multiobjective problem aggregating the fuzzy local criteria based on the overall profit and contracts breaching risks.
  • Since there are many possible methods for aggregating the fuzzy local criteria proposed in the literature, the problem of finding a compromise solution arises, which in the framework of this approach, for the first time, is solved on the basis of aggregation of aggregating modes with the use of level-2 fuzzy sets.
The reminder of paper is set out as follows.
Section 2 is devoted to the first phase: straightforward fuzzy extension of the single-criterion distribution problem. The mathematical tools used for the fuzzy extension of simplex method are presented. The selection of the method for fuzzy values comparison is carefully argued since it plays a pivotal role in the implementation of the fuzzy simplex method. The FFDP is formulated and solved. It is shown how the initial FDP is transformed to the canonical form of FLPP. The results obtained with the use of the developed method and their comparison with those obtained using competing method and Monte–Carlo method are presented using illustrative examples. The sensitivity analysis of model is provided as well. In Section 3, the results obtained at the firs phase are used to define the local criteria needed to formulate the multiobjective fuzzy distribution problem. To formulate this problem, the different aggregating modes and their aggregation on the basis of the level-2 fuzzy sets are used to aggregate initial local criteria. The solution is obtained using the direct random search method. The illustrative examples are presented. Conclusions are covered in Section 4.

2. The First Phase: Straightforward Fuzzy Extension of FDP

At this phase of the solution of FDP, the problem is formulated as a linear fully fuzzy single-criterion distribution problem. Since in this case, the problem has a mathematical structure similar to the structure of fully fuzzy transportation problem, for its solution a straightforward fuzzy extension of simplex method is used. The mathematical structure of the usual simplex method is extended by replacing all parameters with fuzzy ones and all arithmetic operations with corresponding operations on fuzzy values including operations of interval and fuzzy values comparisons. It is clear that in such an approach to the fuzzy extension of the simplex method, the correctness of the fuzzy arithmetic operations and very important fuzzy values’ comparisons play key roles in obtaining correct results of the optimization.

2.1. Mathematical Tools

We can say that fuzzy arithmetic is a well studied and formalized part of fuzzy sets theory. On the other hand, when we deal with the implementation of fuzzy arithmetic rules, we meet some problems. In the most general form, the fuzzy rules are based on the so-called extension principle proposed by Zadeh [13]. An arbitrary t-norm is used in the mathematical formalization of this principle. Suppose X, Y, and Z are fuzzy values with the corresponding membership functions μ ( x ) , μ ( y ) , μ ( z ) ( x X , y Y , and z Z ) and @ { + , , , / } being an arithmetical operation. Then,
Z = X @ Y = { z = x @ y , μ ( z ) = max z t ( μ ( x ) , μ ( y ) ) , x X , y Y } .
According to the studies of Zimmermann and Zysno [14], the choice of an appropriate t-norm is rather a context dependent problem.
Another, more practical approach to the mathematical representation of fuzzy arithmetic rules is based on the α -cut presentation of fuzzy numbers [15].
If X is a fuzzy value, then X = α α X α , where α X α is the fuzzy subset: x U , μ X ( x ) α , X α is the support set of fuzzy subset α X α and U is the universe of discourse. It is very important that for fuzzy values X and Y, all the mathematical operations on them may be represented as sets of operations on intervals presenting their α -cuts:
( X @ Y ) α = X α @ Y α .
At fist glance, the straight α -cut representation of fuzzy arithmetic rules values seems to be a rough one when comparing with the general expression (1). But in the practical numerical implementation of (1) the discretization of the supports of considered fuzzy values X, Y, and Z, especially when we have complicated forms of μ ( x ) and μ ( y ) , is inevitable. It is shown in [16], that any discretization of (1) provides unacceptable non-convex results. It seems natural that the results obtained with the use of the general Definition (1) may be somewhat improved using the more detailed discretization, but in practice a very dense disretization is usually needed to do that. It is worth noting here that undesirable results were obtained with the use of different t-norm and arithmetical operations, whereas when using the α -cut presentation of fuzzy arithmetic rules we have no such problems at all. For more analysis and details, see for an example, [16]. Therefore, here it is quite enough for our purposes to state that there are some difficult practical problems when using general expression (1) and that there are none these problems in the case of an α -cut representation of fuzzy arithmetic rules. So we can say that the α -cut representation of fuzzy arithmetic rules may be recognized as a reliable basis for mathematical modeling in the fuzzy setting.
It is seen that fuzzy arithmetic rules presented by α -cuts are based on interval arithmetic rules. Therefore, the presentation of basic definitions of applied interval analysis should be provided.
There are may internal methodological problems in the framework of interval analysis. Therefore, several different approaches to the formulation of interval arithmetic rules were proposed in the literature [17,18]. All of them have own drawbacks and restrictions. Therefore, here we will use the classical definition of interval arithmetic which seems to be more logically justified and usually used in the solution of real-world problems. This basic definition may be presented as follows. Let X = [ x 1 , x 2 ] and Y = [ y 1 , y 2 ] be intervals, @ { + , , , / } . Then, the resulting interval Z is calculated using the following expression:
Z = X @ Y = { z = x @ y , x X , y Y } .
It is clear that this definition provide the results based only on the bounds of intervals:
X + Y = [ x 1 + y 1 , x 2 + y 2 ] , Σ X Y = [ x 1 y 2 , x 2 y 1 ] , X Y = [ m i n ( x 1 y 1 , x 2 y 2 , x 1 y 2 , x 2 y 1 ) , m a x ( x 1 y 1 , x 2 y 2 , x 1 y 2 , x 2 y 1 ) ] , X / Y = [ x 1 , x 2 ] [ 1 / y 2 , 1 / y 1 ] , 0 Y .
As important role in the solution of fully fuzzy transportation and distribution problems plays the operation of fuzzy values comparison. Since our approach is based on the α -cut presentation of fuzzy numbers, an appropriate method for interval comparison should be chosen.
Most methods for interval comparison are based on the real-valued representation of intervals Ref. [19,20,21]. Moreover, Wang et al. [22] showed that usually, these methods are based on the comparison on interval means. Of course, such simplifications of the problem may provide in practice unpredictable undesirable results. Therefore, in [22] the authors proposed a heuristic method which is not based on the above-mentioned simplifications. Let Y = [ y 1 , y 2 ] and X = [ x 1 , x 2 ] , be crisp intervals; then, the possibility that Y X may be, according to [22], calculated as follows:
P o ( Y X ) = max 0 , y 2 y 1 max 0 , y 1 x 2 x 2 x 1 + y 2 y 1 .
Unfortunately, this approach does not provide the separated interval equality relation, because for X = Y , i.e., x 1 = y 1 , x 2 = y 2 from (5), we get P o ( Y X ) = 0.5 , P ( Y X ) = 0.5 . In the literature, interval equality relation is sometimes treated as identity [18], or only in conjunction with interval inequality [23] or even as an impossible relation [24]. On the other hand, in accordance with the classical definition [18], an interval X is entirely represented by its bounds ( X = [ x 1 , x 2 ] ). Therefore, the interval X may be considered as a mathematical object completely defined by the pair x 1 , x 2 . Then it is clear that if we have two such objects X and Y defined by equal bounds ( x 1 = y 1 , x 2 = y 2 ) we can declare that X and Y are equal intervals.
Let us consider some hypothetical measure m e ( X @ Y ) [ 0.1 ] ( @ { > , = , < } ) of interval equality/inequality. The logically justified properties of m e ( X @ Y ) may be only such that m e ( X = Y ) = 1 , m e ( X > Y ) = 0 , and m e ( X < Y ) = 0 for equal intervals X and Y, and m e ( X = Y ) = 0 for the completely different X and Y when they have no intersection.
Therefore, to develop a measure of interval equality/inequality with defined above desirable properties, we employ the so-called probabilistic approach to interval comparison. This idea is not a new one. The review of methods based on the probabilistic approach to the interval comparison is made in [19]. However, only in [25] was the consistent set of interval and fuzzy values relations comprising separated equality and inequality relations first developed with the use of the probability approach. The attractiveness of this approach is the possibility to obtain a complete set of probabilities P r ( X > Y ) , P r ( X < Y ) , and P r ( X = Y ) for the intervals X and Y when compared using the only one postulation—that the supports of X and Y are uniform distributions of random values x X , y Y . It is worth emphasizing here that only in [19,25] do the developed expressions provide in any case P r ( X > Y ) + P r ( X = Y ) + P r ( X < Y ) = 1 . In [19], two possible propositions related to conditional probabilities were used to get two sets of interval relations named as “weak” and “strong” relations. We will use here, only the “strong” relations (the probabilities of X > Y , X < Y , and X = Y ) since they are an asymptotic case of the general approach based on the Dempster–Shafer theory (see [19]). These expressions are presented as follows.
In the case of overlapping intervals (see Figure 1a):
P r ( Y < X ) = 0 , P r ( Y = X ) = x 2 y 1 2 x 2 x 1 y 2 y 1 , P r ( Y > X ) = 1 P r ( Y = X ) .
In the case of including the interval (see Figure 1b):
P r ( Y < X ) = x 1 y 1 y 2 y 1 , P r ( Y = X ) = x 2 x 1 y 2 y 1 , P r ( Y > X ) = y 2 y 1 y 2 y 1 .
It is easy to see that in the both cases, P r ( X < Y ) + P r ( X = Y ) + P r ( X > Y ) = 1 .
The expressions for the fuzzy values comparison were obtained in [19] with the use of interval relations (6) and (7), and the α -cut representation of fuzzy values. Suppose X ^ and Y ^ are the fuzzy numbers on Z with the corresponding membership functions μ X ( z ) , μ Y ( z ) : Z [ 0 , 1 ] . Then, X ^ and Y ^ may be represented by the sets of α -cuts X ^ = α X α , Y ^ = α Y α , where X α = { z Z : μ X ( z ) α } , Y α = { z Z : μ Y ( z ) α } are the crisp intervals. With the use of α -cuts representation, the fuzzy relations X ^ r e l Y ^ , r e l { < , = , > } may be presented as follows:
X ^ r e l Y ^ = α X α r e l Y α .
Because X α and Y α are crisp intervals, the probability P r α ( X α > Y α ) for all pairs X α and Y α should be obtained from (6) and (7). Obviously, the set of the probabilities P r α , ( α ( 0 , 1 ] ) may be considered as the support of fuzzy subset
P r ( X ^ > Y ^ ) = α P r α ( X α > Y α ) ,
where the value of α is treated as the degree of membership to the fuzzy value P ( X ^ > Y ^ ) . Similarly, the fuzzy subset P r ( X ^ = Y ^ ) may also be obtained. It is easy to show that in overlapping case P r ( X ^ > Y ^ ) + P r ( X ^ = Y ^ ) = “near 1”, and in inclusion case P r ( X ^ > Y ^ ) + P r ( X ^ = Y ^ + P r ( X ^ < Y ^ ) = “near 1” (“near 1” is a symmetrical fuzzy value centered around 1. In applications, often the real-valued representations of fuzzy numbers are used to compare fuzzy values. Therefore, different characteristic numbers of fuzzy set may be used. Nevertheless, it seems enough justified to apply the defuzzification, which for the set of α -cuts used, may be presented as follows:
P ¯ r ( X ^ > Y ^ ) = α α · P r α ( X α > Y α ) α α .
That last expression is based on the natural assumption that the α -cut contribution to the final probability assessment is increasing with the rise of α .

2.2. The Fully Fuzzy Extension of Simplex Method

Oppositely to the transportation task, in the distribution problem we try to maximize the final profit of distributor taking into account transportation costs, prices of sellers and buyers, and restrictions concerned with contracts which may be signed by the distributor with sellers and buyers. Let us assume that the distributor has M possible sellers and N possible buyers (Figure 2).
Let a i , i = 1 to M, be the maximal quantities of products which may be sold by sellers, and b j , j = 1 to N, be the maximal quantities of products that may be bought by the buyers. The fuzzy profit p ^ r i j is the result of supplying of a product unit from ith seller to jth buyer and can be presented as follows: p ^ r i j = c j c i t ^ i j , where c j and c i are the prices of selling and buying, respectively; t ^ i j is the fuzzy cost of supplying of a products unit from ith seller to jth buyer. On the basis of the signed contracts, the distributor must buy at least p i products units at the price of c i monetary units for unit of product from each ith seller and to sell at least q j product units at price of c j monetary units for unit of product to each jth buyer. Such constraints p i and q j restrict only the lower bounds of permissible optimal quantities of product to be bought and sold. Hence, these quantities can be negotiated, and hereinafter, we will consider them as the fuzzy constraints p ^ i , q ^ j . So, the problem is the optimization of product quantities x ^ i j (i = 1, …, M; j = 1, …, N) supplying from ith seller to jth buyer consumer which maximize the summarized fuzzy profit of distributor P ^ r taking into account the fuzzy constraints:
P ^ r = i = 1 M j = 1 N p ^ r i j x ^ i j max ,
j = 1 N x ^ i j a i ( i = 1 . . M ) , i = 1 M x ^ i j b j ( j = 1 . . N ) ,
j = 1 N x ^ i j p ^ i ( i = 1 . . M ) , i = 1 M x ^ i j q ^ j ( j = 1 . . N ) .
In this model, the parameters a i and b j are represented by real values since they represent the maximal possible quantities of product which a seller agrees to sell and the maximal quantities of product which a buyer is ready to buy. It is clear that in practice, the values of parameters a i and b j are usually known as strong starting limits and are not negotiated.
It is seen that the above model from mathematical point of view is the same as the fully fuzzy transportation problem. Hence, for its solution, the fuzzy extension of the simplex method can be applied. Here, we only briefly describe the most important steps of implementation of this method.
First, of all the parameters of the model are substituted with the corresponding fuzzy values and all arithmetical rules, including operation of comparison, are substituted with the fuzzy operations defined in the previous subsection using the α -cut representation of fuzzy values. To transform the model (11)–(13) into its canonical form, we substitute the two-index representation of this model for the single-index one. Replacing the inequalities by equalities we transform the model into its augmented form.
The next step is the presentation of the augmented form in the canonical form. Introducing the so-called slack variables, these inequalities are transformed to the set of equalities in the canonical form. What we avoid here is the presentation of routine procedure of transformation of the initial fuzzy linear programming problem to the canonical form using corresponding mathematical expressions. These expressions are far too cumbersome to be appropriate for the scientific paper. Moreover, such a procedure (in its non-fuzzy form) is thoroughly described in textbooks.
The next steps of the proposed approach are formally the same as in the standard simplex method, but are implemented in the fuzzy form. For the implementation of developed approach, the technique of object-oriented programming was used. For this purpose, the special class “Fuzzy value” was implemented on the base of language C++. This class comprises the overloaded operators which represent the operations on fuzzy values. In this approach, the fuzzy parameters and variables are implemented as the objects of class “Fuzzy value”. We can say that the algebraic structure of fuzzy extended simplex method is formally the same as the algorithm of the usual simplex method.
To validate our approach, we compared it with some other methods for the solution of fully fuzzy transportation or distribution problems. We found in the literature, only one paper [12] where such a problem was solved using an α -cut representation of fuzzy values, the constrained interval arithmetic operations, and a fuzzy ranking technique based on the real-valued means of fuzzy values. Since the constrained interval arithmetic is in contradiction with the logically justified basic definition (3) which is successfully used in the solution of real-world problems, and taking into account the extremely simplified ranking technique which leads to the loss of important information, we can say that the method proposed in [12] may provide undesirable results.
Therefore, when comparing the method proposed in [12] with our approach, we should obtain different results, since substantially different mathematical tools were used. To estimate this possible difference and validate our approach, consider the example from [12]. The fully fuzzy transportation problem with triangular fuzzy numbers was solved in the case of three sources and four destinations. It was formulated as follows:
M i n Z ^ = i = 1 3 j = 1 4 c i j ^ x i j ^ s.t.: i = 1 3 x ^ i j = a ^ j , j = 1 , 2 , 3 , 4 ; j = 1 4 x ^ i j = b ^ i , i = 1 , 2 , 3 .
The fuzzy parameters of above problem are presented in Table 1.
In [12], the efficient solutions of the problem being consideredd are presented only on the particular α -cuts ( α = 0, α = 0.5, α = 1). Therefore, in Table 2 they are presented in the crisp interval form. The corresponding results that we have obtained using our approach are shown in Table 3.
Comparing the results presented in Table 2 and Table 3, we can conclude that they coincide on the qualitative level, but our results seem to be a bit more variable. Therefore, what we can say is that our results are likely more reliable, as they were obtained using more justified mathematical tools.
On the other hand, our problem (11)–(13) may be solved using Monte–Carlo method. Of course this method is extremely expensive, and therefore can be used only for a few number of sellers and buyers. It is important that for its implementation, interval and fuzzy arithmetic operations are not needed. Obviously, the results obtained using this method may serve as in some sense as an empirical basis for the other methods’ validations.
Therefore, to validate our method, the results of FDP solution based on the straightforward fuzzy extension of simplex method were compared with those obtained using Monte–Carlo for the problem (11)–(13). In the framework of Monte–Carlo approach, all uncertain parameters are treated as random values with normal distributions. The usual Monte–Carlo procedure was applied; i.e., for each complete set of randomly chosen values according to corresponding normal frequency distributed, real-value parameters of the problem, the real-valued solution of problem (11)–(13) was obtained. Repeating this procedure of random choice many times, finally, the results were obtained as frequency distributions of optimal real-valued x i j and P r .
In order to make comparable the results obtained using the fuzzy and Monte–Carlo approaches, the special, simple method for the conversion of frequency distributions into fuzzy values with inevitable but acceptable loss of information was used. This method allows us to guaranty the comparability of uncertain data in the fuzzy and probabilistic cases. To make our analysis more transparent, we used the simple, normally distributed frequency functions, completely represented be their means m and standard deviations σ .
The proposed method is implemented in two steps:
In the first one, with the use of initial normally distributed frequency function f(x), the cumulative distribution function F(x) is calculated as follows: F ( x ) = x f ( x ) d x .
In the second step, a trapezoidal fuzzy number is obtained on the basis of F ( x ) . The four values F ( x i ) , i = 1 to 4, defining the mapping of F ( x ) on X should be chosen in such a way that they specify the bottom and upper α -cuts of the trapezoidal fuzzy number.
So, we obtain the quadruple on X: [ x 1 , x 2 , x 3 , x 4 ] such that interval [ x 1 , x 4 ] represents the bottom of trapeze and interval [ x 2 , x 3 ] is the top of trapeze. Because the probability that x is included in the interval [ x 1 , x 4 ] may be calculated as F ( x 4 ) F ( x 1 ) and the probability that x is included in the interval [ x 2 , x 3 ] is equal to F ( x 3 ) F ( x 2 ) , in our example the intervals [ x 2 , x 3 ] and [ x 1 , x 4 ] were chosen in such a way that they corresponded to the 20% (for the top of trapeze) and 80% (for the bottom of trapeze) values of the confidence interval, respectively. Obviously, we placed these intervals in such a way that they were centered around the center of the cumulative distribution F ( x ) .
It is clear that the accuracy of the proposed method of transformation was based only on the subjective opinions of experts concerned with the suitability of upper and lower confidence intervals. Obviously, this subjectivity provides some uncertainty. Nevertheless, we expected that the choice of 20% and 80% confidence intervals would guaranty at least satisfactory results of transformation.
Consider the example.
Example 1.
Let us consider the fully fuzzy distribution problem (11)–(13) in the case of N = 3 and M = 3. To collate the fuzzy solution with that obtained by Monte–Carlo method, all the uncertain parameters were first represented by normal frequency distributions. As it was mentioned above, the parameters a i and b j are real values and in our example they are presented as follows:
a 1 = 500, a 2 = 490, a 3 = 590, b 1 = 405, b 2 = 485, b 3 = 585.
The uncertain parameters were represented by normal frequency distributions with the means presented in Table 4.
For the sake of simplicity, all the standard deviations σ were equal to 12. With the use of proposed method for the transformation of frequency distribution function into a fuzzy value, the trapezoidal fuzzy parameters of problem (11)–(13) were obtained. They are presented in Table 4.
The results obtained from the model (11)–(13) using above parameters are presented in Table 5.
Several interesting results obtained using the fuzzy approach and Monte–Carlo method are presented in Figure 3, Figure 4, Figure 5 and Figure 6. The frequency distributions in Figure 3, Figure 4 and Figure 5 were obtained with the use of Monte–Carlo method on the basis of one million random steps.
We can see that the Monte–Carlo method sometimes may provide resulting frequency distribution functions with two peaks, and the bigger peaks are in a good qualitative compliance with the results of fuzzy solution (see Figure 3 and Figure 4). The negative effect of multiple peaks in the results of Monte–Carlo method may be eliminated using a much bigger number of random steps (see Figure 6), but this is a very expensive approach. Of course, using the fuzzy optimization, we have no the problem of multiple peaks, as the results are always trapezoidal fuzzy numbers. The resulting fuzzy solutions sometimes are substantially wider than those obtained using Monte–Carlo method (Figure 5). This is the consequence of well known “access width effect” (the results of fuzzy and interval computations are usually wider than the widths of initial data) [17]. On the other hand, when deal with the fuzzy problem, we take into account the values that have extremely low probability in the Monte–Carlo method.
Analyzing the results, we can say that the influence of “access width effect” is not so important. Therefore, the proposed straightforward fuzzy extension of the simplex method may be used for the solution of fully fuzzy distribution problems.
Since the “access width effect” is one of the most important problems of interval and fuzzy arithmetic, the sensitivity analysis that investigates the influence of uncertainty of model’s parameters on the uncertainty of results should to be relevant. To provide such a sensitivity analysis, at least two substantially different examples of the solution of the problem (11)–(13) are needed. Therefore we used the Example 1 and the addition one (Example 2) in the case of four sellers and six buyers.
Example 2.
Let us consider the solution of the problem (11)–(13) in the case of four sellers (M = 4) and six buyers (N = 6). The real-valued parameters in our example are presented as follows:
a 1 = 270, a 2 = 295, a 3 = 390, a 4 = 400, b 1 = 330, b 2 = 250, b 3 = 260, b 4 = 260, b 5 = 150, b 6 = 160.
The uncertain parameters are presented in Table 6 and Table 7.
The solution of this problem obtained using the developed method is presented in Table 8 (only non-zero values are shown).
To study the influence of uncertainty of the model’s fuzzy parameters on the uncertainty of solution, we introduced two uncertainty indexes UIP and UIS, which represent the averaged uncertainty of model’s parameters and averaged uncertainty of fuzzy solution, respectively. They are defined as follows:
  • U I P = 1 N p i = 1 N p 2 ( S i u S i l ) S i u + S i l , where N p is the number of uncertain parameters of the model; S i l and S i u are the lower and upper bounds of the support of the i’th uncertain parameter.
  • U I S = 1 N s j = 1 N s 2 ( S j u S j l ) S j u + S j l , where N s is the number of uncertain components of solution; S j l and S j u are the lower and upper bounds of the support of the j’th uncertain component of solution.
Of course, different, more complex definitions of UIP and UIS may be proposed; e.g., based on the averaging on α -cuts. Nevertheless, we prefer to use our simple definitions as they are based on the supports of fuzzy parameters and variables emphasizing our intention to deal with the maximal uncertainty.
Let us turn to our examples.
For Example 1, based on the Table 4 and Table 5, we obtained: UIP = 0.1 and UIS = 0.4.
For Example 2, based on the Table 6, Table 7 and Table 8, we obtained: UIP = 0.3 and UIS = 0.5.
Based on the results and comparing dimensionalities of the tasks in the examples considered, we can conclude that uncertainty of the solution rises along with the increasing of uncertainty and the number of parameters. Of course, this is not a surprising conclusion, but more important is that the rising of solution’s uncertainty in the considered examples is relatively small.
Therefore, we can say that in the framework of our approach to the solution of fully fuzzy distribution problem, the influences of the "access width effect " do not prevent using our approach in applications.

3. The Formulation of the Multiobjective Fuzzy Distribution Problem

In the first phase of solution of fully fuzzy distribution problem we considered it as a single criterion problem. The overall fuzzy profit with fuzzy constraints was maximized. On the other hand, these constraints may serve as local criteria. This corresponds to general approach to the solution of fuzzy optimization problems developed by Bellman and Zadeh [26].

3.1. The Formulation of Problem

Consider the fuzzy parameters p ^ i and q ^ i , in the fuzzy constraints (13). They are the lowest fuzzy limits for the possible optimal amounts of product to be bought and sold, respectively. Hence, the real-valued p i and q i are established as a result of negotiations. It is important that an appropriate selection of the real values p i p ^ i , q i q ^ i strongly affects the overall profit. So we can say that the fuzzy values p ^ i and q ^ i may be naturally treated as local criteria.
Let us consider the p ^ i (the fuzzy bounds for amount of product which can be obtained from the seller). For the sake of simplicity, suppose that p ^ i is a trapezoidal fuzzy number p ^ i = [ p i 1 , p i 2 , p i 3 , p i 4 ] .
Then the interval [ p i 1 , p i 4 ] can be interpreted as the fuzzy interval of acceptable values of p i with the corresponding membership function μ i ( p i ) .
Consider the interval [ p i 1 , p i 2 ] . In this case, the lessening of μ i ( p i ) along with the decreasing of p i is clearly understood as follows: the risk that contract signed between buyer and distributor will be unfulfilled is rising with the decreasing of p i . On the other hand, the rising of p i in the interval [ p i 3 , p i 4 ] leads to the lowering of μ i ( p i ) and as a consequence, to the rising of the overbuying risk (the risk that the part of the bought product could not be sold to the buyer). Obviously, in the interval [ p i 2 , p i 3 ] we have no any risks, since μ i ( p i ) =1. It is worth noting that in such reasoning, the membership function μ i ( p i ) is the representation of the risk varying in the interval [0, 1] and calculated as 1 – μ i ( p i ) .
Similarly, the membership function μ j ( q j ) can be interpreted as the corresponding risk belonging to the interval [0, 1] and calculated as 1 – μ j ( q j ) .
Therefore, the fuzzy distribution problem can be interpreted as the multiobjective optimization task comprising the local criteria of overall profit maximization and the local risks’ minimization. In our case, the local criteria of a particular risks’ minimization can be formulated straightforwardly using the membership functions of fuzzy values p ^ i and q ^ i . Nevertheless, an explicit mathematical formalization of the criterion of overall profit maximization can be provided using an additional analysis. In order to formulate this criterion, we used the solution obtained in the first phase in Section 2 with the use of straightforward, direct fuzzy extension of simplex method for the solution of fully fuzzy distribution problem. There are no any additional restrictions on the form of fuzzy parameters and variables in this approach and it is based on the overall profit maximization with fuzzy constraints. Therefore, the optimal fuzzy profit P ^ r can be interpreted as the fuzzy interval of all the attainable real-valued profits.
Therefore, to formulate the local criterion Cpr(Pr) representing the distributor’s intention to maximize the overall profit, it is enough to use the support of P ^ r . In the case of trapezoidal fuzzy solution as in the previous section, we can present it by the quadruple [ P r 1 , P r 2 , P r 3 , P r 4 ] . Then, the local criterion of overall profit maximization may be presented as follows:
C p r = P r P r 1 P r 4 P r 1 .
It is seen that this criterion does not present the “possibility” to obtain the profit that is implicitly presented by the fuzzy profit P ^ r obtained at the first phase using the constraints defined by the fuzzy parameters p ^ i and q ^ i , because in the multiobjective distribution problem we consider these parameters as local criteria of risk minimization. We can see that for the calculation of Cpr(Pr), we need the real-valued Pr.
Obviously, in practice all the bought and sold product quantities p i , q j and optimal product quantities x i j supplied from ith seller to jth buyer according to the signed contracts should be real values. Therefore, some simplifications of the initial fuzzy problem seem to be enough justified. Therefore, we use in (11), the real-valued representations p r i j instead of fuzzy p ^ r i j . In real-world situations, usually, the prices c i , c j and transportation costs of supplying of product unit t i j are well-known real values. Hence, p r i j = c j c i t i j are real values too. Therefore, when we deal with the symmetrical trapezoidal fuzzy p ^ r i j , the means of such trapezes will be used.
These simplifications allow us to get from (11)–(13) for the real-valued p i p ^ i , q j q ^ j , i = 1 to N, j = 1 to M, the real-valued optimal product quantities x i j o p t , and the real-valued profit P r = i = 1 M j = 1 N p r i j x i j o p t .
It is clear that x i j o p t depends only on p i p ^ i , q j q ^ j and P r depends on p i , q j as well: P r ( { p i } , { q j } ) . The values of P r ( { p i } , { q j } ) are needed to calculate the values of local criterion of profit maximization C p r ( P r ( { p i } , { q j } ) ) at the following steps of the proposed algorithm for the solution of fuzzy multiobjective distribution problem.
As it was shown above, the local risks minimization can be formulated as the maximization of membership functions μ i ( p i ) , and μ j ( q j ) , Therefore, the solution of multiobjective distribution problem are the optimal { p i } o p t { p ^ i } , { q j } o p t { q ^ j } maximizing some generalized criterion aggregating all the considered local criteria C p r ( P r ( { p i } , { q j } ) ) , μ i ( p i ) , μ j ( q j ) with their relative importance. Then, the optimal product quantities x i j supplied from ith seller to jth buyer are finally obtained as the solution of problem (11)–(13) for the real-valued p r i j and optimal { p i } o p t { p ^ i } , { q j } o p t { q ^ j } , i = 1 to N, j = 1 to M.

3.2. The Solution of Multiobjective Fuzzy Distribution Problem Using the Aggregation of Different Aggregating Modes

In the formulation of generalized criterion, we aggregate the criteria of local risks to obtain the aggregated risk minimization criterion and aggregate this risk criterion with the profit maximization one. Among many approaches to the formulation of the general criterion presented in the literature, the most popular are the multiplicative aggregation mode, Yager’s [27] aggregation, and the weighted sum (see [28]). It is known that the choice of the relevant aggregating method is a context dependent problem [14]. In our case, the most popular aggregating modes may be presented as follows:
E 1 ( { p i } , { q j } ) = α · C p r ( P r ( { p i } , { q j } ) ) + ( 1 α ) · ( μ 1 ( p 1 ) + μ 2 ( p 2 ) + + μ M ( p M ) + μ 1 ( q 1 ) + μ 2 ( q 2 ) + + μ N ( q N ) ) / ( 2 ( N + M ) ) , E 2 ( { p i } , { q j } ) = min ( C p r α ( P r ( { p i } , { q j } ) ) , min ( μ 1 ( p 1 ) , μ 2 ( p 2 ) , , μ M ( p M ) , μ 1 ( q 1 ) , μ 2 ( q 2 ) , , μ N ( q N ) ) 1 α ) , E 3 ( { p i } , { q j } ) = C p r α ( P r ( { p i } , { q j } ) ) · ( μ 1 ( p 1 ) · μ 2 ( p 2 ) · · μ M ( p M ) · μ 1 ( q 1 ) · μ 2 ( q 2 ) · · μ N ( q N ) ) 1 α ) ,
where 0 α 1 is the relative importance of the profit maximization criterion, E 1 is the weighted sum aggregation, E 2 is the Yager’s aggregation, and E 3 is the multiplicative aggregation. The relative importance of each risks’ local minimization criteria in our case were equal, as we had no reasons for another assumption. Therefore, we used the aggregation of risk criteria with the common relative importance 1 α . Then, the optimal alternatives ( { p i } , { q j } ) k , o p t , k = 1, 2, 3 for the general criteria E 1 , E 2 , E 3 may be obtained as the solutions of the following nonlinear multiobjective optimization problems:
max ( E k ( { p i } , { q j } ) ) , k = 1 , 2 , 3 , { p i } { p ^ i } , { q j } { q ^ j } .
Based on the formal mathematical approach with the use of corresponding theorem and illustrative examples, it was shown in [28] that the most correct aggregation mode is the Yager’s type aggregation ( E 2 ); the multiplicative aggregation ( E 3 ) seems to be less reliable; and finally, the weighted sum ( E 1 ) may be treated as rather unreliable one. Nevertheless, it is known that Yager’s aggregation sometimes provides results which contradict with intuitive conceptions of experts concerned with the optimality [29].
Thus, when we a difficult multiobjective problem with a great number of local criteria, applying all feasible aggregating modes is sufficiently justifiable. If the results of optimization obtained using different aggregation modes are comparable, we can believe that they are rather optimal ones. In the case, when the results we get with the use of different aggregating modes are substantially different ones, the compromise solution based on the appropriate aggregation of aggregating modes may be recommended.
The different methods for aggregation of aggregating modes were proposed in the literature References [30,31,32]. The weighted sum, Yager’s aggregation, multiplicative aggregation, and the different combinations of them are used in aggregation of aggregating modes. The most important drawback of these methods is that they do not provide the aggregation of all feasible aggregating modes.
In [28], a simple, but intuitively evident and mathematically justified approach which makes it possible to avoid the above-mentioned drawback was developed. The proposed method provides the aggregation of aggregating modes with the use of mathematical tools of the level-2 fuzzy sets. Therefore, in the current study, we used this method.
The definition of the level-2 fuzzy sets was formulated by Zadeh in [33] as follows: “The level-2 fuzzy set is such a fuzzy set, which membership grades assigned to the elements of the universal set are ordinary fuzzy sets.” The method developed in [28] was designed to solve decision making problems. Therefore, here, we will extend it for the solution of the multiobjective optimization problems.
Obviously, the solution of our nonlinear multiobjective optimization task can be provided only by the use of numerical methods. Therefore, when implementing such a method we will use the discrete finite set of alternatives a l k = ( { p i } , { q j } ) k , k = 1 to L, where L is the number of step of an algorithm (it is clear that in the optimization tasks we usually deal with the continuous sets of alternatives, but here we will use the discrete finite set to make our consideration more transparent). Such an algorithm provides the searching for the optimal alternative a l L o p t = ( { p i } , { q j } ) L o p t in the area p i p ^ i , q j q ^ j , i = 1 to N, j = 1 to M.
Then, suppose we deal with K different aggregating modes F l , l = 1 to K, and L alternatives a l k = ( { p i } , { q j } ) k , k = 1 to L. Let us assume that the membership functions μ ( E l ) , l = 1 to K, reflect the opinion of expert concerning proximity of considering aggregation mode E l to the some perfect (“ideal”) type of aggregation. The values of such membership functions may be assumed to be the relative reliabilities of aggregating modes. On the other hand, the “ideal” method of aggregation E i d e a l can be represented by the fuzzy set using the membership functions μ ( E l ) and the set of considered aggregating modes E l as follows:
E i d e a l = μ ( E l ) E l , l = 1 t o K .
Then, all E l can be formally defined on the set of considered alternatives a l k = ( { p i } , { q j } ) k , k = 1 to L, for which the values of E l ( a l k ) are factually calculated. In turn, the value of E l ( a l k ) may be naturally interpreted as an extent in which the alternative a l k fulfills the aggregated criterion E l or as a degree in which the alternative a l k pertains to a set of alternatives fulfilling E l .
E l = E l ( a l k ) a l k , k = 1 t o L .
Then, substituting (18) in (17) we get the expression for the E i d e a l in the form of level-2 fuzzy set; and with the use of operations defined on these fuzzy sets in [33], we finally obtain:
E i d e a l = μ i d e a l ( a l k ) a l k , k = 1 t o L ,
where
μ i d e a l ( a l k ) = max l ( μ ( E l ) · E l ( a l k ) ) .
Finally, the optimal alternative a l o p t can be obtained as the solution of the following non-linear fuzzy multiobjective problem:
max k μ i d e a l ( a l k ) .
For the solution of the formulated nonlinear fuzzy multiobjective optimization problem, we applied the direct random search method [34], which was adopted to take into account the features of our task. Obviously, there are many other contemporary optimization methods; e.g., genetic algorithms proposed in the literature. However, using different convincing examples, it is shown in [35] that if we deal with the nonlinear, non-differentiable, or non-smooth optimization problem the direct search methods provide the best results.
The developed algorithm of direct random search method has been implemented as follows:
  • In each kth random step, the alternative a l k = ( { p i } , { q j } ) k is randomly chosen in the area p i p ^ i , q j q ^ j .
  • For the chosen ( { p i } , { q j } ) k and the real-valued representations of p ^ r i j from (11)–(13), the profit P r k and product quantities { x i j } k are computed.
  • This allows us to obtain the value of the local criterion C p r ( P r k ) (14) and the values of E l ( a l k ) , l = 1 to K (15). Here, we consider only the weighted sum ( E 1 ), Yager’s ( E 2 ), and multiplicative ( E 3 ) aggregations.
  • Finally, from (20) we obtain the value of μ i d e a l ( a l k ) .
  • If μ i d e a l ( a l k ) > μ i d e a l ( a l k 1 ) , we consider the kth step of algorithm as the successful one. Then, continuing the procedure of random search, we, step by step, steadily approach the optimal μ i d e a l ( a l o p t ) .
The enlarged flowchart of the developed two phase method for multiobjective fuzzy distribution problem is presented in Figure 7.
Consider the numerical example.
Here we will use the Example 1 from Section 2 instead of fuzzy p ^ r i j and the real-valued representations p r i j . Since in our case, we deal with the symmetrical trapezoidal fuzzy profits p ^ r i j , the means of the trapezes were used.
In Table 9, the compromise solution of multiobjective fuzzy distribution problem based on the aggregation of aggregating modes is compared with the results that we got using the weighted sum ( E 1 ), Yager’s ( E 2 ), and multiplicative ( E 3 ) aggregating modes with the use of the adapted, direct random search method.
Based on the proposition justified in [28], the following reliability degrees of aggregating modes were used: μ ( E 1 ) = 0.15 , μ ( E 2 ) = 0.6 , μ ( E 3 ) = 0.25 .
Finally, comparing the results presented in Table 9, we can conclude that solution obtained using the aggregation of aggregating modes can be considered as a compromise one, because it is located in the domain of solutions we obtained solely by the comparing aggregating modes.

4. Conclusions

A two-phase method for the solution of multiojective fuzzy distribution problem was proposed. In the first stage, the straightforward numerical method for the solution of single-criterion fully fuzzy distribution problem (FFDP) was developed. The α -cut representation of fuzzy values, fuzzy operation rules, and the probability approach to the intervals and fuzzy values comparison are used as the main mathematical tools. These tools allow us to implement the straightforward fuzzy extension of the ordinary simplex method, which is used for the solution of the single-criterion FFDP. To validate the method, the fully fuzzy transportation problem with triangular fuzzy numbers was solved in the case of three sources and four destinations. The results were compared with those obtained by the competing method. As the base of comparison, the results of the single-criterion FFDP solution obtained with the use of Monte–Carlo method were also applied. To make the results of Monte–Carlo method and fuzzy approach we developed comparable, the frequency distributions of uncertain input parameters were transformed into trapezoidal fuzzy values, which were used in the solution of the single-criterion FFDP. Taking into account that the used data transformation leads inevitable to the loss of some information, the results of comparison of two considered approaches (fuzzy and Monte–Carlo ones) may be recognized as at least satisfactory ones. We can say that the fuzzy approach possesses some advantages when compared with Monte–Carlo method, mainly from the computing costs point of view.
The sensitivity analysis of our optimization model developed for the solution of FFDP was also carried out using numerical examples.
Finally, based on the provided studies, we can conclude that the method developed for the solution of FFDP has some advantages in comparison with the competing approach and may be used in applications.
In the second phase, the support of optimal fuzzy profit obtained at the first phase is treated as the range of attainable real-valued profits and used in the formulation of particular criterion of the overall profit maximization. The fuzzy constraints are interpreted as particular criteria of risk minimization. The generalized criterion was designed in the form of aggregation of relevant aggregating modes with the use of level-2 fuzzy sets. The aggregating modes represent different methods for aggregations of local criteria defining the overall profit and contract-violating risks. It was shown based the numerical example that the solution we obtained on the base of developed method for the aggregation of aggregating modes can be assumed as the compromise solution because it is located in the domain of solutions we obtained using solely the comparison of aggregation modes.
The main limitation of the approach developed for the solution of FDP is that in the first phase we obtain the fuzzy solution, whereas at the second one we get the real-valued solution of fuzzy multiobjective problem. Obviously, in our case the real-valued solution of fuzzy problem may be considered only as an approximate one due to possible loss of important information.
Therefore, our future studies will be focused on the finding of fuzzy solution of FDP formulated as a nonlinear fuzzy multiobjective problem.

Author Contributions

Conceptualization, K.K., L.D., and P.S.; methodology, K.K., L.D., and P.S.; software, K.K.; formal analysis, L.D. and P.S.; investigation, K.K. and L.D.; resources, K.K. and P.S.; data curation, L.D.; writing—original draft preparation, K.K., L.D. and P.S.; writing—review and editing, P.S.; visualization, L.D.; funding acquisition, P.S.

Funding

The project was financed under the program of the Polish Ministry of Science and Higher Education under the name “Regional Initiative of Excellence” in the years 2019—2022 project number 020/RID/2018/19, the amount of financing being 12,000,000.00 PLN.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Isermann, H. The enumeration of all efficient solution for a linear multiple-objective transportation problem. Nav. Res. Logist. Q. 1979, 26, 123–139. [Google Scholar] [CrossRef]
  2. Zimmermann, H.J. Fuzzy programming and linear programming with several objective functions. Fuzzy Sets Syst. 1978, 1, 45–55. [Google Scholar] [CrossRef]
  3. Jiménez, M.; Arenas, M.; Bilbao, A.; Rodríguez, M.V. Linear programming with fuzzy parameters: An interactive method resolution. Math. Comput. Model. 2007, 177, 1599–1609. [Google Scholar] [CrossRef]
  4. Galperin, E.A.; Ekel, P.Y. Synthetic Realization Approach to Fuzzy Global optimization via Gamma Algorithm. Math. Comput. Model. 2005, 41, 1457–1468. [Google Scholar] [CrossRef]
  5. Iskander, M.G. A computational comparison between two evaluation criteria in fuzzy multiobjective linear programs using possibility programming. Comput. Math. Appl. 2008, 55, 2506–2511. [Google Scholar] [CrossRef] [Green Version]
  6. Ammar, E.E.; Youness, E.A. Study on multiobjective transportation problem with fuzzy numbers. Appl. Math. Comput. 2005, 166, 241–253. [Google Scholar] [CrossRef]
  7. Islam, S.; Roy, T.K. A new fuzzy multi-objective programming: Entropy based geometric programming and its application of transportation problems. Eur. J. Oper. Res. 2006, 173, 387–404. [Google Scholar] [CrossRef]
  8. Kaur, J.; Kumar, A. Mehar’s method for solving fully fuzzy linear programming problems with L-R fuzzy parameters. Appl. Math. Model. 2013, 37, 7142–7153. [Google Scholar] [CrossRef]
  9. Kheirfam, B.; Verdegay, J.-L. The dual simplex method and sensitivity analysis for fuzzy linear programming with symmetric trapezoidal numbers. Optim. Decis. Mak. 2013, 12, 171–189. [Google Scholar] [CrossRef]
  10. Ozkoka, B.A.; Albayrak, I.; Kocken, H.G.; Ahlatcioglu, M. An approach for finding fuzzy optimal and approximate fuzzy optimal solution of fully fuzzy linear programming problems with mixed constraints. J. Intell. Fuzzy Syst. 2016, 31, 623–632. [Google Scholar] [CrossRef]
  11. Baykasoglu, A.; Subulan, K. An analysis of fully fuzzy linear programming with fuzzy decision variables through logistics network design problem. Knowl. Based Syst. 2015, 90, 165–184. [Google Scholar] [CrossRef]
  12. Baykasoglu, A.; Subulan, K. A direct solution approach based on constrained fuzzy arithmetic and metaheuristic for fuzzy transportation problems. Soft Comput. 2019, 23, 1667–1698. [Google Scholar] [CrossRef]
  13. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  14. Zimmermann, H.J.; Zysno, P. Latest connectives in human decision making. Fuzzy Sets Syst. 1980, 4, 37–51. [Google Scholar] [CrossRef]
  15. Kaufmann, A.; Gupta, M. Introduction to Fuzzy Arithmetic-Theory and Applications; Van Nostrand Reinhold Company: New York, NY, USA, 1985. [Google Scholar]
  16. Piegat, A. Fuzzy Modeling and Control. In Fuzziness and Soft Computing; Springer: Berlin, Germany, 2001. [Google Scholar]
  17. Jaulin, L.; Kieffer, M.; Didrit, O.; Walter, E. Applied Interval Analysis; Springer: London, UK, 2001. [Google Scholar]
  18. Moore, R.E. Interval Analysis; Prentice-Hall: Englewood Cliffs, NJ, USA, 1966. [Google Scholar]
  19. Sevastianov, P. Numerical methods for interval and fuzzy number comparison based on the probabilistic approach and Dempster-Shafer theory. Inf. Sci. 2007, 177, 4645–4661. [Google Scholar] [CrossRef]
  20. Wang, X.; Kerre, E.E. Reasonable properties for the ordering of fuzzy quantities (I). Fuzzy Sets Syst. 2001, 118, 375–385. [Google Scholar] [CrossRef]
  21. Wang, X.; Kerre, E.E. Reasonable properties for the ordering of fuzzy quantities (II). Fuzzy Sets Syst. 2001, 118, 387–405. [Google Scholar] [CrossRef]
  22. Wang, Y.M.; Yang, J.B.; Xu, D.L. A preference aggregation method through the estimation of utility intervals. Comput. Oper. Res. 2005, 32, 2027–2049. [Google Scholar] [CrossRef]
  23. Yager, R.R.; Detyniecki, M. Ranking fuzzy numbers using α-weighted valuations international journal of uncertainty. Fuzziness Knowl. Based Syst. 2000, 8, 573–591. [Google Scholar]
  24. Wadman, D.; Schneider, M.; Schnaider, E. On the use of interval mathematics in fuzzy expert system. Int. J. Intell. Syst. 1994, 9, 241–259. [Google Scholar]
  25. Sevastianov, P.; Róg, P. Two-objective method for crisp and fuzzy interval comparison in optimization. Comput. Oper. Res. 2006, 33, 115–131. [Google Scholar] [CrossRef]
  26. Bellman, R.; Zadeh, L. Decision-making in fuzzy environment. Manag. Sci. 1970, 17, 141–164. [Google Scholar] [CrossRef]
  27. Yager, R. Multiple objective decision-making using fuzzy sets. Int. J. Man-Mach. Stud. 1979, 9, 375–382. [Google Scholar] [CrossRef]
  28. Dimova, L.; Sevastjanov, P.; Sevastjanov, D. MCDM in a fuzzy setting: Investment projects assessment application. Int. J. Prod. Econ. 2006, 100, 10–29. [Google Scholar] [CrossRef]
  29. Dubois, D.; Koenig, J.L. Social choice axioms for fuzzy set aggregation. Fuzzy Sets Syst. 1991, 43, 257–274. [Google Scholar] [CrossRef]
  30. Mitra, G. Mathematical Models for Decision Support; NATO ASI Series; Springer: Berlin, Germany, 1988; pp. 17–53. [Google Scholar]
  31. Yager, R. On ordered weighted averaging aggregation operators in multicriteria decision making. IEEE Trans. Syst. Man Cybern. 1988, 18, 183–190. [Google Scholar] [CrossRef]
  32. Zimmermann, H.J.; Zysno, P. Decision and evaluations by hierarchical aggregation of information. Fuzzy Sets Syst. 1983, 104, 243–260. [Google Scholar] [CrossRef]
  33. Zadeh, L.A. Fuzzy logic and its application to approximate reasoning. Inf. Process. 1974, 74, 591–594. [Google Scholar]
  34. Törn, A.; Žilinskas, A. Global Optimization; Lecture Notes in Computer Science; Springer: Berlin, Germany, 1989. [Google Scholar]
  35. Ali, M.M.; Törn, A. Population set-based global algorithms: Some modifications and numerical studies. Comput. Oper. Res. 2004, 31, 1703–1725. [Google Scholar] [CrossRef] [Green Version]
Figure 1. Non trivial interval relations. (a) Overlapping case and (b) inclusion case.
Figure 1. Non trivial interval relations. (a) Overlapping case and (b) inclusion case.
Entropy 21 01214 g001
Figure 2. The distributing transactions.
Figure 2. The distributing transactions.
Entropy 21 01214 g002
Figure 3. The frequency distribution (a) and the membership function of fuzzy value (b) for the optimal x 11 .
Figure 3. The frequency distribution (a) and the membership function of fuzzy value (b) for the optimal x 11 .
Entropy 21 01214 g003
Figure 4. The frequency distribution (a) and the membership function of fuzzy value (b) for the optimal x 22 .
Figure 4. The frequency distribution (a) and the membership function of fuzzy value (b) for the optimal x 22 .
Entropy 21 01214 g004
Figure 5. The frequency distribution (a) and the membership function of fuzzy value (b) for the optimal x 33 .
Figure 5. The frequency distribution (a) and the membership function of fuzzy value (b) for the optimal x 33 .
Entropy 21 01214 g005
Figure 6. The frequency distribution f and the fuzzy number μ for optimized profit P ^ r : (a) Monte–Carlo method on the basis of 10,000 random steps. (b) Monte–Carlo method on the basis of one million random steps. (c) Membership function of the fuzzy solution.
Figure 6. The frequency distribution f and the fuzzy number μ for optimized profit P ^ r : (a) Monte–Carlo method on the basis of 10,000 random steps. (b) Monte–Carlo method on the basis of one million random steps. (c) Membership function of the fuzzy solution.
Entropy 21 01214 g006
Figure 7. The enlarged flowchart of the developed method.
Figure 7. The enlarged flowchart of the developed method.
Entropy 21 01214 g007
Table 1. Triangular fuzzy values of the model’s parameters.
Table 1. Triangular fuzzy values of the model’s parameters.
ParametersFuzzy ValuesParametersFuzzy Values
a ^ 1 [7.2, 8, 8.8] c ^ 11 [8, 10, 10.8]
a ^ 2 [12, 14, 16] c ^ 12 [20.4, 22, 24]
a ^ 3 [10.2, 12, 13.8] c ^ 13 [8, 10, 10.6]
b ^ 1 [6.2, 7, 7.8] c ^ 14 [18.8, 20, 22]
b ^ 2 [8.9, 10, 11.1] c ^ 21 [14, 15, 16]
b ^ 3 [6.5, 8, 9.5] c ^ 22 [18.2, 20, 22]
b ^ 4 [7.8, 9, 10.2] c ^ 23 [10, 12, 13]
c ^ 24 [6, 8, 8.8]
c ^ 31 [18.4, 20, 21]
c ^ 32 [9.6, 12, 13]
c ^ 33 [7.8, 10, 10.8]
c ^ 34 [14, 15, 16]
Table 2. Fuzzy efficient solutions on α -cuts.
Table 2. Fuzzy efficient solutions on α -cuts.
[ x ij ] α = 0 α = 0.5 α = 1
[ x 11 ] [6.2, 7.8][6.6, 7.4][7, 7]
[ x 13 ] [1, 1][1, 1][1, 1]
[ x 23 ] [4.2, 5.8][4.6, 5.4][5, 5]
[ x 24 ] [7.8, 10.2][8.4, 9.6][9, 9]
[ x 32 ] [8.9, 11.1][9.5, 10.6][10, 10]
[ x 33 ] [1.3, 2.7][1.7, 2.4][2, 2]
Table 3. Fuzzy efficient solutions on α -cuts (our method).
Table 3. Fuzzy efficient solutions on α -cuts (our method).
[ x ij ] α = 0 α = 0.5 α = 1
[ x 11 ] [6.4, 8.0][6.5, 7.1][7, 7]
[ x 13 ] [1, 1][1, 1][1, 1]
[ x 23 ] [4.0, 5.6][4.4, 5.6][5, 5]
[ x 24 ] [7.4, 10.3][8.2, 9.8][9, 9]
[ x 32 ] [8.6, 10, 9][9.6, 10.9][10, 10]
[ x 33 ] [1.1, 2.9][1.6, 2.6][2, 2]
Table 4. The values of model’s parameters.
Table 4. The values of model’s parameters.
The Means The Fuzzy Values
p 1 425 p ^ 1 [402, 420, 439, 444]
p 2 452 p ^ 2 [429, 447, 456, 471]
p 3 600 p ^ 3 [590, 598, 607, 622]
q 1 402 q ^ 1 [379, 397, 406, 421]
q 2 477 q ^ 2 [454, 472, 481, 496]
q 3 602 q ^ 3 [579, 597, 606, 613]
p r 11 290 p ^ r 11 [267, 285, 294, 309]
p r 12 510 p ^ r 12 [487, 505, 514, 529]
p r 13 505 p ^ r 13 [482, 500, 507, 524]
p r 21 395 p ^ r 21 [372, 390, 299, 314]
p r 22 565 p ^ r 22 [546, 564, 573, 585]
p r 23 283 p ^ r 23 [257, 273, 282, 297]
p r 31 295 p ^ r 31 [272, 290, 299, 314]
p r 32 401 p ^ r 32 [380, 398, 407, 422]
p r 33 615 p ^ r 33 [591, 609, 618, 633]
Table 5. The result of solution of fully fuzzy distribution problem (11)–(13).
Table 5. The result of solution of fully fuzzy distribution problem (11)–(13).
Solution’s ComponentsFuzzy Values
P ^ r o p t [591,000, 612,000, 900,000, 973,000]
x ^ 11 [205, 290, 445, 540]
x ^ 12 [37, 42, 53, 62]
x ^ 13 [5, 6, 8, 9]
x ^ 21 0
x ^ 22 [440, 470, 490, 518]
x ^ 23 [0, 1, 1, 2]
x ^ 31 0
x ^ 32 0
x ^ 33 [432, 500, 662, 727]
Table 6. The fuzzy values of model’s parameters.
Table 6. The fuzzy values of model’s parameters.
i p ^ i q ^ i
1[290, 295, 305, 320][320, 340, 360, 365]
2[200, 220, 270, 290][200, 240, 260, 280]
3[380, 390, 405, 430][200, 240, 260, 280]
4[420, 440, 460, 470][200, 240, 260, 280]
5 [120, 140, 160, 160]
6 [120, 140, 160, 160]
Table 7. The fuzzy values of model’s parameters.
Table 7. The fuzzy values of model’s parameters.
p ^ r ij
i/j123456
1[40, 90, 110, 120][250, 270, 290, 320][330, 330, 560, 370][200, 205, 215, 220][110, 120, 140, 160][260, 280, 300, 310]
2[60, 65, 75, 90][130, 150, 150, 170][200, 205, 215, 240][100, 120, 135, 150][30, 35, 45, 100][200, 200, 230, 270]
3[200, 220, 250, 260][320, 340, 355, 360][450, 460, 490, 490][360, 370, 390, 395][250, 260, 280, 330][400, 405, 415, 420]
4[30, 40, 60, 70][10, 10, 10, 50][220, 225, 240, 250][120, 130, 150, 150][70, 70, 90, 100][250, 260, 280, 290]
Table 8. The result of solution of fully fuzzy distribution problem (11)–(13) in the case of M = 4, N = 6.
Table 8. The result of solution of fully fuzzy distribution problem (11)–(13) in the case of M = 4, N = 6.
Solution’s ComponentsFuzzy Values
x ^ 12 [104, 129, 159, 214]
x ^ 13 [253, 293, 313, 333]
x ^ 21 [260, 300, 400, 440]
x ^ 32 [6, 123, 203, 273]
x ^ 34 [10, 240, 360, 500]
x ^ 35 [0, 6, 118, 298]
x ^ 41 [2, 20, 100, 140]
x ^ 45 [110, 130, 170, 190]
x ^ 46 [101, 176, 226, 291]
Table 9. The results of solution.
Table 9. The results of solution.
Pr opt p 1 p 2 p 3 q 1 q 2 q 3 x 11 x 12 x 13 x 21 x 22 x 23 x 31 x 32 x 33
μ i d e a l ( a l o p t ) 7458684274586134004875973654970485100662
E 1 ( a l o p t ) 7497104404506003804736033084800499000687
E 2 ( a l o p t ) 7438094214696204105026084085110468320679
E 3 ( a l o p t ) 7444604024306183954805802565000489000630

Share and Cite

MDPI and ACS Style

Kaczmarek, K.; Dymova, L.; Sevastjanov, P. A Two Phase Method for Solving the Distribution Problem in a Fuzzy Setting. Entropy 2019, 21, 1214. https://0-doi-org.brum.beds.ac.uk/10.3390/e21121214

AMA Style

Kaczmarek K, Dymova L, Sevastjanov P. A Two Phase Method for Solving the Distribution Problem in a Fuzzy Setting. Entropy. 2019; 21(12):1214. https://0-doi-org.brum.beds.ac.uk/10.3390/e21121214

Chicago/Turabian Style

Kaczmarek, Krzysztof, Ludmila Dymova, and Pavel Sevastjanov. 2019. "A Two Phase Method for Solving the Distribution Problem in a Fuzzy Setting" Entropy 21, no. 12: 1214. https://0-doi-org.brum.beds.ac.uk/10.3390/e21121214

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop