Hostname: page-component-7bb8b95d7b-w7rtg Total loading time: 0 Render date: 2024-09-21T06:46:14.665Z Has data issue: false hasContentIssue false
  • English
  • Français

The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets

Published online by Cambridge University Press:  15 July 2002

T. Brian Boffey ,
R. C. Williams ,
B. Pelegrín  and
P. Fernandez
T. Brian Boffey
Affiliation:
University of Liverpool, Liverpool L69 7ZL, U.K.
R. C. Williams
Affiliation:
University of Abertay, Dundee, U.K.
B. Pelegrín
Affiliation:
University of Murcia, Murcia, Spain.
P. Fernandez
Affiliation:
University of Murcia, Murcia, Spain.
Get access

Abstract

Individual items of flow in a telecommunications or a transportation network may need to be separated by a minimum distance or time, called a “headway”. If link dependent, such restrictions in general have the effect that the minimum time path for a “convoy” of items to travel from a given origin to a given destination will depend on the size of the convoy. The Quickest Path problem seeks a path to minimise this convoy travel time. A closely related bicriterion problem is the Maximum Capacity Shortest Path problem. For this latter problem, an effective implementation is devised for an algorithm to determine desired sets of efficient solutions which in turn facilitates the search for a “best” compromise solution. Numerical experience with the algorithm is reported.

Keywords

Quickest pathshortest pathpath capacityefficient solution.
Type
Research Article
Information
RAIRO - Operations Research , Volume 36 , Issue 1 , January 2002 , pp. 1 - 19
Copyright
© EDP Sciences, 2002

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Boffey, T.B., Multiobjective routing problems. TOP 3 (1995) 167-220. CrossRef
T.B. Boffey, Distributed Computing: associated combinatorial problems. McGraw-Hill (1992).
Boffey, T.B., Efficient solution generation for the Bicriterion Routing problem. Belg. J. Oper. Res. Statist. Comput. Sci. 39 (2000) 3-20.
Chen, G.-H. and Hung, Y.-C., On the quickest path problem. Inform. Process. Lett. 46 (1993) 125-128. CrossRef
Chen, G.-H. and Hung, Y.-C., Algorithms for the constrained quickest path problem and the enumeration of quickest paths. Comput. Oper. Res. 21 (1994) 113-118.
Chen, Y.L. and Chin, Y.H., The quickest path problem. Comput. Oper. Res. 17 (1990) 179-188.
Chen, Y.L., An algorithm for finding the k quickest paths in a network. Comput. Oper. Res. 20 (1993) 59-65. CrossRef
Chen, Y.L., Finding the k quickest simple paths in a network. Inform. Process. Lett. 50 (1994) 89-92. CrossRef
J.L. Cohon, Multiobjective Programming and Planning. Academic Press (1978).
Current, J.R., ReVelle, C.S. and Cohon, J.L., The maximum covering/shortest path problem: A multiobjective network design and routing problem. EJOR 21 (1985) 189-199. CrossRef
Dai, J.S., Wang, S.N. and Yang, X.Y., The multichannel quickest path problem. Int. J. Systems Sci. 25 (1994) 2047-2056. CrossRef
Denardo, E.V. and Fox, B.L., Shortest-route methods: 1. Reaching, pruning, and buckets. Oper. Res. 27 (1979) 161-186. CrossRef
Dial, R., Glover, F., Karney, D. and Klingman, D., A computational analysis of alternative algorithms and labelling techniques for finding shortest path trees. Networks 9 (1974) 215-248. CrossRef
Dijkstra, E.W., A note on two problems in connection with graphs. Numer. Maths 1 (1959) 269-271. CrossRef
Fredman, M.L. and Tarjan, R.E., Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34 (1987) 596-615. CrossRef
Hart, P., Nilsson, N. and Raphael, B., A formal basis for the heuristic determination of minimal cost paths. IEEE Trans Syst. Man. Cybernet. 4 (1968) 100-107.
Hung, Y.-C., Distributed algorithms for the constrained routing problem in computer networks. Computer Communications 21 (1998) 1476-1485. CrossRef
Y.-C. Hung and G.-H. Chen, On the quickest path problem. Springer, Lecture Notes in Comput. Sci. 46 (1991).
Hung, Y.-C. and Chen, G.-H., Distributed algorithms for the quickest path problem. Parallel Comput. 18 (1992) 823-834. CrossRef
Hung, Y.-C. and Chen, G.-H., Algorithms for the constrained quickest path problem and the enumeration of quickest paths. Comput. Oper. Res. 21 (1994) 113-118.
Y.-C. Hung and G.-H. Chen, The quickest path problem in distributed computing systems. Springer, Lecture Notes in Comput. Sci. 579 (1992).
D. Kagaris, G.E. Pantziou, S. Tragoudis and C.D. Zaroliagis, On the computation of fast data transmission in networks with capacities and delays. Springer, New York, Lecture Notes in Comput. Sci. 955 (1995) 291-302.
Lee, D. and Papadopolou, E., The all-pairs quickest path problem. Inform. Process. Lett. 45 (1993) 261-267. CrossRef
Leland, W.E., Taqqu, M.S., Willinger, W. and Wilson, D.V., On the self-similar nature of Ethernet traffic. IEEE/ACM Trans. Networking 2 (1994) 1-15. CrossRef
Moore, M.H., On the fastest route for convoy-type traffic in flowrate-constrained networks. Transportation Sci. 10 (1976) 113-124. CrossRef
Nemhauser, G.L., A generalized permanent label setting algorithm for the shortest path between specified nodes. J. Math. Anal. Appl. 38 (1972) 328-334. CrossRef
V. Paxson and S. Floyd, Wide-area traffic: The failure of Poisson modelling. Proc. ACM Sigcomm '94 (1995) 149-160.
Perko, A., Implementation of algorithms for k shortest loopless paths. Networks 16 (1987) 149-160. CrossRef
Rosen, J.B., Sun, S.-Z. and Xue, G.-L., Algorithms for the quickest path problem and the enumeration of quickest paths. Comput. Oper. Res. 18 (1991) 579-584. CrossRef
R.E. Steuer, Multiple Criteria Optimization: Theory, Computation and Applications. Wiley (1986).