Production, Manufacturing, Transportation and LogisticsAlternate solution approaches for competitive hub location problems
Introduction
Hub and spoke network was pioneered in the airline industry by Delta Airlines in 1955 to compete with the low cost Eastern Airlines (Delta History, 1955). In a hub and spoke network, every origin–destination (O–D) pair is connected through one or more intermediate nodes, called hubs. Hubs are consolidation points, where traffic from various non-hub nodes, called spokes, is aggregated, thereby generating economies of scale. This leads to a lower operational cost, compared to alternative network configurations with direct O–D connections (Chen, 2007, Hamacher, Labbé, Nickel, Sonneborn, 2004, O’Kelly, 1986). The use of a hub and spoke network also results in a lower setup cost since it requires fewer links to connect various origins and destinations in the network. Several studies have documented the benefits, leading to competitive advantage, from the use of hub and spoke network (Bania, Bauer, Zlatoper, 1998, McShan, Windle, 1989, Oum, Zhang, Zhang, 1995, Martins de Sá, Contreras, Cordeau, Saraiva de Camargo, de Miranda, 2015). Since the deregulation of the US airline industry in 1978, hub and spoke networks have become almost a default choice for airline networks. Besides the airline industry, hub and spoke networks are also used in other industries, for instance, telecommunications (Klincewicz, 1998), energy (Lumsden, Dallari, & Ruggeri, 1999) and road transportation (Üster & Agrahari, 2011).
Designing a hub and spoke network calls for solving a hub location problem (HLP), which determines the optimal location of hubs and the path through some of those hubs between every O–D pair (Campbell & O’Kelly, 2012). In a multi-player setting, HLPs can be broadly classified either as cooperative games or non-cooperative games. Cooperative games focus on coalitions and joint actions among firms, thereby determining their collective payoffs, as opposed to non-cooperative games, where individual players focus on their own payoffs under competition. Lin and Lee (2010) study a cooperative game in freight services in an oligopolistic market. In a non-cooperative setting, an HLP is solved either by an entrant airline that intends to set up its network by locating the hubs, or by an incumbent airline that intends to revamp its existing network. In this paper, we focus on this network design problem faced by an entrant with the intention of setting up its hubs strategically.
Most of the existing literature on HLP has studied the above problem in a monopolistic setting, without accounting for the presence of competing firms in the market. The literature on the entrant’s problem in a competitive setting, as well is limited and can be broadly classified in the following two categories: (i) the best response of the entrant explicitly accounting for the competitors’ reaction (Mahmutogullari, Kara, 2016, Sasaki, 2005, Sasaki, Campbell, Krishnamoorthy, Ernst, 2014, Sasaki, Fukushima, 2001) (ii) the best response of the entrant without accounting for the reaction from the competitors (Eiselt, Marianov, 2009, Lüer-Villagra, Marianov, 2013, Marianov, Serra, ReVelle, 1999, Wagner, 2008). In this paper, we specifically focus on the problem of maximizing the market share of an entrant airline in the second category of competitive HLP. The problem results in a non-linear integer program (NLIP), which is challenging to solve using off-the-shelf solvers like CPLEX, Gurobi, etc. To the best of our knowledge, ours is the first study to solve the above problem exactly.
Through this paper, we make the following contributions to the related literature. We propose four alternate approaches to solve the problem. The first approach (CPA) is based on the Kelley’s cutting plane algorithm to address the non-linearity in the problem. The second approach (MISOCP) relies on a mixed integer second order conic program based reformulation of the problem. The third approach (LR-CPA) employs the Kelley’s cutting plane algorithm within Lagrangian relaxation, while the fourth approach (LR-SOCP) uses second order conic program within Lagrangian relaxation. Further, we compare the above four solution approaches based on extensive computational experiments using two well-known datasets (CAB and AP). Our analysis highlights the superiority of LR-CPA, using which we are able to solve all the AP test instances corresponding to 50 cities within an optimality gap of 1% in less than 10 minutes of CPU time.
The rest of the paper is organized as follows. In Section 2, we present a review of the literature on HLP and its variants in a competitive setting. The problem description, followed by its mathematical formulation, is presented in Section 3. In Section 4, we present our alternate solution approaches, followed by extensive computational results in Section 5. Finally, the conclusions and directions for future research are presented in Section 6.
Section snippets
Literature review
HLPs can be classified as p-median, p-center, covering or fixed-charge on the basis of their objective functions. The objective in the p-median HLP is to minimize the total transportation cost (Campbell, 1996, Ernst, Krishnamoorthy, 1996, O’Kelly, 1986, Skorin-Kapov, Skorin-Kapov, O’Kelly, 1996), whereas for a p-center HLP is to minimize the maximum transportation cost between any pair of nodes (Campbell, 1994, Kara, Tansel, 2000). A covering HLP can either be hub set-covering if the objective
Problem description and model formulation
Consider a network of cities, represented by a complete graph in which a set of airlines are competing for their respective market shares. There exists a given demand fij for each pair (i ∈ N, j ∈ N, i ≠ j) of cities. Each airline c ∈ C operates in a hub and spoke network with a set Hc ⊂ N of hubs, such that the traffic between any city pair (i, j) is routed via a maximum of two intermediate hubs (k, l ∈ Hc), so as to exploit the benefits arising from the economies of
Solution methods
In this section, we propose four alternate approaches to solve COHLP. The first approach is based on the linearization of the non-linear term in (3) using Kelley’s cutting plane approach (CPA) (Kelley, 1960). In the second approach, we reformulate COHLP into a mixed integer second order conic program (MISOCP), which can be solved efficiently using an off-the-shelf solver (Alizadeh & Goldfarb, 2003). The third and fourth approaches are based on Lagrangian relaxation of COHLP, which separates the
Numerical experiments
We first describe in Section 5.1 the relevant data used in our experiments, followed by a discussion of our results in Section 5.2.
Conclusions and directions for future research
In this paper, we studied a competitive hub location problem (COHLP), wherein an entrant is making a strategic decision of locating its hubs in a market with already existing competing players. The entrant tries to maximize its market share, which is a function of the utility that customers get from using its services. The resulting problem is an NLIP, which is computationally intractable for off-the-shelf solvers. Hence, papers that have studied similar problems (Eiselt, Marianov, 2009,
Acknowledgment
This research was supported by the Research fellowship provided to the first author by Indian Institute of Management, Ahmedabad.
References (61)
Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
European Journal of Operational Research
(1994)- et al.
Us air passenger service: A taxonomy of route networks, hub locations, and competition
Transportation Research Part E: Logistics and Transportation Review
(1998) Integer programming formulations of discrete hub location problems
European Journal of Operational Research
(1994)A hybrid heuristic for the uncapacitated single allocation hub location problem
Omega
(2007)- et al.
The tree of hubs location problem
European Journal of Operational Research
(2010) - et al.
A conditional p-hub location problem with attraction functions
Computers & Operations Research
(2009) Exact solution of a class of nonlinear knapsack problems
Operations Research Letters
(2005)- et al.
Efficient algorithms for the uncapacitated single allocation p-hub median problem
Location Science
(1996) - et al.
Hub networks and simulated schedule delay
Papers in Regional Science
(1986) - et al.
Adapting polyhedral properties from facility to hub location problems
Discrete Applied Mathematics
(2004)
On the single-assignment p-hub center problem
European Journal of Operational Research
Hub location in backbone/tributary network design: a review
Location Science
The competition game on hub network design
Transportation Research Part B: Methodological
A competitive hub location and pricing problem
European Journal of Operational Research
Hub location under competition
European Journal of Operational Research
Location of hubs in a competitive environment
European Journal of Operational Research
‘Multidimensional’ extensions and a nested dual approach for the m-median problem
European Journal of Operational Research
A quadratic integer program for the location of interacting hub facilities
European Journal of Operational Research
On complexity of unconstrained hyperbolic 0–1 programming problems
Operations Research Letters
A Stackelberg hub arc location model for a competitive environment
Computers & Operations Research
Tight linear programming relaxations of uncapacitated p-hub median problems
European Journal of Operational Research
A benders decomposition approach for a distribution network design problem with consolidation and capacity considerations
Operations Research Letters
Efficient solution of a class of location–allocation problems with stochastic demand and congestion
Computers & Operations Research
A note on “location of hubs in a competitive environment”
European Journal of Operational Research
Aircraft rescheduling with cruise speed control
Operations Research
Passengers’ choice of airline under competition: the use of the logit model
Transport Reviews
Second-order cone programming
Mathematical Programming
On implementing a primal-dual interior-point method for conic quadratic optimization
Mathematical Programming
Semidefinite and second-order cone programming
Practical optimization: Algorithms and engineering applications
A market share theorem
Journal of Marketing Research
Cited by (9)
ILS-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation
2023, Computers and Operations ResearchBenders decomposition applied to profit maximizing hub location problem with incomplete hub network
2022, Computers and Operations ResearchCitation Excerpt :Some of these studies address a specific topological structure, such as ring-star network (Lee and Ro, 1993), tree-star network (Contreras et al., 2010; Martins de Sá et al., 2013; Pessoa et al., 2016), star-star topology (Labbé and Yaman, 2008; Yaman and Elloumi, 2012) and hub lines network (Martins de Sá et al., 2015). Other studies in the area of hub location focusing on profit maximizing have addressed problems that consider a competitive environment, as Neamatian Monemi et al. (2017), Mahmoodjanloo et al. (2020), and Tiwari et al. (2021) or incorporate pricing decisions, like Lüer-Villagra and Marianov (2013), Čvokić and Stanimirović (2020), Esmaeili and Sedehzade (2020), and Sadeghi Dastaki et al. (2021). Furthermore, there are also some works, such as Tikani et al. (2018), Huo et al. (2019), and Salehi and Tikani (2020), that focused on determining the hub network in order to generate profit, integrating revenue management techniques in the problems.
Distributionally robust cluster-based hierarchical hub location problem for the integration of urban and rural public transport system
2021, Computers and Industrial EngineeringA multiproject scheduling and resource management model in projects construction
2023, Engineering, Construction and Architectural ManagementLocating facilities under competition and market expansion: Formulation, optimization, and implications
2022, Production and Operations Management