Inverse Shortest Path in a Graph with Rough Edge Weights

Sagarika Biswal, S. P.
2016 International Journal of Computer Applications  
The inverse shortest path problem occurs mostly in reconstruction type of problems where, minimum modifications of the edge weights of a network are made to make a predetermined path to be shortest. In this paper, initially the edge weights are taken as rough variables which, are based on the subjective estimation of the experts. Then these rough weights are approximated by normal uncertain variables and an uncertain programming model has been developed. Further, the uncertain programming model
more » ... is transformed into a deterministic counterpart which can be solved by any standard method.
doi:10.5120/ijca2016911143 fatcat:acpms3gi5zae5etl3s7oovqvsu