Skip to main content
Log in

General framework of opening and closing shops over a spatial network based on stochastic utility under competitive and time-bounded environment

  • Original Article
  • Published:
Social Network Analysis and Mining Aims and scope Submit manuscript

Abstract

We propose a general framework of opening and closing shops in group competitive environment, i.e., shops in the same group work cooperatively and those in different groups competitively, based on stochastic utility which is given by a function of shop distance and attractiveness with an explicit traveling time-bound imposed. The framework allows to derive a specific prediction model by choosing a specific function form of utility, including the one we propose, its variants and the conventional state-of-the-art gravity model which we chose as a reference. We compute a marginal gain of the market share which is derived from the utility function and the consumers buying power as a measure to rank the candidate location. Using the real dataset of three convenience store groups in four cities in Japan, we analyzed how the derived models behave with respect to the time-bound and the other parameters and how each model compare with others. We confirm that, despite the simplification we made in the model, inferred rankings of the shops newly opened in the real data are shown to be high implying that our prediction model and other variants are reasonable. We show that our model gives much more realistic results than the gravity model, which indicates that our group competitive mechanism with the time-bounded stochastic utility is vital and promising. Inclusion of the time-bound constraint is crucially important. Analyses of the dynamics of opening and closing shops indicate that competition indeed affects the market share of each group over time, and the total share eventually increases although small, and the difference of the share within each group gradually becomes smaller, revealing that the spatial distribution of the shops in each group becomes more uniform.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

Notes

  1. Facility, shop and store are used interchangeably but we prefer to use shop in this paper.

  2. https://www.openstreetmap.org/

  3. http://snap.stanford.edu/data/index.html

  4. https://www.navitime.co.jp/category/

  5. https://www.e-stat.go.jp/gis/

  6. Here we should note that the closing date information was not available in the above datasets.

References

  • Current J, Ratick S, ReVelle C (1998) Dynamic facility location when the total number of facilities is uncertain: a decision analysis approach. Eur J Oper Res 110(3):597–609

    Article  Google Scholar 

  • Drezner T (1994) Locating a single new facility among existing unequally attractive facilities. J Reg Sci 34(2):237–252

    Article  Google Scholar 

  • Drezner T (1994) Optimal continuous location of a retail facility, facility attractiveness, and market share: an interactive model. J Retail 70(1):49–64

    Article  Google Scholar 

  • Drezner T (2014) A review of competitive facility location in the plane. Logist Res. https://doi.org/10.1007/s12159-014-0114-z

    Article  Google Scholar 

  • Drezner T, Drezner Z (2006) Multiple facilities location in the plane using the gravity model. Geogr Anal 38(4):391–406. https://doi.org/10.1111/j.1538-4632.2006.00692.x

    Article  Google Scholar 

  • Drezner T, Drezner Z, Kalczynski P (2011) A cover-based competitive location model. J Oper Res Soc 62(1):100–113

    Article  Google Scholar 

  • Drezner T, Drezner Z, Kalczynski P (2015) A leader-follower model for discrete competitive facility location. Comput Oper Res 64:51–59

    Article  MathSciNet  Google Scholar 

  • Even-Dar E, Shapira A (2007) A note on maximizing the spread of influence in social networks. In: Internet and Network Economics, Deng X and Graham F (eds) Lecture notes in computer science, vol. 4858, Springer, Berlin, pp 281–286

  • Even-Dar E, Shapira A (2007) A note on maximizing the spread of influence in social networks. In: Internet and Network Economics, Deng X and Graham F (eds) Lecture notes in computer science, Vol. 4858, Springer, Berlin, pp 281–286

  • Everett MG, Borgatti SP (1999) The centrality of groups and classes. J Math Sociol 23(3):181–201

    Article  Google Scholar 

  • Fushimi T, Okubo S, Saito K (2019) Facility location problem on network based on group centrality measure considering cooperation and competition. In: Proceedings of the 8th international conference on complex networks and their applications, pp 64–76

  • Fushimi T, Saito K, Ohara K, Kimura M, Motoda H (2020) Opening and closing dynamics of competing shop groups over spatial networks. In: Proceedings of the 2020 IEEE/ACM international conference on advances in social networks analysis and mining, ASONAM’20, pp 393–400

  • Gao Y, Yang J, Chen G, Zheng B, Chen C (2011) On efficient obstructed reverse nearest neighbor query processing. In: Proceedings of the 19th ACM SIGSPATIAL international conference on advances in geographic information systems, GIS’11. Association for Computing Machinery, New York, NY, USA, pp 191–200. ISBN 9781450310314. https://doi.org/10.1145/2093973.2094000

  • Gao Y, Zheng B, Chen G, Lee W, Lee KCK, Li Q (2009) Visible reverse k-nearest neighbor queries. In: 2009 IEEE 25th international conference on data engineering, pp 1203–1206

  • Hotelling H (1929) Stability in competition. Econ J 39(153):41–57

    Article  Google Scholar 

  • Khosravi S, Akbari Jokar MR (2017) Facility and hub location model based on gravity rule. Comput Ind Eng 109:28–38. https://doi.org/10.1016/j.cie.2017.04.005

    Article  Google Scholar 

  • Kimura M, Saito K, Ohara K, Motoda H (2013) Learning to predict opinion share and detect anti-majority opinionists in social networks. J Intell Inf Syst 41:5–37

    Article  Google Scholar 

  • Lian J, Zhang F, Xie X, Sun G (2017) Restaurant survival analysis with heterogeneous information. In: Proceedings of the 26th international conference on world wide web companion, WWW’17 companion, international world wide web conferences steering committee. Republic and Canton of Geneva, CHE, pp 993–1002. ISBN 9781450349147. https://doi.org/10.1145/3041021.3055130

  • Lin J, Oentaryo R, Lim EP, Vu C, Vu A, Kwee A (2016) Where is the goldmine? finding promising business locations through facebook data analytics. In: Proceedings of the 27th ACM conference on hypertext and social media, HT’16. Association for Computing Machinery, New York, NY, USA, pp 93–102. ISBN 9781450342476. https://doi.org/10.1145/2914586.2914588

  • Montis DA, Barthelemy M, Chessa A, Vespignani A (2007) The structure of interurban traffic: a weighted network analysis. Environ Plan B Plan Des 34(5):905–924

    Article  Google Scholar 

  • Noulas A, Shaw B, Lambiotte R, Mascolo C (2015) Topological properties and temporal dynamics of place networks in urban environments. In: Proceedings of the 24th international conference on world wide web, WWW’15 companion. Association for Computing Machinery, New York, NY, USA, pp 431–441. ISBN 9781450334730. https://doi.org/10.1145/2740908.2745402

  • Park K, Yilmaz A (2010) A social network analysis approach to analyze road networks. In: Proceedings of the ASPRS annual conference 2010

  • Tao Z, Zheng Q, Kong H (2018) A modified gravity p-median model for optimizing facility locations. J Syst Sci Inf 6(5):421–434. https://doi.org/10.21078/JSSI-2018-421-14

    Article  Google Scholar 

  • Wang F, Chen L, Pan W (2016) Where to place your next restaurant? optimal restaurant placement via leveraging user-generated reviews. In: Proceedings of the 25th ACM international on conference on information and knowledge management, CIKM’16. Association for Computing Machinery, New York, NY, USA, pp 2371–2376. ISBN 9781450340731. https://doi.org/10.1145/2983323.2983696

  • Wong RCW, Özsu MT, Yu PS, Fu AWC, Liu L (2009) Efficient method for maximizing bichromatic reverse nearest neighbor. Proc VLDB Endow 2(1):1126–1137. https://doi.org/10.14778/1687627.1687754

    Article  Google Scholar 

  • Xu M, Wang T, Wu Z, Zhou J, Li J, Wu H (2016) Demand driven store site selection via multiple spatial-temporal data. In: Proceedings of the 24th ACM SIGSPATIAL international conference on advances in geographic information systems, SIGSPATIAL’16, Association for computing machinery, New York, NY, USA. ISBN 9781450345897. https://doi.org/10.1145/2996913.2996996

  • Zhang L, Rushton G (2008) Optimizing the size and locations of facilities in competitive multi-site service systems. Comput Oper Res 35(2):327–338

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This work was supported by JSPS KAKENHI Grant Numbers JP20K11940, JP19K20417.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Takayasu Fushimi.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Fushimi, T., Saito, K., Ohara, K. et al. General framework of opening and closing shops over a spatial network based on stochastic utility under competitive and time-bounded environment. Soc. Netw. Anal. Min. 11, 70 (2021). https://doi.org/10.1007/s13278-021-00778-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s13278-021-00778-4

Keywords

Navigation