Volume 27, Number 4 (IJIEPR 2016)                   IJIEPR 2016, 27(4): 309-320 | Back to browse issues page



DOI: 10.22068/ijiepr.27.4.309

XML Print


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

Nasiri M M, Shamsi Gamchi N, Torabi S A. Cuckoo Optimization Algorithm for a Reliable Location-Allocation of Hubs among the Clients. IJIEPR. 2016; 27 (4) :309-320
URL: http://ijiepr.iust.ac.ir/article-1-644-en.html

Assistant Professor College of Engineering, University of Tehran , mmnasiri@ut.ac.ir
Abstract:   (655 Views)

Hubs are critical elements of transportation networks. Location of hubs and allocation of demands to them are of high importance in the network design. The most important purpose of these models is to minimize the cost, but path reliability is also another important factor which can influence the location of hubs. In this paper, we propose a P-center hub location model with full interconnection among hubs while there are different paths between origins and destinations. The purpose of the model is to determine the reliable path with lower cost. Unlike the prior studies, the number of hubs in the path is not limited to two hubs. The presented model in this paper is bi-objective and includes cost and reliability to determine the best locations for hubs, allocation of the demands to hubs and the best path. In order to illustrate our model, a numerical example is presented and solved using the Cuckoo Optimization Algorithm.

Full-Text [PDF 384 kb]   (230 Downloads)    
Type of Study: Research | Subject: Facilities Planning and Management
Received: 2015/05/4 | Accepted: 2017/04/10 | Published: 2017/04/17

Add your comments about this article : Your username or email:
Write the security code in the box

Send email to the article author


© 2015 All Rights Reserved | International Journal of Industrial Engineering & Production Research

Designed & Developed by : Yektaweb