TREE OF FUZZY SHORTEST PATHS WITH THE HIGHEST QUALITY

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

KESHAVARZ ESMAILE; KHORRA ESMAILE

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: MATHEMATICAL SCIENCES Year:2010 | Volume:4 | Issue:1 Page(s): 67-86

Download Full-Text

View:

251

Download:

Cites:

Information Journal Paper

Title

TREE OF FUZZY SHORTEST PATHS WITH THE HIGHEST QUALITY

Author(s)

KESHAVARZ ESMAILE | KHORRA ESMAILE | Issue Writer Certificate

Keywords

SHORTEST PATH; FUZZY INTERVAL

BI-LEVEL PROGRAMMING

LABELING ALGORITHMS

PARAMETRIC SHORTEST PATH

Abstract

In this paper we present a network with a finite set of nodes and a set of imprecise arc lengths (costs) instead of real numbers. The imprecise lengths (costs) are modeled as fuzzy intervals with increasing membership functions (based on the quality), whereas the total cost of the shortest paths is a fuzzy interval with a decreasing linear membership function. To obtain a tree of fuzzy shortest paths from a source node to all other nodes, an algorithm is developed. By the max-min criterion suggested by Bellman and Zadeh, the fuzzy shortest path (with highest quality) problem can be treated as a mixed integer nonlinear programming problem. We show that this problem can be simplified into a BI-LEVEL PROGRAMMING problem that is easily solvable. An efficient algorithm, based on the PARAMETRIC SHORTEST PATH, is proposed for solving the BI-LEVEL PROGRAMMING problem. An illustrative example is also included to demonstrate our proposed algorithm.

Cites

No record.

References

Cite

APA: Copy

KESHAVARZ, ESMAILE, & KHORRA, ESMAILE. (2010). TREE OF FUZZY SHORTEST PATHS WITH THE HIGHEST QUALITY. MATHEMATICAL SCIENCES, 4(1), 67-86. SID. https://sid.ir/paper/322477/en

Vancouver: Copy

KESHAVARZ ESMAILE, KHORRA ESMAILE. TREE OF FUZZY SHORTEST PATHS WITH THE HIGHEST QUALITY. MATHEMATICAL SCIENCES[Internet]. 2010;4(1):67-86. Available from: https://sid.ir/paper/322477/en

IEEE: Copy

ESMAILE KESHAVARZ, and ESMAILE KHORRA, “TREE OF FUZZY SHORTEST PATHS WITH THE HIGHEST QUALITY,” MATHEMATICAL SCIENCES, vol. 4, no. 1, pp. 67–86, 2010, [Online]. Available: https://sid.ir/paper/322477/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops