First Asia International Conference on Modelling & Simulation (AMS'07) Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach Prince of Songkla University, Phuket, Thailand March 27-March 30 ISBN: 0-7695-2845-7
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/AMS.2007.96
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.
Citation:
Crina Grosan, Ajith Abraham, "Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach," ams, pp.427-433, First Asia International Conference on Modelling & Simulation (AMS'07), 2007 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb