Weighted Optimal Path in Graph with Multiple Indexes

This paper represents a technique for finding optimal paths with multiple indexes in a graph. Up to the present time, all optimal paths have been determined upon one index, say, distance for which an evaluation method exists. In this paper firstly we define multiple indexes for each edge in such a way that anyone can treat the factor for assigning an optimal path. Here, we use Data Envelopment Analysis (DEA) technique for designing a model that can identify optimal paths with multiple indexes, and separate them from the other paths.