Solving a Fuzzy Shortest Path Problem with Multiple Inputs and Outputs by using Data Envelopment Analysis

The shortest path problem where arc lengths are imprecise, because of its various applications, has attracted attention of many researchers. The existing fuzzy shortest path problems are limited to the consideration of unit of cost or profit along an arc while in many real applications several objectives are considered. In this paper, Data envelopment analysis (DEA) technique is applied for determining the efficient path with the maximum efficiency where several fuzzy attributes (cost, time, etc.) are necessary to be investigated in a fuzzy shortest path problem. Indeed, a fuzzy DEA approach is extended to establish an efficient path. In a numerical example, the proposed approach is illustrated.