An acceptability index based approach for solving shortest path problem on a network with interval weights

Based on the acceptability index for comparison of any two imprecise values, efficient algorithms have been proposed in literature solving shortest path (SP) problem when weights connected arcs a transportation network are represented as interval numbers. In this study, generalized Dijkstra algorithm is to handle SP with weights. Here it shown that once chosen, converted into crisp one, which easily solved by standard algorithms. The main contribution here reduction computational complexity existing problem. To show advantages over numerical example presented using and obtained results discussed. Moreover, an small sized telecommunication provided illustrate potential application method. Finally, practical relevance evaluated means large scale pilot case where pharmaceutical shipment between cities Iran should be transported.