Neural Network Based Algorithm for Multi-Constrained Shortest Path Problem

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 Mautowaves 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.

[1]  E. Gelenbe,et al.  Genetic Algorithms for Route Discovery , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[2]  Pravin Varaiya,et al.  Heuristic methods for delay constrained least cost routing using /spl kappa/-shortest-paths , 2006, IEEE Transactions on Automatic Control.

[3]  Spyros Tragoudas,et al.  An efficient algorithm for finding a path subject to two additive constraints , 2002, Comput. Commun..

[4]  Marwan Krunz,et al.  Multi-constrained optimal path selection , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[5]  Niu Zhi,et al.  An Improved Routing Algorithm Subject to Multiple Constraints for ATM Networks , 1999 .

[6]  Chunming Qiao,et al.  On the complexity of and algorithms for finding the shortest path with a disjoint counterpart , 2006, IEEE/ACM Transactions on Networking.

[7]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[8]  Ji-Yang Dong,et al.  Accumulative competition neural network for shortest path tree computation , 2003, Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693).

[9]  Natashia Boland,et al.  Improved preprocessing, labeling and scaling algorithms for the Weight‐Constrained Shortest Path Problem , 2003, Networks.

[10]  Zheng Wang,et al.  On the Complexity of Quality of Service Routing , 1999, Inf. Process. Lett..

[11]  Jeffrey M. Jaffe,et al.  Algorithms for finding paths with multiple constraints , 1984, Networks.