SOLVING BEST PATH PROBLEM ON MULTIMODAL TRANSPORTATION NETWORKS WITH FUZZY COSTS

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.

GOLNARKAR A.; ALE SHEYKH A.A.; MALEK M.R.

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

Journal Paper

Paper Information

Journal: Iranian Journal of Fuzzy Systems Year:2010 | Volume:7 | Issue:3 Page(s): 1-13

Download Full-Text

View:

320

Download:

186

Cites:

Information Journal Paper

Title

SOLVING BEST PATH PROBLEM ON MULTIMODAL TRANSPORTATION NETWORKS WITH FUZZY COSTS

Author(s)

GOLNARKAR A. | ALE SHEYKH A.A. | MALEK M.R. | Issue Writer Certificate

Keywords

Not Registered.

Abstract

Numerous algorithms have been proposed to solve the shortest path problem; many of them consider a single-mode network and crisp costs. Other attempts have addressed the problem of fuzzy costs in a single-mode network, the so-called fuzzy shortest-path problem (FSPP). The main contribution of the present work is to solve the optimum path problem in a multimodal transportation network, in which the costs of the arcs are fuzzy values. Metropolitan transportation systems are multimodal in that they usually contain multiple modes, such as bus, metro, and monorail. The proposed algorithm is based on the path algebra and dioid of k-shortest fuzzy paths. The approach considers the number of mode changes, the correct order of the modes used, and the modeling of two-way paths. An advantage of the method is that there is no restriction on the number and variety of the services to be considered. To track the algorithm step by step, it is applied to a pseudo-multimodal network.

Cites

No record.

References

No record.

Cite

APA: Copy

GOLNARKAR, A., ALE SHEYKH, A.A., & MALEK, M.R.. (2010). SOLVING BEST PATH PROBLEM ON MULTIMODAL TRANSPORTATION NETWORKS WITH FUZZY COSTS. IRANIAN JOURNAL OF FUZZY SYSTEMS, 7(3), 1-13. SID. https://sid.ir/paper/557371/en

Vancouver: Copy

GOLNARKAR A., ALE SHEYKH A.A., MALEK M.R.. SOLVING BEST PATH PROBLEM ON MULTIMODAL TRANSPORTATION NETWORKS WITH FUZZY COSTS. IRANIAN JOURNAL OF FUZZY SYSTEMS[Internet]. 2010;7(3):1-13. Available from: https://sid.ir/paper/557371/en

IEEE: Copy

A. GOLNARKAR, A.A. ALE SHEYKH, and M.R. MALEK, “SOLVING BEST PATH PROBLEM ON MULTIMODAL TRANSPORTATION NETWORKS WITH FUZZY COSTS,” IRANIAN JOURNAL OF FUZZY SYSTEMS, vol. 7, no. 3, pp. 1–13, 2010, [Online]. Available: https://sid.ir/paper/557371/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops