A competitive hub location and pricing problem

We formulate and solve a new hub location and pricing problem, describing a situation in which an existing transportation company operates a hub and spoke network, and a new company wants to enter into the same market, using an incomplete hub and spoke network. The entrant maximizes its profit by choosing the best hub locations and network topology and applying optimal pricing, considering that the existing company applies mill pricing. Customers’ behavior is modeled using a logit discrete choice model. We solve instances derived from the CAB dataset using a genetic algorithm and a closed expression for the optimal pricing. Our model confirms that, in competitive settings, seeking the largest market share is dominated by profit maximization. We also describe some conditions under which it is not convenient for the entrant to enter the market.

[1]  Ricardo Saraiva de Camargo,et al.  Benders Decomposition for Hub Location Problems with Economies of Scale , 2009, Transp. Sci..

[2]  Claudio B. Cunha,et al.  A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil , 2007, Eur. J. Oper. Res..

[3]  Gabriel R. Bitran,et al.  On Pricing and Composition of Bundles , 2007 .

[4]  Iván A. Contreras,et al.  The Tree of Hubs Location Problem , 2010, Eur. J. Oper. Res..

[5]  Morton E. O'Kelly,et al.  Hub location with flow economies of scale , 1998 .

[6]  Stefan Nickel,et al.  Liner Shipping Hub Network Design in a Competitive Environment , 2010 .

[7]  M. Fukushima,et al.  STACKELBERG HUB LOCATION PROBLEM , 2001 .

[8]  Jozef Kratica,et al.  Discrete Optimization Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem , 2007 .

[9]  Haluk Topcuoglu,et al.  Solving the uncapacitated hub location problem using genetic algorithms , 2005, Comput. Oper. Res..

[10]  Mercedes Landete,et al.  New formulations for the uncapacitated multiple allocation hub location problem , 2006, Eur. J. Oper. Res..

[11]  Phillip J. Lederer,et al.  Airline Scheduling and Routing in a Hub-and-Spoke System , 1993, Transp. Sci..

[12]  Bahar Y. Kara,et al.  Hub location problems : the location of interacting facilities , 2011 .

[13]  Charles ReVelle,et al.  Competitive Location and Pricing on Networks , 1999 .

[14]  Vladimir Marianov,et al.  Location models for airline hubs behaving as M/D/c queues , 2003, Comput. Oper. Res..

[15]  Hrvoje Podnar,et al.  Network cost minimization using threshold-based discounting , 2002, Eur. J. Oper. Res..

[16]  Horst W. Hamacher,et al.  Adapting polyhedral properties from facility to hub location problems , 2004, Discret. Appl. Math..

[17]  Sibel A. Alumur,et al.  A tabu-search based heuristic for the hub covering problem over incomplete hub networks , 2009, Comput. Oper. Res..

[18]  Iván A. Contreras,et al.  General network design: A unified view of combined location and network design problems , 2012, Eur. J. Oper. Res..

[19]  Sibel A. Alumur,et al.  The design of single allocation incomplete hub networks , 2009 .

[20]  Morton E. O'Kelly,et al.  The Location of Interacting Hub Facilities , 1986, Transp. Sci..

[21]  Samir Elhedhli,et al.  A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion , 2010, INFORMS J. Comput..

[22]  Vladimir Marianov,et al.  Location of hubs in a competitive environment , 1999, Eur. J. Oper. Res..

[23]  James F. Campbell,et al.  Integer programming formulations of discrete hub location problems , 1994 .

[24]  Nicole Adler,et al.  Hub-and-spoke network alliances and mergers: Price-location competition in the airline industry , 2007 .

[25]  James F. Campbell.  Hub location for time definite transportation , 2009, Comput. Oper. Res..

[26]  Andreas T. Ernst,et al.  Hub Arc Location Problems: Part II - Formulations and Optimal Algorithms , 2005, Manag. Sci..

[27]  M. O'Kelly,et al.  A quadratic integer program for the location of interacting hub facilities , 1987 .

[28]  Andreas T. Ernst,et al.  Hub location problems , 2002 .

[29]  Sibel A. Alumur,et al.  Network hub location problems: The state of the art , 2008, Eur. J. Oper. Res..

[30]  Fariborz Jolai,et al.  An M/M/c queue model for hub covering location problem , 2011, Math. Comput. Model..

[31]  Iván A. Contreras,et al.  Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment , 2011, INFORMS J. Comput..

[32]  Murat Köksalan,et al.  Bicriteria p-Hub Location Problems and Evolutionary Algorithms , 2010, INFORMS J. Comput..

[33]  Günter Rudolph,et al.  Convergence analysis of canonical genetic algorithms , 1994, IEEE Trans. Neural Networks.

[34]  Vladimir Marianov,et al.  A conditional p-hub location problem with attraction functions , 2009, Comput. Oper. Res..

[35]  Andreas T. Ernst,et al.  Hub Arc Location Problems: Part I - Introduction and Results , 2005, Manag. Sci..

[36]  Stefan Nickel,et al.  Hub location problems in transportation networks , 2011 .

[37]  Ehsan Nikbakhsh,et al.  Hub location problems: A review of models, classification, solution techniques, and applications , 2013, Comput. Ind. Eng..

[38]  Ricardo Saraiva de Camargo,et al.  Benders decomposition for the uncapacitated multiple allocation hub location problem , 2008, Comput. Oper. Res..

[39]  Mercedes Landete,et al.  New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem , 2012, Eur. J. Oper. Res..

[40]  Morton E. O'Kelly,et al.  Twenty-Five Years of Hub Location Research , 2012, Transp. Sci..

[41]  D. Bryan.  Extensions to the Hub Location Problem: Formulations and Numerical Examples , 2010 .