Skip to main content

A Leader-Follower Hub Location Problem Under Fixed Markups

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9869))

Abstract

Two competitors, a Leader and a Follower, are sequentially creating their hub and spoke networks to attract customers in a market where prices have fixed markups. Each competitor wants to maximize his profit, rather than a market share. Demand is split according to the logit model. The goal is to find the optimal hub and spoke topology for the Leader. We represent this Stackelberg game as a nonlinear mixed-integer bi-level optimisation problem and show how to reformulate the Follower’s problem as a mixed-integer linear program. Exploiting this reformulation, we solve instances based on a synthetic data using the alternating heuristic as a solution approach. Computational results are thoroughly discussed, consequently providing some managerial insights.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Marianov, V., Serra, D., ReVelle, C.: Location of hubs in a competitive environment. Eur. J. Oper. Res. 114(2), 363–371 (1999). doi:10.1016/S0377-2217(98)00195-7

    Article  MATH  Google Scholar 

  2. Eiselt, H., Marianov, V.: A conditional p-hub location problem with attraction functions. Comput. Oper. Res. 36(12), 3128–3135 (2009). doi:10.1016/j.cor.2008.11.014

    Article  MATH  Google Scholar 

  3. Gelareh, S., Nickel, S., Pisinger, D.: Liner shipping hub network design in a competitive environment. Trans. Res. Part E: Logistics Transp. Rev. 46(6), 991–1004 (2010). doi:10.1016/j.tre.2010.05.005

    Article  Google Scholar 

  4. Sasaki, M., Fukushima, M.: Stackelberg hub location problem. J. Oper. Res. Soc. Japan 44(4), 390–405 (2001). doi:10.1016/S0453-4514(01)80019-3

    MathSciNet  MATH  Google Scholar 

  5. Adler, N., Smilowitz, K.: Hub-and-spoke network alliances and mergers: price-location competition in the airline industry. Transp. Res. Part B 41(4), 394–409 (2007). doi:10.1016/j.trb.2006.06.005

    Article  Google Scholar 

  6. Sasaki, M., Campbell, J.F., Ernst, A.T., Krishnamoorthy, M.: Hub arc location with competition. Technical report, Nanzan Academic Society (2009)

    Google Scholar 

  7. de Menzes, A., Vieira, J.: Willingness to pay for airline services attributes: evidence from a stated preferences choice game. Eur. Transport 39, 1–13 (2008)

    Google Scholar 

  8. Campbell, B., Vigar-Ellis, D.: The importance of choice attributes and the positions of the airlines within the South Africa domestic passenger airline industry as perceived by passengers at Durban International Airport. South. Afr. Bus. Rev. 16(2), 97–119 (2012)

    Google Scholar 

  9. Cullinane, K., Notteboom, T., Sanchez, R., Wilmsmeier, G.: Costs, revenue, service attributes and competition in shipping. Marit. Econ. Logistics 14, 265–273 (2012). doi:10.1057/mel.2012.7

    Article  Google Scholar 

  10. Lambrecht, A., Seim, K., Vilcassim, N., Cheema, A., Chen, Y., Crawford, G., Hosanagar, K., Raghuram, I., Koenigsberg, O., Lee, R., Miravete, E., Sahin, O.: Price discrimination in service industries. Mark Lett. 23, 423–438 (2012). doi:10.1007/s11002-012-9187-0

    Article  Google Scholar 

  11. Lüer-Villagra, A., Marianov, V.: A competitive hub location and pricing problem. Eur. J. Oper. Res. 231(3), 734–744 (2013). doi:10.1016/j.ejor.2013.06.006

    Article  MathSciNet  MATH  Google Scholar 

  12. Orbach, B.: What is Regulation? 30 Yale J. Regul. Online 1 (2012). Available at SSRN: http://ssrn.com/abstract=2143385

  13. Hertog, J.: Review of Economic Theories of Regulation. Discussion Paper, 10–18, Tjalling C. Koopmans Research Institute, Utrecht University School of Economics, Utrecht University, Utrecht (2010)

    Google Scholar 

  14. Braithwaite, J., Drahos, P.: Global Business Regulation. Cambridge University Press, Cambridge (2000). ISBN -13: 978-0521784993

    Google Scholar 

  15. Khemani, R.S., Shapiro, D.M.: Glossary of Industrial Organisation Economics and Competition Law. OECD Publishing, Paris (1993). ISBN: 9789264137936

    Google Scholar 

  16. Treasury, A.: Price regulation of utilities. Econ. Roundup 1, 57–69 (1999)

    Google Scholar 

  17. Grammig, J., Hujer, R., Scheidler, M.: Discrete choice modelling in airline network management. J. Appl. Econ. 20, 467–486 (2005). doi:10.1002/jae.799

    Article  MathSciNet  Google Scholar 

  18. Ortúzar, J., Willumsen, L.: Modelling Trasnport, 4th edn. Wiley-Blackwell, West Sussex (2011)

    Book  Google Scholar 

  19. Campbell, J., O’Kelly, M.: Twenty-five years of hub location research. Transp. Sci. 24(2), 153–169 (2012). doi:10.1287/trsc.1120.0410

    Article  Google Scholar 

  20. Haase, K., Müller, S.: A comparison of linear reformulations for multinomial logit choice probabilities in facility location models. Eur. J. Oper. Res. 232, 689–691 (2014). doi:10.1016/j.ejor.2013.08.009

    Article  MathSciNet  MATH  Google Scholar 

  21. O’Kelly, M.E., Bryan, D., Skorin-Kapov, D., Skorin-Kapov, J.: Hub network design with single and multiple allocation: a computational study. Location Sci. 4(3), 125–138 (1996). doi:10.1016/S0966-8349(96)00015-0

    Article  MATH  Google Scholar 

  22. Alekseeva, E., Kochetov, Y.: Matheuristics and exact methods for the discrete (r\(|\)p)-centroid problem. In: Talbi, E.-G., Brotcorne, L. (eds.) Metaheuristics for bi-level Optimization. SCI, vol. 482, pp. 189–220. Springer, Heidelberg (2013). doi:10.1007/978-3-642-37838-6

    Chapter  Google Scholar 

  23. Beresnev, V., Melnikov, A.: Approximate algorithms for the competitive facility location problem. J. Appl. Ind. Math. 5(2), 180–190 (2012). doi:10.1134/S1990478911020049

    Article  MathSciNet  Google Scholar 

  24. Ben-Ayed, O.: Bilevel linear programming. Comput. Oper. Res. 20(5), 485–501 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  25. Dempe, S.: Foundations of Bilevel Programming. Kluwer Academic, Dordrecht (2002). doi:10.1007/b101970

  26. Benati, S., Hansen, P.: The maximum capture problem with random utilities: problem formulation and algorithms. Eur. J. Oper. Res. 143, 518–530 (2002). doi:10.1016/S0377-2217(01)00340-X

    Article  MathSciNet  MATH  Google Scholar 

  27. Haase, K.: Discrete location planning. Technical report WP-09-09. Institute for Transport and Logistics Studies, University of Sydney (2002)

    Google Scholar 

  28. Aros-Vera, F., Marianov, V., Mitchel, J.: p-Hub approach for the optimal park-and-ride facility location problem. Eur. J. Oper. Res. 226(2), 277–285 (2013). doi:10.1016/j.ejor.2012.11.006

    Article  MathSciNet  MATH  Google Scholar 

  29. Zhang, Y., Berman, O., Verter, V.: The impact of client choice on preventive healthcare facility network design. OR Spectr. 34, 349–370 (2012). doi:10.1007/s00291-011-0280-1

    Article  MathSciNet  MATH  Google Scholar 

  30. Carrizosa, E., Davydov, I., Kochetov, Y.: A new alternating heuristic for the \( (r|p) \)-centroid problem on the plane. In: Klatte, D., Lüthi, H.J., Schmedders, K. (eds.) Operations Research Proceedings 2011. Operations Research Proceedings, pp. 275–280 (2012). doi:10.1007/978-3-642-29210-1_44

    Google Scholar 

  31. Alekseeva, E., Kochetov, Y., Plyasunov, A.: An exact method for the discrete \((r|p)\)-centroid problem. J. Global Optim. 63(3), 445–460 (2015). doi:10.1007/s10898-013-0130-6

    Article  MathSciNet  MATH  Google Scholar 

  32. Huang, Z., Wu, X., Garcia, A.J., Fik, T.J., Tatern, A.J.: An open-access modeled passenger flow matrix for the global air network in 2010. PLoS ONE 8(5), e64317 (2013). doi:10.1371/journal.pone.0064317

    Article  Google Scholar 

  33. Knudsen, T.: Uncertainities in airport cost analysis. In: Visser, E. (ed.) Transport Decisions in an Age of Uncertainty. Proceedings of the Third World Conference on Transport Research, pp. 362–376. Kluwer Boston, The Hague (1977). doi:10.1007/978-94-009-9707-3

    Google Scholar 

  34. Benitez, C.: The Design of a Large Scale Airline Network, Dissertation. Delft University of Technology (2012). doi:10.4233/uuid:c28fef01-c47f-4f92-82ba-6d34d5c4daa4

  35. Calik, H., Alumur, S., Kara, B., Karasan, O.: A tabu-search based heuristic for the hub covering problem over incomplete hub networks. Comput. Oper. Res. 36(12), 3088–3096 (2009). doi:10.1016/j.cor.2008.11.023

    Article  MATH  Google Scholar 

  36. O’Kelly, M.E.: Hub facility location with fixed costs. Pap. Reg. Sci. 71(3), 293–306 (1992). doi:10.1007/BF01434269

    Article  Google Scholar 

  37. Davydov, I., Kochetov, Y., Plyasunov, A.: On the complexity of the \((r|p)\)-centroid problem in the plane. TOP 22(2), 614–623 (2014). doi:10.1007/s11750-013-0275-y

    Article  MathSciNet  MATH  Google Scholar 

  38. Melnikov, A.: Computational complexity of the discrete competitive facility location problem. J. Appl. Ind. Math. 8(4), 557–567 (2014). doi:10.1134/S1990478914040139

    Article  MathSciNet  Google Scholar 

  39. Panin, A.A., Pashchenko, M.G., Plyasunov, A.V.: Bilevel competitive facility location and pricing problems. Autom. Remote Control 75(4), 715–727 (2014). doi:10.1134/S0005117914040110

    Article  MathSciNet  MATH  Google Scholar 

  40. Caprara, A., Carvalho, M., Lodi, A., Woeginger, G.J.: A study a computational complexity of the bi-level knapsack problem. Siam. J. Optim. 2, 823–838 (2014). doi:10.1137/130906593

    Article  MathSciNet  MATH  Google Scholar 

  41. Iellamo, S., Alekseeva, E., Chen, L., Coupechoux, M., Kochetov, Y.: Competitive location in cognitive radio networks. 4OR 13(1), 81–110 (2015). doi:10.1007/s10288-014-0268-1

    Google Scholar 

  42. Lavlinskii, S.M., Panin, A.A., Plyasunov, A.V.: A bilevel planning model for public-private partnership. Autom. Remote Control 76(11), 1976–1987 (2015). doi:10.1134/S0005117915110077

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This research was partially supported by the RFBR grant 16-07-00319.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dimitrije D. Čvokić .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Čvokić, D.D., Kochetov, Y.A., Plyasunov, A.V. (2016). A Leader-Follower Hub Location Problem Under Fixed Markups. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds) Discrete Optimization and Operations Research. DOOR 2016. Lecture Notes in Computer Science(), vol 9869. Springer, Cham. https://doi.org/10.1007/978-3-319-44914-2_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-44914-2_28

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-44913-5

  • Online ISBN: 978-3-319-44914-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics