Volume 25, Issue 4 (IJIEPR 2014)                   IJIEPR 2014, 25(4): 317-331 | Back to browse issues page

XML Print


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

Ghodratnama A, Tavakkoli-Moghaddam R, Ghodratnama Baboli Vahdani A, Vahdani B. A Robust Optimization Approach for a p-Hub Covering Problem with Production Facilities, Time Horizons and Transporter . IJIEPR 2014; 25 (4) :317-331
URL: http://ijiepr.iust.ac.ir/article-1-516-en.html
1- University of Tehran
2- University of Tehran , tavakoli@ut.ac.ir
3- University of Lyon
Abstract:   (7094 Views)
Hub location-allocation problems are currently a subject of keen interest in the research community. However, when this issue is considered in practice, significant difficulties such as traffic, commodity transportation and telecommunication tend to be overlooked. In this paper, a novel robust mathematical model for a p-hub covering problem, which tackles the intrinsic uncertainty of some parameters, is investigated. The main aim of the mathematical model is to minimize costs involving: 1) the covering cost 2) the sum of the transportation costs 3) the sum of the opening cost of facilities in the hubs 4) the sum of the reopening cost of facilities in hubs 5) the sum of the activating cost facilities in hubs and 6) the sum of the transporters' purchasing cost. To solve this model, use has been made of the new extensions to the robust optimization theory. To evaluate the robustness of the solutions obtained by the novel robust optimization approach, they are compared to those generated by the deterministic mixed-integer linear programming (MILP) model for a number of different test problems. Finally, the conclusions are presented.
Full-Text [PDF 1426 kb]   (2901 Downloads)    
Type of Study: Research | Subject: Facilities Design & or Work Space Design
Received: 2013/04/5 | Accepted: 2014/09/8 | Published: 2015/04/7

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

Send email to the article author


Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.