An Inverse Shortest Path Problem on an Uncertain Graph

The inverse shortest path problem is to minimize the modification on the edge weights such that a predetermined path becomes the shortest one from the origin to the destination with respect to the new edge weights. In this paper, the inverse shortest path problem is considered on a graph with uncertain edge weights. It is shown that the model of the uncertain inverse shortest path problem can be transformed into a deterministic counterpart and then be solved efficiently. A numerical example is presented as well for illustration.

[1]  Qiang Wang,et al.  All-pairs Shortest Path Algorithm based on MPI+CUDA Distributed Parallel Programming Model , 2013, J. Networks.

[2]  P. Toint,et al.  The inverse shortest paths problem with upper bounds on shortest paths costs , 1997 .

[3]  Jörn Behrens,et al.  Inversion of seismic data using tomographical reconstruction techniques for investigations of laterally inhomogeneous media , 1984 .

[4]  Clemens Heuberger,et al.  Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results , 2004, J. Comb. Optim..

[5]  L. B. Fu,et al.  Expected Shortest Paths in Dynamic and Stochastic Traf c Networks , 1998 .

[6]  He Yong,et al.  Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values , 2006 .

[7]  Jianzhon Zhang,et al.  An inverse problem of the weighted shortest path problem , 1995 .

[8]  András Faragó,et al.  Inverse Optimization in High-speed Networks , 2003, Discret. Appl. Math..

[9]  Jianzhon Zhang,et al.  A further study on inverse linear programming problems , 1999 .

[10]  Liqun Qi,et al.  The shortest path improvement problems under Hamming distance , 2006, J. Comb. Optim..

[11]  C. Klein.  Fuzzy shortest paths , 1991 .

[12]  Xiaoyu Ji,et al.  New models for shortest path problem with fuzzy arc lengths , 2007 .

[13]  Chao Yang,et al.  A column generation method for inverse shortest path problems , 1995, Math. Methods Oper. Res..

[14]  Shuguo Wang,et al.  Algorithms for the Shortest Path Improvement Problems under Unit Hamming Distance , 2013, J. Appl. Math..

[15]  Baoding Liu,et al.  Uncertainty Theory - A Branch of Mathematics for Modeling Human Uncertainty , 2011, Studies in Computational Intelligence.

[16]  Yuan Gao,et al.  Shortest path problem with uncertain arc lengths , 2011, Comput. Math. Appl..

[17]  Dachuan Wei,et al.  An Optimized Floyd Algorithm for the Shortest Path Problem , 2010, J. Networks.

[18]  Wei Liu.  Uncertain Programming Models for Shortest Path Problem with Uncertain Arc Lengths , 2010 .

[19]  Baoding Liu.  Some Research Problems in Uncertainty Theory , 2009 .

[20]  Philippe L. Toint,et al.  On an instance of the inverse shortest paths problem , 1992, Math. Program..

[21]  Zhenhong Liu,et al.  A Strongly Polynomial Algorithm for the Inverse Shortest Arborescence Problem , 1998, Discret. Appl. Math..

[22]  H. Frank,et al.  Shortest Paths in Probabilistic Graphs , 1969, Oper. Res..