Studying the effect of considering competition in locating logistic hubs on the international shipping market share using the game theory

Document Type : Original Article

Authors

1 Assistant Professor, Department of Industrial Engineering, University of Tabriz, Tabriz, Iran

2 Department of Management, Faculty of Economics and Management, University of Tabriz, Tabriz, Iran

3 Msc, Department of Management, Faculty of Economics, Management and Business, University of Tabriz, Tabriz, Iran

Abstract

Hub location problem (HLP) is one of the strategic planning problems in logistics with numerous applications in passenger/cargo transportation, postal services, telecommunications, etc. This paper addresses the competitive single allocation HLP where the market is assumed to be a duopoly. Two firms (decision makers) sequentially decide on the configuration of their hub networks trying to maximize their own market shares and the customers choose one firm based on the service level (cost, distance, and etc.) provided by these firms. Mathematical formulations are provided for the problems of the first and second firms (the leader and the follower, respectively) and a tabu search (TS) based solution algorithm is proposed for solving the leader's and the follower's problems. Standard data sets, which exist in the literature of HLP, have been used to validate the solution methods and mathematical models. Computational experiments show that considering the competition in deciding on the location of hubs can positively affect the captured market share from the international shipping markets.

Keywords

References

  1.  

    1. Alumur, S. A., Nickel, S., & Saldanha-da-Gama, F. (2012). Hub location under uncertainty. Transportation Research Part B: Methodological, 46 (4): 529-543.
    2. Alumur, S., & Kara, B. Y. (2008). Network hub location problems: The state of the art. European journal of operational research, 190 (1): 1-21.
    3. Campbell, J. F. (1994). Integer programming formulations of discrete hub location problems. European Journal of Operational Research, 72 (2): 387-405.
    4. Campbell, J. F., & O'Kelly, M. E. (2012). Twenty-five years of hub location research. Transportation Science, 46 (2): 153-169.
    5. Chen, J. F. (2007). A hybrid heuristic for the uncapacitated single allocation hub location problem. Omega, 35 (2): 211-220.
    6. Contreras, I., Cordeau, J. F., & Laporte, G. (2011). Stochastic uncapacitated hub location. European Journal of Operational Research, 212 (3): 518-528.
    7. Cournot, A. A. (1838). Recherches sur les principes mathématiques de la théorie des richesses par Augustin Cournot. chez L. Hachette.
    8. Eiselt, H. A., & Marianov, V. (2009). A conditional p-hub location problem with attraction functions. Computers & Operations Research, 36 (12): 3128-3135.
    9. Eiselt, H. A., Marianov, V., & Drezner, T. (2015). Competitive location models. In Location science (pp. 365-398). Springer International Publishing.
    10. Ernst, A. T., & Krishnamoorthy, M. (1996). Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location science, 4 (3): 13s9-154.
    11. Farahani, R. Z., Hekmatfar, M., Arabani, A. B., & Nikbakhsh, E. (2013). Hub location problems: A review of models, classification, solution techniques, and applications. Computers & Industrial Engineering, 64 (4): 1096-1109.
    12. Glover, F. (1986). Future paths for integer programming and links to artificial intelligence. Computers & operations research, 13 (5): 533-549.
    13. Hotelling (1929). Stability in competition. Economic Journal, 39, pp. 41–57.
    14. Jabalameli, M. S., Barzinpour, F., Saboury, A., & Ghaffari-Nasab, N. (2012). A simulated annealing-based heuristic for the single allocation maximal covering hub location problem. International Journal of Metaheuristics, 2 (1): 15-37.
    15. Kara, B. Y. (1999). Modeling and analysis of issues in hub location problem (Doctoral dissertation, Bilkent University).
    16. Kress, D., & Pesch, E. (2012). Sequential competitive location on networks. European Journal of Operational Research, 217 (3): 483-499.
    17. Laporte, G., Nickel, S., & da Gama, F. S. (2015). Location science (p. 644). Berlin: Springer.
    18. Lin, C. C., & Lee, S. C. (2010). The competition game on hub network design. Transportation Research Part B: Methodological, 44 (4): 618-629.
    19. Lüer-Villagra, A., & Marianov, V. (2013). A competitive hub location and pricing problem. European Journal of Operational Research, 231 (3): 734-744.
    20. Mahmutogullari, A. I., & Kara, B. Y. (2016). Hub location under competition. European Journal of Operational Research, 250 (1): 214-225.
    21. Marianov, V., Serra, D., & ReVelle, C. (1999). Location of hubs in a competitive environment. European Journal of Operational Research, 114 (2): 363-371.
    22. O'kelly, M. E. (1986). The location of interacting hub facilities. Transportation science, 20 (2): 92-106.
    23. O'kelly, M. E. (1987). A quadratic integer program for the location of interacting hub facilities. European Journal of Operational Research, 32 (3): 393-404.
    24. O'Kelly, M. E. (1992). Hub facility location with fixed costs. Papers in Regional Science, 71 (3): 293-306.
    25. Sasaki, M. (2005). Hub network design model in a competitive environment with flow threshold. Journal of the Operations Research Society of Japan, 48 (2): 158-171.
    26. Sasaki, M., & Fukushima, M. (2001). Stackelberg hub location problem. Journal of the Operations Research Society of Japan, 44 (4): 390-402.
    27. Sasaki, M., Campbell, J. F., Krishnamoorthy, M., & Ernst, A. T. (2014). A Stackelberg hub arc location model for a competitive environment. Computers & Operations Research, 47, 27-41.
    28. Silva, M. R., & Cunha, C. B. (2009). New simple and efficient heuristics for the uncapacitated single allocation hub location problem. Computers & Operations Research, 36 (12): 3152-3165.
    29. Skorin-Kapov, D., & Skorin-Kapov, J. (1994). On tabu search for the location of interacting hub facilities. European Journal of Operational Research, 73 (3): 502-509.
    30. Tan, P. Z., & Kara, B. Y. (2007). A hub covering model for cargo delivery systems. Networks, 49 (1): 28-39.
    31. Topcuoglu, H., Corut, F., Ermis, M., & Yilmaz, G. (2005). Solving the uncapacitated hub location problem using genetic algorithms. Computers & Operations Research, 32 (4): 967-984.
    32. Von Stackelberg, H. (1951). Grundlagen der theoretischen Volkswirtschaftslehre. Mohr Siebeck.
    33. Wagner, B. (2008). A note on “location of hubs in a competitive environment”. European Journal of Operational Research, 184 (1): 57-62.  

     

Journal of International Business Administration
Volume 1, Issue 1 - Serial Number 1
September 2018
Pages 25-46

Files

History

  • Receive Date: 14 May 2018
  • Revise Date: 18 May 2019
  • Accept Date: 10 July 2018

Share

How to cite

Statistics