- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Recently Accepted Articles ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents
Advances in Fuzzy Systems
Volume 2012 (2012), Article ID 646248, 6 pages
Fuzzy Shortest Path Problem Based on Level -Triangular LR Fuzzy Numbers
Department of Mathematics, Auxilium College (Autonomous), Tamil Nadu, Vellore 632006, India
Received 15 April 2011; Accepted 1 October 2011
Academic Editor: Uzay Kaymak
Copyright © 2012 S. Elizabeth and L. Sujatha. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
In problems of graphs involving uncertainties, the fuzzy shortest path problem is one of the most studied topics, since it has a wide range of applications in different areas and therefore deserves special attention. In this paper, algorithms are proposed for the fuzzy shortest path problem, where the arc length of the network takes imprecise numbers, instead of real numbers, namely, level -triangular LR fuzzy numbers. Few indices defined in this paper help to identify the shortest path in fuzzy environment.
Many researchers have focused on fuzzy shortest path problem in a network, since it is important to many applications such as communications, routing, and transportation. In traditional shortest path problems, the arc length of the network takes precise numbers, but in the real-world problem, the arc length may represent transportation time or cost which can be known only approximately due to vagueness of information, and hence it can be considered a fuzzy number. The fuzzy set theory, proposed by Zadeh , is utilized to deal with uncertainty problems.
The fuzzy shortest path problem was first analysed by Dubois and Prade . According to their approach, the shortest path length can be obtained, but the corresponding path in the network may not exist. Klein  proposed a dynamic programming recursion-based fuzzy algorithm. Lin and Chern  found the fuzzy shortest path length in a network by means of a fuzzy linear programming approach. Okada and Soper  proposed a fuzzy algorithm, which was based on multiple-labelling methods to offer nondominated paths to a decision maker. Chuang and Kung  proposed a fuzzy shortest path length procedure that can find a fuzzy shortest path length among all possible paths in a network. Yao and Lin  presented two new types of fuzzy shortest path network problems. The main results obtained from their studies were that the shortest path in the fuzzy sense corresponds to the actual paths in the network, and the fuzzy shortest path problem is an extension of the crisp case. Nayeem and Pal  have proposed an algorithm based on the acceptability index introduced by Sengupta and Pal  which gives a single fuzzy shortest path or a guideline for choosing the best fuzzy shortest path according to the decision maker’s viewpoint. Thus, numerous papers have been published on the fuzzy shortest path problem (FSPP).
This paper is organized as follows. In Section 2, some elementary concepts and operations of fuzzy set theory have been reviewed. Also new indices have been defined for level -triangular LR fuzzy numbers. In Section 3, new algorithms have been proposed for fuzzy shortest path problem based on level -triangular LR indices. Finally, the paper is concluded in Section 4.
Definition 1 (Acyclic digraph). A digraph is a graph each of whose edges are directed. Hence, an acyclic digraph is a directed graph without cycle.
Definition 2 (Level -triangular LR fuzzy number). Level -triangular LR fuzzy number is shown in Figure 1 and it is represented by with the membership function Here, is the point whose membership value is , where and are the left hand and right hand spreads, respectively. In addition, let be the triangular LR fuzzy number, and it is denoted by .
Definition 3 (Addition operation on level -triangular LR fuzzy numbers). Let and be the two level -triangular LR fuzzy numbers, then
Definition 4 (Minimum operation on level -triangular LR fuzzy numbers ). Let and be the two level -triangular LR fuzzy numbers, then
In this paper, we introduce the following definitions.
Definition 5 (Level -triangular LR intersection index). Let the level -triangular LR ith fuzzy path length be , and let the level -triangular LR fuzzy shortest length be , where , , , then the level -triangular LR intersection index between and is calculated as
The above formula is obtained as follows.
Consider Figure 2:
Let be the membership function.
For , For , Equating (5) and (6), In the level -triangular LR intersection index, we have if and only if .
Definition 6 (Indices based on and ). Let the level -triangular LR th fuzzy path length be , and let the level -triangular LR fuzzy shortest length be , where , , , then(a)the level -triangular LR weighted average index between and is calculated as
Here, we have if and only if ,(b) the level -triangular LR Minkowski distance index between and is calculated as
where denotes and . Here, we have if and only if .
Generalizing Hamming distance and Euclidean distance results in Minkowski distance. It becomes the Hamming distance (HD) for , while the Euclidean distance (ED) for .
Definition 7 (Indices based on ). Let the level -triangular LR ith fuzzy path length be , then(a)the level -triangular LR mean index for is calculated as It is obtained as follows:(b) the level -triangular LR centroid index for is calculated as It is obtained as follows:
Crisp Graph with Fuzzy Weights (Type V) (Blue et al. )
A fifth type of graph fuzziness occurs when the graph has known vertices and edges, but unknown weights (or capacities) on the edges. Thus, only the weights are fuzzy.
To plan the quickest automobile route from one city to another. Unfortunately, the map gives distances, not travel times, so it is not known exactly how long it takes to travel any particular road segment.
Definition 8 (The signed distance ). when , where means the signed distance of measuring from 0.
Definition 9 (Signed distance of level -triangular fuzzy number ). For each and , the signed distance from 0 to is defined by
The ranking of level -triangular fuzzy numbers is defined by if and only if .
For the sake of verification, Definition 9 is rewritten as the signed distance from 0 to , and it is defined by Here, if and only if .
Definition 10 (Nayeem and Pal acceptability index ). Nayeem and Pal extended the acceptability index originally proposed by Sengupta and Pal  for interval numbers to triangular LR fuzzy numbers as follows.
If and are two triangular LR fuzzy numbers with , , , then the acceptability index of the proposition “” preferred to “” is given by . Here, if and only if .
To find the fuzzy shortest path, the above acceptability index was slightly modified in  as follows: where is the triangular LR th fuzzy path length, and is the triangular LR fuzzy shortest length. Here, if and only if .
The acceptability index defined in  was obtained as follows.
Definition 11 (Triangular LR fuzzy number ). A fuzzy number is of LR type if there exists a reference function (for left) and (for right) and scalar , with
where “” is a real number whose membership value is 1, and are called the left and right spreads, respectively. Symbolically, is represented by .
Consider Figure 3:
if , If , Equating (18) and (19), This acceptability index can also be defined for level -triangular LR fuzzy numbers as follows: where and , for the sake of verification. If , we obtain the acceptability index defined in .
3. Proposed Algorithm for Fuzzy Shortest Path Problem Based on Level λ-Triangular LR Fuzzy Numbers
In many practical situations, we often need to employ a measurement tool to distinguish between two similar sets or groups. For this purpose, several similarity measures had been presented in [13–19].
In this paper, we introduce a new method called intersection index which acts as the measurement tool between and . The larger the height of the intersection area of two triangles, the higher the intersection index will be between them. If there is no intersection area between and , then the intersection index is treated as zero. As mentioned previously, the similarity measure, namely, intersection index defined in Definition 5 will help the decision makers to decide which path is the shortest one. Using this concept, we now propose Algorithm 1 for FSPP.
Example 12. Step 1. Construct a network with 6 vertices and 7 edges as cited in Figure 4.
Assume the arc lengths as
(1-2) , (1-3) ,
(2-4) , (2-5) ,
(3-5) , (4-6) ,
(5-6) .Step 2. The possible paths and the corresponding path lengths are as follows:
: 1-2-4-6 with ,
: 1-2-5-6 with ,
: 1-3-5-6 with .Step 3. .Step 4. See Table 1.Step 5. Path , that is 1-3-5-6, is the fuzzy shortest path since it has the highest level -triangular LR intersection index, and the corresponding shortest path length is .
3.1. Comparing the Results Based on Level -Triangular LR Intersection Index with Few Indices Defined in This Paper
Example 13. Steps 1 and 2
They are the same as in Example 12.Step 3. See Table 4.Step 4. Path , that is 1-3-5-6, is identified as the shortest path, since it has the minimum level -triangular LR mean and centroid index, and the corresponding shortest path length is .
3.2. Results and Discussions
One way to verify the solution obtained is to make an exhaustive comparison, now comparing the result obtained in this paper with the existing results to generalize our proposed approach. See Tables 5 and 6.
Hence, we find that the solution obtained for FSPP in this paper coincides with the solution of the existing methods.
Fuzzy shortest path length and the shortest path are the useful information for the decision makers in a fuzzy shortest path problem. Due to its practical application, many researchers have focused on the fuzzy shortest path problem, and some algorithms were developed for the same. Hence, in this paper, we have defined few indices and developed the new algorithms based on them and verified with the existing methods. The ranking given to the paths is helpful for the decision makers as they make decision in choosing the best of all the possible path alternatives. Hence, we conclude that the algorithms developed in the current research are the simplest and the alternative method for getting the shortest path in fuzzy environment.
The authors are grateful to the referees for their suggestions to improve the presentation of the paper.
- L. A. Zadeh, “Fuzzy sets as a basis for a theory of possibility,” Fuzzy Sets and Systems, vol. 1, no. 1, pp. 3–28, 1978.
- D. Dubois and H. Prade, Fuzzy Sets and Systems: Theory and Applications, Academic Press, New York, NY, USA, 1980.
- C. M. Klein, “Fuzzy shortest paths,” Fuzzy Sets and Systems, vol. 39, no. 1, pp. 27–41, 1991.
- K. C. Lin and M. S. Chern, “The fuzzy shortest path problem and its most vital arcs,” Fuzzy Sets and Systems, vol. 58, no. 3, pp. 343–353, 1993.
- S. Okada and T. Soper, “A shortest path problem on a network with fuzzy arc lengths,” Fuzzy Sets and Systems, vol. 109, no. 1, pp. 129–140, 2000.
- T. N. Chuang and J. Y. Kung, “The fuzzy shortest path length and the corresponding shortest path in a network,” Computers and Operations Research, vol. 32, no. 6, pp. 1409–1428, 2005.
- J. S. Yao and F. T. Lin, “Fuzzy shortest-path network problems with uncertain edge weights,” Journal of Information Science and Engineering, vol. 19, no. 2, pp. 329–351, 2003.
- S. M. A. Nayeem and M. Pal, “Shortest path problem on a network with imprecise edge weight,” Fuzzy Optimization and Decision Making, vol. 4, no. 4, pp. 293–312, 2005.
- A. Sengupta and T. K. Pal, “On comparing interval numbers,” European Journal of Operational Research, vol. 127, no. 1, pp. 28–43, 2000.
- L. Sujatha and R. Sattanathan, “Fuzzy shortest path problem based on triangular LR type fuzzy number using acceptability index,” International Journal of Engineering and Technology, vol. 6, pp. 575–578, 2009.
- M. Blue, B. Bush, and J. Puckett, “Unified approach to fuzzy graph problems,” Fuzzy Sets and Systems, vol. 125, no. 3, pp. 355–368, 2002.
- K. P. Sudhir and P. Rimple, Fuzzy Sets and Their Applications, Pragati Prakashan, Meerut, India, 1st edition, 2006.
- M. I. Henig, “Efficient interactive methods for a class of multiattribute shortest path problems,” Management Science, vol. 40, no. 7, pp. 891–897, 1994.
- L. K. Hyung, Y. S. Song, and K. M. Lee, “Similarity measure between fuzzy sets and between elements,” Fuzzy Sets and Systems, vol. 62, no. 3, pp. 291–293, 1994.
- X. C. Liu, “Entropy, distance measure and similarity measure of fuzzy sets and their relations,” Fuzzy Sets and Systems, vol. 52, no. 3, pp. 305–318, 1992.
- C. P. Pappis and N. I. Karacapilidis, “A comparative assessment of measures of similarity of fuzzy values,” Fuzzy Sets and Systems, vol. 56, no. 2, pp. 171–174, 1993.
- J. Ramík and J. Rímánek, “Inequality relation between fuzzy numbers and its use in fuzzy optimization,” Fuzzy Sets and Systems, vol. 16, no. 2, pp. 123–138, 1985.
- H. Tanaka, H. Ichihashi, and K. Asai, “A formulation of fuzzy linear programming problem based on comparison of fuzzy numbers,” Control and Cybernetics, vol. 13, pp. 185–194, 1984.
- W. J. Wang, “New similarity measures on fuzzy sets and on elements,” Fuzzy Sets and Systems, vol. 85, no. 3, pp. 305–309, 1997.