Sciweavers

Share
ASIAMS
2007
IEEE

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

9 years 8 months ago
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.
Crina Grosan, Ajith Abraham
Added 02 Jun 2010
Updated 02 Jun 2010
Type Conference
Year 2007
Where ASIAMS
Authors Crina Grosan, Ajith Abraham
Comments (0)
books