Sensitivity analysis for fuzzy shortest path problem

4Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The shortest path problem is an optimization problem in which the best path between two considered objects is searched for in accordance with an optimization criterion, which has to be minimized. In this paper this problem is investigated in the case when the distances between the nodes are fuzzy numbers. The problem is formulated as a linear optimization problem with fuzzy coeffcients in the objective function. This problem is solved using crisp parametric two-criterial linear optimization. Special emphasis is given to the sensitivity of the solution with respect to the fuzzy objective function coeffcients. © 2006 Springer.

Cite

CITATION STYLE

APA

Starostina, T., & Dempe, S. (2006). Sensitivity analysis for fuzzy shortest path problem. Advances in Soft Computing, 33, 695–702. https://doi.org/10.1007/3-540-31182-3_64

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free