Advertisement

The Competitive Hub Location Under the Price War

  • Dimitrije D. ČvokićEmail author
  • Yury A. Kochetov
  • Aleksandr V. Plyasunov
  • Aleksandar Savić
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11548)

Abstract

Two transportation companies want to enter the market and they are aware of each other. The objective for the both of competitors is to maximize their respective profits by finding the best hub and spoke networks and price structures. One company wants to establish r hubs and the other wants to establish p hubs. It is assumed that the customers choose the route by price and the logistic regression based model is used to estimate how the demand is shared. After setting their networks, the competing companies engage in the price war. We propose a new model for finding a Stackelberg strategy that includes a price game, as bi-level nonlinear mixed-integer program, called the (\(r{\mid }p\)) hub-centroid problem under the price war. It is shown that there is a unique finite Bertrand-Nash price equilibrium. On the basis of this result, we show the solution existence, propose a new equations for the best response pricing, and address the computational complexity of the problem. Finally, we discuss some possible future research directions that concern the solution approach and some other competitive scenarios that involve pricing.

Keywords

Hub location Logit model Stackelberg strategy Bertrand price equilibrium Complexity 

References

  1. 1.
    Campbell, J., O’Kelly, M.: Twenty-five years of hub location research. Transp. Sci. 46(2), 153–169 (2012)CrossRefGoogle Scholar
  2. 2.
    Farahani, R., Hekmatfar, M., Arabani, A., Nikbakhsh, E.: Hub location problems: a review of models, classification, solution techniques, and applications. Comput. Ind. Eng. 64(4), 1096–1109 (2013)CrossRefGoogle Scholar
  3. 3.
    Lüer-Villagra, A., Marianov, V.: A competitive hub location and pricing problem. Eur. J. Oper. Res. 231(3), 734–744 (2013)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Sasaki, M., Fukushima, M.: Stackelberg hub location problem. J. Oper. Res. Soc. Japan 44(4), 390–405 (2001)MathSciNetzbMATHGoogle Scholar
  5. 5.
    Mahmutogullari, I., Kara, B.: Hub location under competition. Eur. J. Oper. Res. 250(1), 214–225 (2016)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Čvokić, D., Kochetov, Y., Plyasunov, A.: The existance of equilibria in the leader-follower hub location and pricing problem. In: Dörner, K., Ljubic, I., Pflug, G., Tragler, G. (eds.) Operations Research Proceedings 2015. Springer, Cham (2017).  https://doi.org/10.1007/978-3-319-42902-1_73CrossRefGoogle Scholar
  7. 7.
    Karakitsiou, A.: Modeling Discrete Competitive Facility Location. Springer, Cham (2015).  https://doi.org/10.1007/978-3-319-21341-5CrossRefzbMATHGoogle Scholar
  8. 8.
    Karakitsiou, A., Migdalas, A.: Nash type games in competitive facilities location. Int. J. Decis. Support. Syst. 2(1/2/3), 4–12 (2016)CrossRefGoogle Scholar
  9. 9.
    Čvokić, D.D., Kochetov, Y.A., Plyasunov, A.V.: A leader-follower hub location problem under fixed markups. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds.) DOOR 2016. LNCS, vol. 9869, pp. 350–363. Springer, Cham (2016).  https://doi.org/10.1007/978-3-319-44914-2_28CrossRefGoogle Scholar
  10. 10.
    Sasaki, M.: Hub network design model in a competitive environment with flow threshold. J. Oper. Res. Soc. Jpn. 48, 158–71 (2005)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Bitran, G., Ferrer, J.C.: On pricing and composition of bundles. Prod. Oper. Manag. 16, 93–108 (2007)CrossRefGoogle Scholar
  12. 12.
    Dempe, S.: Foundations of Bilevel Programming, pp. 1–6. Kluwer Academic, Dordrecht (2002)zbMATHGoogle Scholar
  13. 13.
    Alekseeva, E., Kochetov, Y.: Matheuristics and exact methods for the discrete (\(r|p\))-centroid problem. In: El-Ghazali, T. (ed.) Metaheuristics for Bi-level Optimization. SCI, vol. 482, pp. 189–219. Springer, Heidelberg (2013).  https://doi.org/10.1007/978-3-642-37838-6_7CrossRefGoogle Scholar
  14. 14.
    Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in the Mathematical Sciences. W. H. Freeman and Company, New York (1979)zbMATHGoogle Scholar
  15. 15.
    Kononov, A.A., Panin, A.A., Plyasunov, V.A.: A bilevel competitive location and pricing model with non-uniform split of the demand. J. Appl. Ind. Math. 13, 519 (2019)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Faculty of Natural Sciences and MathematicsUniversity of Banja LukaBanja LukaBosnia and Herzegovina
  2. 2.Sobolev Institute of MathematicsNovosibirskRussia
  3. 3.Novosibirsk State UniversityNovosibirskRussia
  4. 4.Faculty of MathematicsUniversity of BelgradeBelgradeSerbia

Personalised recommendations