scholarly journals Chance constrained programming and robust optimization approaches for uncertain hub location problem in a cooperative competitive environment

2020 ◽  
Vol 0 (0) ◽  
pp. 0-0
Author(s):  
Farzin Nourzadeh ◽  
S. Ebrahimnejad ◽  
Kaveh Khalili-Damghani ◽  
Ashkan Hafezalkotob
2017 ◽  
Vol 2 (2) ◽  
pp. 114-125 ◽  
Author(s):  
Jianfeng Zheng ◽  
Cong Fu ◽  
Haibo Kuang

Purpose This paper aims to investigate the location of regional and international hub ports in liner shipping by proposing a hierarchical hub location problem. Design/methodology/approach This paper develops a mixed-integer linear programming model for the authors’ proposed problem. Numerical experiments based on a realistic Asia-Europe-Oceania liner shipping network are carried out to account for the effectiveness of this model. Findings The results show that one international hub port (i.e. Rotterdam) and one regional hub port (i.e. Zeebrugge) are opened in Europe. Two international hub ports (i.e. Sokhna and Salalah) are located in Western Asia, where no regional hub port is established. One international hub port (i.e. Colombo) and one regional hub port (i.e. Cochin) are opened in Southern Asia. One international hub port (i.e. Singapore) and one regional hub port (i.e. Jakarta) are opened in Southeastern Asia and Australia. Three international hub ports (i.e. Hong Kong, Shanghai and Yokohama) and two regional hub ports (i.e. Qingdao and Kwangyang) are opened in Eastern Asia. Originality/value This paper proposes a hierarchical hub location problem, in which the authors distinguish between regional and international hub ports in liner shipping. Moreover, scale economies in ship size are considered. Furthermore, the proposed problem introduces the main ports.


Author(s):  
Mohammad Mirabi ◽  
Parya Seddighi

AbstractThe hub location problems involve locating facilities and designing hub networks to minimize the total cost of transportation (as a function of distance) between hubs, establishing facilities and demand management. In this paper, we consider the capacitated cluster hub location problem because of its wide range of applications in real-world cases, especially in transportation and telecommunication networks. In this regard, a mathematical model is presented to address this problem under capacity constraints imposed on hubs and transportation lines. Then, a new hybrid algorithm based on simulated annealing and ant colony optimization is proposed to solve the presented problem. Finally, the computational experiments demonstrate that the proposed heuristic algorithm is both effective and efficient.


2018 ◽  
Vol 12 (9) ◽  
pp. 1062-1070 ◽  
Author(s):  
Jaemin Hwang ◽  
Jin Su Lee ◽  
Seung-Young Kho ◽  
Dong-Kyu Kim

Sign in / Sign up

Export Citation Format

Share Document