Volume 9, Issue 4 (12-2017)                   IJICTR 2017, 9(4): 29-36 | Back to browse issues page

XML Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Hartoonian A, Khademzadeh A. Hub location Allocation Problem in Computer Networks Using Intelligent Optimization Algorithms . IJICTR. 2017; 9 (4) :29-36
URL: http://ijict.itrc.ac.ir/article-1-25-en.html
1- Department of Computer Engineering Islamic, Azad University South Tehran Branch, Tehran, Iran
2- Iran Telecommunication Research Center, ITRC, Tehran, Iran , zadeh@itrc.ac.ir
Abstract:   (2426 Views)
One of the new issues that have been raised in recent years is the hub network design problem. The hubs are collection and distribution centers that are used for the purpose of less connections and more of indirect than direct communications. They are interface facilities which are used as switch centers to collect and distribute flows in the network. They determine routes and organize traffic between source-destination in order to provide high performance and be more inexpensive. In the hub location problem, the aim is to find a suitable location for the hub and routes for sending information from a source to a destination, in order to reduce costs and gain desired purpose by multiple transfers between the hubs. In this paper, teaching and learning based optimization, particle swarm optimization and imperialist competitive algorithm were studied for locating optimally hubs and allocating nodes to the nearest located hub nodes. Experimental results show that optimal location for hubs by using cluster-based optimization algorithm (TLBO) successfully has been performed with extreme accuracy and precision.
Full-Text [PDF 1954 kb]   (1649 Downloads)    
Type of Study: Research | Subject: Information Technology

Add your comments about this article : Your username or Email:

Send email to the article author