On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
暂无分享,去创建一个
This paper considers the inverse shortest paths problem where arc costs are subject to correlation constraints. The motivation for this research arises from applications in traffic modelling and seismic tomography. A new method is proposed for solving this class of problems. It is constructed as a generalization of the algorithm presented in Burton and Toint (Mathematical Programming 53, 1992) for uncorrelated inverse shortest paths. Preliminary numerical experience with the new method is presented and discussed.
[1] Donald B. Johnson,et al. Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.
[2] A. Tarantola,et al. Generalized Nonlinear Inverse Problems Solved Using the Least Squares Criterion (Paper 1R1855) , 1982 .
[3] Donald Goldfarb,et al. A numerically stable dual method for solving strictly convex quadratic programs , 1983, Math. Program..
[4] Philippe L. Toint,et al. On an instance of the inverse shortest paths problem , 1992, Math. Program..