Hub location Allocation Problem in Computer Networks Using Intelligent Optimization Algorithms

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Hartoonian armond; KHADEMZADEH AHMAD

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF INFORMATION AND COMMUNICATION TECHNOLOGY RESEARCH Year:2017 | Volume:9 | Issue:4 Page(s): 29-36

Download Full-Text

View:

149

Download:

Cites:

Information Journal Paper

Title

Hub location Allocation Problem in Computer Networks Using Intelligent Optimization Algorithms

Author(s)

Hartoonian armond | KHADEMZADEH AHMAD | Issue Writer Certificate

Keywords

Hub Location-allocation

Network

Optimization algorithm

TLBO

Abstract

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.

Cites

No record.

References

No record.

Cite

APA: Copy

Hartoonian, armond, & KHADEMZADEH, AHMAD. (2017). Hub location Allocation Problem in Computer Networks Using Intelligent Optimization Algorithms. INTERNATIONAL JOURNAL OF INFORMATION AND COMMUNICATION TECHNOLOGY RESEARCH, 9(4), 29-36. SID. https://sid.ir/paper/315175/en

Vancouver: Copy

Hartoonian armond, KHADEMZADEH AHMAD. Hub location Allocation Problem in Computer Networks Using Intelligent Optimization Algorithms. INTERNATIONAL JOURNAL OF INFORMATION AND COMMUNICATION TECHNOLOGY RESEARCH[Internet]. 2017;9(4):29-36. Available from: https://sid.ir/paper/315175/en

IEEE: Copy

armond Hartoonian, and AHMAD KHADEMZADEH, “Hub location Allocation Problem in Computer Networks Using Intelligent Optimization Algorithms,” INTERNATIONAL JOURNAL OF INFORMATION AND COMMUNICATION TECHNOLOGY RESEARCH, vol. 9, no. 4, pp. 29–36, 2017, [Online]. Available: https://sid.ir/paper/315175/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops