Abstract
Algorithms for generating shortest paths have been widely studied in the combinational optimisation literature for many years. More recently, the vector version, in which non-dominated paths are sought, has been investigated. Acyclic problems were discussed by Randolph and Ringeisen1 and Thuente.2 The bicriterion case was analysed by Hansen3 and extended by Climaco and Martins4 and Martins.5 A multicriterion algorithm was given by Martins.6 White7 used linear programming methodology but was forced to exclude non-dominated paths which were dominated by a convex combination of path lengths.
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
Randolf, P. and Ringeisen, R., Shortest paths through multiple criteria networks, Purdue University preprint, Indiana, 1976.
Thuente, D., Two algorithms for shortest paths through multiple criteria networks, Purdue University preprint, Indiana, 1979.
Hansen, P., Bicriterion path problems, in Fandel, G. and Gal.T.Eds. Multiple Criteria Decision Making Theory and Application, Springer-Verlag, 1980.
Climaco, J.C,N., Martins, E,Q,, A bicriterion shortest path algorithm, E.J.O.R. ZZ, 1982, pp. 399–404.
Martins, E.Q.V., On a special class of bicriterion path problems, E.J.O.R. 17, 1984, pp. 85–94.
Martins,E.Q.V., -On a multicriteria shortest path problem, E.J.O.R.Z6, 1984, pp. 236–245.
White, D.J., The set of efficient solutions for multiple objective shortest path problems, Computers and O.R. 9, pp. 101–107.
Hellman, R., On a routing problem, QUART.Appl.Math. Z6, 1958, pp 87–90.
White, D.J., Finite Dynamic Programming, Wiley, Chichester, England, 1978.
Yu, P.L. and Seiford, L., Multistage decision problems with multiple criteria, in Nijkamp, P. and Sprônk, J., Eds., Multiple Criteria Analysis, Gower, Aldershot, England, 1981.
Hartley, R., Survey of algorithms for vector optimisation problems, in French, S. et. al., Multi-objective decision making, Academic Press, New York, 1983.
White, D. J. Generalised efficient solutions for sums of sets, Opus, Res. 28, 1980, pp. 844–846.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Wien
About this chapter
Cite this chapter
Hartley, R. (1985). Vector Optimal Routing by Dynamic Programming. In: Serafini, P. (eds) Mathematics of Multi Objective Optimization. International Centre for Mechanical Sciences, vol 289. Springer, Vienna. https://doi.org/10.1007/978-3-7091-2822-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-7091-2822-0_10
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-81860-2
Online ISBN: 978-3-7091-2822-0
eBook Packages: Springer Book Archive