Volume 24, Issue 1 (IJIEPR 2013)                   IJIEPR 2013, 24(1): 1-15 | Back to browse issues page

XML Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Zarei V, Mahdavi I, Tavakkoli-Moghaddam R, Mahdavi-Amiri N. A Multi-Level Capacity Approach to the Hub and Spoke Network. IJIEPR 2013; 24 (1) :1-15
URL: http://ijiepr.iust.ac.ir/article-1-511-en.html
A Multi-Level Capacity Approach to the Hub and Spoke Network
Vorya Zarei1 , Iraj Mahdavi 2, Reza Tavakkoli-Moghaddam3 , Nezam Mahdavi-Amiri4
1- , Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran
2- , Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran , irajarash@rediffmail.com
3- , Department of Industrial Engineering, College of Engineering, Tehran University, Tehran, Iran
4- Faculty of Mathematical Science, Sharif University of Technology, Tehran, Iran
Abstract:   (7609 Views)
The existing works considering the flow-based discount factor in the hub and spoke problems, assume that increasing the amount of flow passing through each edge of network continuously decreases the unit flow transportation cost. Although a higher volume of flow allows for using wider links and consequently cheaper transportation, but the unit of flow enjoys more discounts, quite like replacing the current link by a cheaper link type (i.e., increasing the volume of flow without changing the link type would not affects the unit flow transportation cost). Here, we take a new approach, introducing multi-level capacities to design hub and spoke networks, while alternative links with known capacities, installation costs and discount factors are available to be installed on each network edge. The flow transportation cost and link installation cost are calculated according to the type of links installed on the network edges thus, not only the correct optimum hub location and spoke allocation is determined, but also the appropriate link type to be installed on the network edges are specified. The capacitated multiple allocation p-hub median problem (CMApHMP) using the multi-level capacity approach is then formulated as a mixed-integer linear program (MILP). We also present a new MILP for the hub location problem using a similar approach in order to restrict the amount of flow transmitting through the hubs. Defining diseconomies of scale for each hub type, the model is to present congestion at the hubs and balance the transmitting flow between the hubs. Two new formulations are presented for both the p-hub median and the hub location problems which requiring a flow between two non-hub nodes to be transferred directly, when a direct link between the nodes is available. These models are useful for the general cost structure where the costs are not required to satisfy the triangular inequality. Direct links between non-hub nodes are allowed in all the proposed formulations.
Keywords: Hub location; p-hub median; Flow-based discount; Multi-level capacity; Congestion
Full-Text [PDF 896 kb]   (4081 Downloads)    
Type of Study: Research | Subject: Quality Control
Received: 2013/02/20 | Accepted: 2013/03/2 | Published: 2013/03/2
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.