论文信息 - A column generation method for inverse shortest path problems

A column generation method for inverse shortest path problems

In this paper we formulate an inverse shortest path problem as a special linear programming problem. A column generation scheme is developed that is able to keep most columns of the LP model implicit and to generate necessary columns by shortest path algorithms. This method can get an optimal solution in finitely many steps. Some numerical results are reported to show that the algorithm has a good performance.

[1] Hanif D. Sherali,et al. Linear Programming and Network Flows , 1977 .

[2] Didier Burton,et al. On the Inverse Shortest Path Problem , 1993 .

[3] Leon S. Lasdon,et al. Optimization Theory of Large Systems , 1970 .

[4] Hanif D. Sherali,et al. Linear programming and network flows (2nd ed.) , 1990 .

[5] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .

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

[7] Donald Goldfarb,et al. A numerically stable dual method for solving strictly convex quadratic programs , 1983, Math. Program..

[8] D. Burtony. On the Use of an Inverse Shortest Paths Algorithm for Recovering Linearly Correlated Costs , 1997 .

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

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