scholarly journals The air transportation hub-and-spoke design problem: comparison between a continuous and a discrete solution method

2013 ◽  
Vol 33 (3) ◽  
pp. 477-489
Author(s):  
Guina Sotomayor Alzamora ◽  
Fernanda M.P. Raupp ◽  
Nelio D. Pizzolato ◽  
Adilson E. Xavier
2020 ◽  
Vol 12 (17) ◽  
pp. 6770
Author(s):  
Jian Zhou ◽  
Wenying Xia ◽  
Ke Wang ◽  
Hui Li ◽  
Qianyu Zhang

A network design of a closed-loop supply chain (CLSC) with multiple recovery modes under fuzzy environments is studied in this article, in which all the cost coefficients (e.g., for facility establishment, transportation, manufacturing and recovery), customer demands, delivery time, recovery rates and some other factors that cannot be precisely estimated while designing are modeled as triangular fuzzy numbers. To handle these uncertain factors and achieve a compromise between the two conflicting objectives of maximizing company profit and improving customer satisfaction, a fuzzy bi-objective programming model and a corresponding two-stage fuzzy interactive solution method are presented. Applying the fuzzy expected value operator and fuzzy ranking method, the fuzzy model is transformed into a deterministic counterpart. Subsequently, Pareto optimal solutions are determined by employing the fuzzy interactive solution method to deal with the conflicting objectives. Numerical experiments address the efficiency of the proposed model and its solution approach. Furthermore, by comparing these results with the CLSC network design in deterministic environments, the benefits of modeling the CLSC network design problem with fuzzy information are highlighted.


2013 ◽  
Vol 284-287 ◽  
pp. 1203-1207
Author(s):  
Ji Ung Sun

Hub and Spoke (H&S) network reflecting the scale economies through consolidation and a large amount of freight transportation is widely used to reduce total transportation costs. H&S network has transportation routes that go to the final delivery point pass through hub linking destination from hub linking origin. In this paper we present a 0-1 integer programming model and a solution method for the capacitated asymmetric allocation hub location problem (CAAHLP). We determine the number of hubs, the locations of hubs, and asymmetric allocation of non-hub nodes to hub with the objective of minimum total transportation costs satisfying the required service level. As the CAAHLP has impractically demanding for the large sized problem, we develop a solution method based on ant colony optimization algorithm. We investigate performance of the proposed solution method through the comparative study. The experimental results show that the newly proposed asymmetrically allocated network can provide better solution than the singly allocated network in terms of cost and service level.


Sign in / Sign up

Export Citation Format

Share Document