Showing 4 results for Hub Location
Vorya Zarei, Iraj Mahdavi, Reza Tavakkoli-Moghaddam, Nezam Mahdavi-Amiri,
Volume 24, Issue 1 (2-2013)
Abstract
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.
Dr. Yahia Zare Mehrjerdi, Amir Ebrahimi Zade, Dr. Hassan Hosseininasab,
Volume 26, Issue 3 (9-2015)
Abstract
Abstract One of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. Practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. Change in problem parameters during the planning horizon is one of the key factors causing the results of theoretical models to be impractical in real world situations. To dissolve this problem in this paper a mathematical model for dynamic single allocation hub covering problem is proposed in which the covering radius of hub nodes is one of the decision variables. Also Due to NP-Hardness of the problem and huge computational time required to solve the problem optimally an effective genetic algorithm with dynamic operators is proposed afterwards. Computational results show the satisfying performance of the proposed genetic algorithm in achieving satisfactory results in a reasonable time. Keywords: hub location problem, dynamic hub covering problem, flexible covering radius, dynamic genetic algorithm.
Mohammad Mahdi Nasiri, Nafiseh Shamsi Gamchi, Seyed Ali Torabi,
Volume 27, Issue 4 (12-2016)
Abstract
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.
Mostafa Soltani, R. Azizmohammadi, Seyed Mohammad Hassan Hosseini, Mahdi Mohammadi Zanjani,
Volume 32, Issue 2 (6-2021)
Abstract
The blood supply chain network is an especial case of the general supply chain network, which starts with the blood donating and ends with patients. Disasters such as earthquakes, floods, storms, and accidents usually event suddenly. Therefore, designing an efficient network for the blood supply chain network at emergencies is one of the most important challenging decisions for related managers. This paper aims to introduce a new blood supply chain network in disasters using the hub location approach. After introducing the last studies in blood supply chain and hub location separately, a new mixed-integer linear programming model based on hub location is presented for intercity transportation. Due to the complexity of this problem, two new methods are developed based on Particle Swarm Optimization and Differential Evolution algorithms to solve practical-sized problems. Real data related to a case study is used to test the developed mathematical model and to investigate the performance of the proposed algorithms. The result approves the accuracy of the new mathematical model and also the good performance of the proposed algorithms in solving the considered problem in real-sized dimensions. The proposed model is applicable considering new variables and operational constraints to more compatibility with reality. However, we considered the maximum possible demand for blood products in the proposed approach and so, lack of investigation of uncertainty conditions in key parameters is one of the most important limitations of this research.