Profit maximizing hub location problem in the airline industry under coopetition

2021 ◽  
pp. 107563
Author(s):  
Ankit Sharma ◽  
Amit Kohar ◽  
Suresh Kumar Jakhar ◽  
Sonia
Keyword(s):  
Airline Industry ◽  
Location Problem ◽  
Hub Location ◽  
Hub Location Problem ◽  
Profit Maximizing

scholarly journals Location of regional and international hub ports in liner shipping

2017 ◽  
Vol 2 (2) ◽  
pp. 114-125 ◽  
Author(s):  
Jianfeng Zheng ◽  
Cong Fu ◽  
Haibo Kuang
Keyword(s):  
Design Methodology ◽  
Location Problem ◽  
Programming Model ◽  
Liner Shipping ◽  
Mixed Integer ◽  
Eastern Asia ◽  
Hub Location ◽  
Hub Location Problem ◽  
Content Type ◽  
Western Asia

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.

Hybrid ant colony optimization for capacitated multiple-allocation cluster hub location problem

2017 ◽  
Vol 32 (1) ◽  
pp. 44-58 ◽  
Author(s):  
Mohammad Mirabi ◽  
Parya Seddighi
Keyword(s):  
Ant Colony Optimization ◽  
Location Problem ◽  
Demand Management ◽  
Telecommunication Networks ◽  
Ant Colony ◽  
Hub Location ◽  
Hub Location Problem ◽  
Total Cost ◽  
Wide Range ◽  
Cost Of Transportation

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.

Hierarchical hub location problem for freight network design

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

scholarly journals Location of Urban Logistic Terminals as Hub Location Problem

1970 ◽  
Vol 24 (5) ◽  
pp. 433-440 ◽  
Author(s):  
Jasmina Pašagić Škrinjar ◽  
Kristijan Rogić ◽  
Ratko Stanković
Keyword(s):  
Location Problem ◽  
Location Problems ◽  
Heuristic Methods ◽  
Hub Location ◽  
Hub Location Problem ◽  
Telecommunication Systems ◽  
Big Cities ◽  
Np Problems ◽  
Delivery Networks ◽  
Single Allocation

In this paper the problems of locating urban logistic terminals are studied as hub location problems that due to a large number of potential nodes in big cities belong to hard non-polynomial problems, the so-called NP-problems. The hub location problems have found wide application in physical planning of transport and telecommunication systems, especially systems of fast delivery, networks of logistic and distribution centres and cargo traffic terminals of the big cities, etc. The paper defines single and multiple allocations and studies the numerical examples. The capacitated single allocation hub location problems have been studied, with the provision of a mathematical model of selecting the location for the hubs on the network. The paper also presents the differences in the possibilities of implementing the exact and heuristic methods to solve the actual location problems of big dimensions i.e. hub problems of the big cities.

scholarly journals KGPMH: A hybrid approach for solving a novel facility location problem

2021 ◽  
Author(s):  
Maryam DehghanChenary ◽  
Arman Ferdowsi ◽  
Fariborz Jolai ◽  
Reza Tavakkoli-Moghaddam
Keyword(s):  
Mathematical Model ◽  
Location Problem ◽  
Hybrid Approach ◽  
Facility Location Problem ◽  
Evaluation Function ◽  
Genetic Approach ◽  
Hub Location ◽  
Hub Location Problem ◽  
Proposed Model ◽  
The Impact

<pre>The focus of this paper is to propose a bi-objective mathematical model for a new extension of a multi-period p-mobile hub location problem and then to devise an algorithm for solving it. The developed model considers the impact of the time spent traveling at the hubs' network, the time spent at hubs for processing the flows, and the delay caused by congestion at hubs with specific capacities. Following the unveiled model, a hybrid meta-heuristic algorithm will be devised that simultaneously takes advantage of a novel evaluation function, a clustering technique, and a genetic approach for solving the proposed model.</pre>

scholarly journals Hub location problem in round-trip service applications

2020 ◽  
Author(s):  
Omar Kemmar ◽  
Karim Bouamrane ◽  
Shahin Gelareh
Keyword(s):  
Economies Of Scale ◽  
Location Problem ◽  
Service Providers ◽  
Real Life ◽  
Mixed Integer ◽  
Neighborhood Search ◽  
Hub Location ◽  
Service Networks ◽  
Hub Location Problem ◽  
Hub And Spoke

In this paper, we introduce a new hub-and-spoke structure for service networks based on round-trips as practiced by some transport service providers. This problem is a variant of Uncapacitated Hub Location Problem wherein the spoke nodes allocated to a hub node form round-trips (cycles) starting from and ending to the hub node. This problem is motivated by two real-life practices in logistics wherein  runaway  nodes and  runaway  connections with their associated economies of scale were foreseen to increase redundancy in the network. We propose a mixed integer linear programming mathematical model with exponential number of constraints. In addition to the separation routines for separating from among exponential constraints, we propose a hyper-heuristic based on reinforcement learning and its comparable counterpart as a variable neighborhood search. Our extensive computational experiments confirm efficiency of the proposed approaches.In this paper, we introduce a new hub-and-spoke structure for service networks based on round-trips as practiced by some transport service providers. This problem is a variant of Uncapacitated Hub Location Problem wherein the spoke nodes allocated to a hub node form round-trips (cycles) starting from and ending to the hub node. This problem is motivated by two real-life practices in logistics wherein  runaway  nodes and  runaway  connections with their associated economies of scale were foreseen to increase redundancy in the network. We propose a mixed integer linear programming mathematical model with exponential number of constraints. In addition to the separation routines for separating from among exponential constraints, we propose a hyper-heuristic based on reinforcement learning and its comparable counterpart as a variable neighborhood search. Our extensive computational experiments confirm efficiency of the proposed approaches.

Sign in / Sign up

Export Citation Format

Share Document