Abstract
Multi-Constrained Shortest Path (MCSP) selection is a fundamental problem in communication networks. Since the MCSP problem is NP-hard, there have been many efforts to develop efficient approximation algorithms and heuristics. In this paper, a new algorithm is proposed based on vectorial Autowave-Competed Neural Network which has the characteristics of parallelism and simplicity. A nonlinear cost function is defined to measure the autowaves (i.e., paths). The M-paths limited scheme, which allows no more than M autowaves can survive each time in each neuron, is adopted to reduce the computational and space complexity. And the proportional selection scheme is also adopted so that the discarded autowaves can revive with certain probability with respect to their cost functions. Those treatments ensure in theory that the proposed algorithm can find an approximate optimal path subject to multiple constraints with arbitrary accuracy in polynomial-time. Comparing experiment results showed the efficiency of the proposed algorithm.
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
Korkmaz, T., Krunz, M.: Multi-constrained optimal path selection. In: The 20th Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 2, pp. 834–843 (2001)
Xu, D., Chen, Y., Xiong, Y., Qiao, C.: On the Complexity of and Algorithms for Finding the Shortest Path With a Disjoint Counterpart. IEEE/ACM Trans. Networking 14, 147–158 (2006)
Wang, Z., Croweroft, J.: Quality-of-service routing for supporting multimedia appli-cations. IEEE J. Select. Area. Commun. 14, 1219–1234 (1996)
Jia, Z., Varaiya, P.: Heuristic Methods for Delay Constrained Least Cost Routing Using k-Shortest-Path. IEEE Trans. AC 17, 707–712 (2006)
Dumitrescu, I., Boland, N.: Improved Preprocessing, Labeling and Scaling Algorithms for the Weight-Constrained Shortest Path Problem. Networks 42, 135–153 (2003)
Jaffe, J.M.: Algorithm for finding paths with multiple constraints. Networks 14, 95–116 (1984)
Liu, J., Niu, Z., Zheng, J.: An improved routing algorithm subject to multiple constraints for ATM networks (in Chinese). ACTA ELECTRONICA SINICA 27, 4–8 (1999)
Dong, J., Wang, W., Zhang, J.: Accumulative competition neural network for shortest path tree computation. In: International Conference on Machine Learning and Cybernetics, vol. III, Xi’an China, pp. 1157–1161 (2003)
Dong, J., Zhang, J.: Accumulating Competition Neural Networks based Multiple Constrained Routing Algorithm. Control and Decision 19, 751–755 (2004)
Wang, Z.: On the complexity of quality of service routing. Information Processing Letters 69, 111–114 (1999)
Korkmaz, T., Krunz, M., Tragoudas, S.: An Efficient Algorithm for Finding a Path Subject to Two Additive Constraints. In: Proceedings of the ACM SIGMENTRICS, vol. 1, pp. 318–327 (2000)
Gelenbe, E., Liu, P., Laine, J.: Genetic algorithms for route discovery. IEEE Trans. on SMC–Part B 99, 1247–1254 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dong, J., Zhang, J., Chen, Z. (2007). Neural Network Based Algorithm for Multi-Constrained Shortest Path Problem. In: Liu, D., Fei, S., Hou, ZG., Zhang, H., Sun, C. (eds) Advances in Neural Networks – ISNN 2007. ISNN 2007. Lecture Notes in Computer Science, vol 4491. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72383-7_91
Download citation
DOI: https://doi.org/10.1007/978-3-540-72383-7_91
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72382-0
Online ISBN: 978-3-540-72383-7
eBook Packages: Computer ScienceComputer Science (R0)