Skip to main content
Article thumbnail
Location of Repository

Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach (Invited Paper)

By Crina Grosan and Ajith Abraham

Abstract

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

Year: 2010
OAI identifier: oai:CiteSeerX.psu:10.1.1.160.8321
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.softcomputing.net/a... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.