Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach

The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow occurs from a source node to a destination node in a certain direction subject to a cost constraint. In this paper, a new approach for dealing with this problem is proposed. The proposed algorithm uses a special way to build valid solutions and an improvement technique to adjust the path. Some numerical experiments are performed using randomly generated networks having 25-200 nodes. Empirical results are compared with the results obtained using genetic algorithms which is an established technique for solving networking problems

[1]  Chi-Chun Lo,et al.  A multiobjective hybrid genetic algorithm for the capacitated multipoint network design problem , 2000, IEEE Trans. Syst. Man Cybern. Part B.

[2]  Ravindra K. Ahuja,et al.  A capacity scaling algorithm for the constrained maximum flow problem , 1995, Networks.

[3]  Chung G. Kang,et al.  Shortest path routing algorithm using Hopfield neural network , 2001 .

[4]  Yee Leung,et al.  A genetic algorithm for the multiple destination routing problems , 1998, IEEE Trans. Evol. Comput..

[5]  Miki Haseyama,et al.  A genetic algorithm for determining multiple routes and its applications , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).

[6]  Masaharu Munetomo,et al.  A migration scheme for the genetic adaptive routing algorithm , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).

[7]  Faouzi Kamoun,et al.  Neural networks for shortest path computation and routing in computer networks , 1993, IEEE Trans. Neural Networks.

[8]  Cenk Çaliskan.  A double scaling algorithm for the constrained maximum flow problem , 2008, Comput. Oper. Res..

[9]  Jennifer Ryan,et al.  Path assignment for call routing: An application of tabu search , 1993, Ann. Oper. Res..

[10]  Chang Wook Ahn,et al.  A genetic algorithm for shortest path routing problem and the sizing of populations , 2002, IEEE Trans. Evol. Comput..