Abstract
In urban transit network inquiry system, the optimal scheme of bus line having excessive transfers requires us to consider limiting the number of transfers when to compute the optimal scheme of bus line [1], which can come down to shortest path problem limiting the number of intermediate vertex. And support system of QoS (Quality-of-Service) is playing a more and more important role in communication network. QoS routing problem [2] is to choose transmission path meeting the requirements of QoS service to hop counts, bandwidth, latency, packet loss rate etc. and ensuring effective use of global network resources, which can come down to multi-constrained shortest path problem limiting the number of intermediate vertex. Shortest path problem limiting the number of intermediate vertex is shortest path problem with k-intermediate vertex constraints.
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
Zhang, X.F., Li, R.M., Li, H.F., Shi, Q.X.: A Traffic Assignment Problem and Model for Partially-Controlled Road Network. Highway Engineering 36, 11–14, 54 (2011)
Wang, X.W., Qin, P.Y., Huang, M.: ABC Supporting Qos Unicast Routing Scheme Based on The Artificial Fish Swarm. Chinese Journal of Computers 33, 718–725 (2010)
Zhou, K., Chen, J.: Simulation Dna Algorithm of Set Covering Problem. Applied Mathematics and Information Sciences 8, 139–144 (2014)
Hu, Y.M., Liu, W.M.: Multi-constrained Shortest Path Model and Solving. Journal of Hunan University of Science and Technology (Natural Science Edition) 25, 87–90 (2010)
Li, B.Y., He, Y., Yao, E.Y.: Shortest Path Problem with Constraints of Node’S Cost. Appl. Math. J. Chinese Univ. Ser. A. 15, 93–96 (2000)
He, F.G., Qi, H., Fan, Q.: Model and Algorithm of Random Shortest Path Problem with Constraints. Journal of Wuhan University of Technology (Transportation Science and Engineering) 32, 1125–1128 (2008)
She, X.Y.: The Shortest Path Algorithm With Constraints. Computer Applications and Software 26, 236–238, 265 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, C., Zhou, K. (2014). Shortest Path Problem with k-Intermediate Vertex Constraints. In: Pan, L., Păun, G., Pérez-Jiménez, M.J., Song, T. (eds) Bio-Inspired Computing - Theories and Applications. Communications in Computer and Information Science, vol 472. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45049-9_109
Download citation
DOI: https://doi.org/10.1007/978-3-662-45049-9_109
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-45048-2
Online ISBN: 978-3-662-45049-9
eBook Packages: Computer ScienceComputer Science (R0)