Abstract
A variety of different multi-agent (competitive) network models have been described in the literature. Computational techniques for solving such models often involve the iterative solution of “shortest” path subproblems. Unfortunately, the most theoretically interesting models involve nonlinear cost or utility functions and they give rise to nonadditive “shortest” path subproblems. This paper both describes some basic existence and uniqueness results for these subproblems and develops a heuristic for solving them.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ahuja, R.K., T.L. Magnanti and J.B. Orlin (1993), Network Flows Theory, Algorithms, and Applications. Prentice-Hall, New Jersey.
Bazaraa, M.S. and C.M. Shetty (1979), Nonlinear Programming Theory and Algorithms. John Wiley & Sons, New York.
Bernstein, D. and S.A. Gabriel (1997), “Solving the Nonadditive Traffic Equilibrium Problem,” in P.M. Pardalos, D.W. Hearn and W.W. Hager (Eds.,) Lecture Notes in Economics and Mathematical Systems Network Optimization Conference, pp. 72-102.
Chvátal, V. (1980), Linear Programming. W.H. Freeman and Company, New York.
Dial, R.B. (1979), “A Model and Algorithm for Multicriteria Route-Mode Choice,” Transportation Research, Col. 13B, 311-316.
Gabriel, S.A. and D. Bernstein (1997), “The Traffic Equilibriuim Problem with Nonadditive Costs,” Transportation Science, 31(4), 337–348.
Garfinkel, R.S. and G.L. Nemhauser (1972), Integer Programming. Wiley-Intersciences.
Geoffrion, A. (1974), “Lagrangian Relaxation for Integer Programming,” Mathematical Programming Study, 2, 82–114.
Handler, G.Y. and I. Zang (1980), “A Dual Algorithm for the Constrained Shortest Path Problem,” Networks, 10, 293–310.
Marathe, M. and R. Jacob (1998), Los Alamos National Laboratory, personal communication.
Mirchandani, P.B. and M.M. Wiecek (1993), “Routing with Nonlinear Multiattribute Cost Functions,” Applied Mathematics and Computation, 54, 215–239.
Pang, J.S. (1998), personal communication.
Rockafellar, R.T. (1984), Network Flows and Monotropic Optimization. John Wiley & Sons.
Scott K. and D. Bernstein (1997), “Solving a Best Path Problem When the Value of Time Function is Nonlinear,” presented at the Annual Meeting of the Transportation Research Board, preprint 980976.
Warburton, A.R. (1987), “Approximation of Pareto Optima in Multiple-Objective Shortest-Path Problems,” Operations Research, 35, 70–79.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gabriel, S.A., Bernstein, D. Nonadditive Shortest Paths: Subproblems in Multi-Agent Competitive Network Models. Computational & Mathematical Organization Theory 6, 29–45 (2000). https://doi.org/10.1023/A:1009621108971
Issue Date:
DOI: https://doi.org/10.1023/A:1009621108971