Facility Location Problem on Network Based on Group Centrality Measure Considering Cooperation and Competition

  • Takayasu FushimiEmail author
  • Seiya Okubo
  • Kazumi Saito
Conference paper
Part of the Studies in Computational Intelligence book series (SCI, volume 881)


In this study, we tackle the problem of extracting candidate locations for facilities, such as convenience stores, gas stations, and supermarkets, based on closeness centrality while considering the target city a spatial network. When placing a new facility in a local area, locating it with high accessibility for neighboring residents can attract customers from existing facilities and expand its own trading area. In addition, when there are multiple groups, a location that takes into account both the cooperative and competitive relationships among the groups is required. In this study, we focus on group centrality, which extends the concept of centrality from individual nodes to node groups, and propose group-closeness centrality that considers cooperation and competition. Based on information of the existing facility’s location and its trading area, our method outputs a candidate site of a new facility. From experimental evaluations using actual data, i.e., road networks and location information of convenience stores in four cities, we confirm that the proposed measure can extract different candidate locations for each group in consideration of the positional relationship with nodes belonging to different groups.



This material is based upon work supported by JSPS Grant-in-Aid for Scientific Research (B) (No. 17H01826) and Early-Career Scientists (No. 19K20417).


  1. 1.
    Agra, A., Cerdeira, J.O., Requejo, C.: A decomposition approach for the p-median problem on disconnected graphs. Comput. Oper. Res. 86, 79–85 (2017)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Crucitti, P., Latora, V., Porta, S.: Centrality measures in spatial networks of urban streets. Phys. Rev. E 73(3), 036125+ (2006)CrossRefGoogle Scholar
  3. 3.
    Everett, M.G., Borgatti, S.P.: The centrality of groups and classes. J. Math. Sociol. 23(3), 181–201 (1999)CrossRefGoogle Scholar
  4. 4.
    Montis, D.A., Barthelemy, M., Chessa, A., Vespignani, A.: The structure of interurban traffic: a weighted network analysis. Environ. Plann. 34(5), 905–924 (2007)CrossRefGoogle Scholar
  5. 5.
    Park, K., Yilmaz, A.: A social network analysis approach to analyze road networks. In: Proceedings of the ASPRS Annual Conference 2010 (2010)Google Scholar
  6. 6.
    Rahmaniani, R., Ghaderi, A.: A combined facility location and network design problem with multi-type of capacitated links. Appl. Math. Model. 37(9), 6400–6414 (2013)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Tabata, K., Nakamura, A., Kudo, M.: An efficient approximate algorithm for the 1-median problem on a graph. IEICE Trans. Inf. Syst. E100.D(5), 994–1002 (2017)CrossRefGoogle Scholar
  8. 8.
    Thorup, M.: Quick k-median, k-center, and facility location for sparse graphs. SIAM J. Comput. 34(2), 405–432 (2004)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.School of Computer ScienceTokyo University of TechnologyHachiojiJapan
  2. 2.School of Management and InformationUniversity of ShizuokaShizuokaJapan
  3. 3.Faculty of ScienceKanagawa UniversityHiratsukaJapan
  4. 4.Center for Advanced Intelligence ProjectRIKENTokyoJapan

Personalised recommendations