International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 148 - Issue 6 |
Published: Aug 2016 |
Authors: Sagarika Biswal, S. P. Mohanty |
![]() |
Sagarika Biswal, S. P. Mohanty . Inverse Shortest Path in a Graph with Rough Edge Weights. International Journal of Computer Applications. 148, 6 (Aug 2016), 6-11. DOI=10.5120/ijca2016911143
@article{ 10.5120/ijca2016911143, author = { Sagarika Biswal,S. P. Mohanty }, title = { Inverse Shortest Path in a Graph with Rough Edge Weights }, journal = { International Journal of Computer Applications }, year = { 2016 }, volume = { 148 }, number = { 6 }, pages = { 6-11 }, doi = { 10.5120/ijca2016911143 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2016 %A Sagarika Biswal %A S. P. Mohanty %T Inverse Shortest Path in a Graph with Rough Edge Weights%T %J International Journal of Computer Applications %V 148 %N 6 %P 6-11 %R 10.5120/ijca2016911143 %I Foundation of Computer Science (FCS), NY, USA
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 is transformed into a deterministic counterpart which can be solved by any standard method.