Abstract
We examine the computational complexity of the inverse shortest paths problem with upper bounds on shortest path costs, and prove that obtaining a globally optimum solution to this problem is NP-complete. An algorithm for finding a locally optimum solution is proposed, discussed and tested.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Bellman “On a routing problem„ Quart. Appl. Math. 16 pp. 87–90 1958
D.P. Bertsekas, “An auction algorithm for shortest paths„, SIAM Journal on Optimization, vol. 1(4), pp. 425–447, 1991
P.H.L. Bovy and E. Stern, “Route Choice: Wayfinding in Transport Networks“, Kluwer Academic Publishers, Dordrecht, 1990
D. Burton and Ph. L. Toint, “[atOn an instance of the inverse shortest paths problem„, Mathematical Programming, vol. 53, pp. 45–61, 1992
D. Burton and Ph. L. Toint, “On the use of an inverse shortest paths algorithm for recovering linearly correlated costs“, Mathematical Programming, vol. 63, pp. 1–22, 1994
S. Cook, “The complexity of Theorem Proving Procedures“, Proc. 3rd Ann. ACM Symp. on Theory of Computing, Association for Computing Machinery, New York, 151–158, 1971
E.W. Dijkstra, “A note on two problems in connexion with graphs„, Numerische Mathematik, vol. 1, pp. 269–271, 1959
S.M. Easa, “Shortest route with movement prohibition„, Transportation Research B, vol. 19, 3, pp. 197–208, 1985
L.R. Ford, “Network flow theory„, Report P-923, Rand Corp., Santa Monica, CA, 1956
D. Goldfarb and A. Idnani, “A Numerically Stable Dual Method for Solving Strictly Convex Quadratic Programs„, Mathematical Programming, vol. 27, pp. 1–33, 1983
M.R. Garey and D.S. Johnson, “Computers and intractability. A guide to the theory of NP-Completeness„, W.H. Freeman and Company, San Fransisco, 1979
D.B. Johnson, “Efficient algorithms for shortest paths in sparse networks„, J. Assoc. Comput. Mach., vol. 24, pp. 1–13, 1977
A. K. Louis and F. Natterer, “Mathematical problems of computerized tomography„, Proc. IEEE, vol. 71, no 3, pp. 379–389, 1983
P. Mirchandani and H. Soroush, “Generalized Traffic Equilibrium with Probabilistic Travel Times and Perceptions„, Transportation Science, vol. 21, no 3, pp. 133–152, 1987
E.F. Moore, “The shortest path through a maze„, in Proceedings of the International Symposium on the Theory of Switching, Part II, 1957, Harvard University, Cambridge, MA, pp. 292–295, 1959
T.J. Moser, “Shortest path calculation of seismic rays„, Geophysics, vol. 56, pp. 59–67, 1991
T.J. Moser, “The shortest path method for seismic ray tracing in complicated media„, Ph.D. Thesis, Rijksuniversiteit Utrecht, 1992
V.E. Outram and E. Thompson, “Driver’s perceived cost in route choice“, Proceedings — PTRC Annual Meeting, London, pp. 226–257, 1978
P.M. Pardalos (ed.), “Complexity in Numerical Optimization„, World Scientific, 1993
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Burton, D., Pulleyblank, W.R., Toint, P.L. (1997). The inverse shortest paths problem with upper bounds on shortest paths costs. In: Pardalos, P.M., Hearn, D.W., Hager, W.W. (eds) Network Optimization. Lecture Notes in Economics and Mathematical Systems, vol 450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59179-2_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-59179-2_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62541-4
Online ISBN: 978-3-642-59179-2
eBook Packages: Springer Book Archive