Skip to main content

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

  • Conference paper
  • First Online:
Complex Networks and Their Applications VIII (COMPLEX NETWORKS 2019)

Part of the book series: Studies in Computational Intelligence ((SCI,volume 881))

Included in the following conference series:

Abstract

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 is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

Notes

  1. 1.

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

  2. 2.

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

  3. 3.

    In this paper, only the results when the number of clusters is 7 are shown, but the clustering results showed a similar tendency with other numbers of clusters.

References

  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)

    Article  MathSciNet  Google Scholar 

  2. Crucitti, P., Latora, V., Porta, S.: Centrality measures in spatial networks of urban streets. Phys. Rev. E 73(3), 036125+ (2006)

    Article  Google Scholar 

  3. Everett, M.G., Borgatti, S.P.: The centrality of groups and classes. J. Math. Sociol. 23(3), 181–201 (1999)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  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. 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)

    Article  MathSciNet  Google Scholar 

  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)

    Article  Google Scholar 

  8. Thorup, M.: Quick k-median, k-center, and facility location for sparse graphs. SIAM J. Comput. 34(2), 405–432 (2004)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

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

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Takayasu Fushimi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Fushimi, T., Okubo, S., Saito, K. (2020). Facility Location Problem on Network Based on Group Centrality Measure Considering Cooperation and Competition. In: Cherifi, H., Gaito, S., Mendes, J., Moro, E., Rocha, L. (eds) Complex Networks and Their Applications VIII. COMPLEX NETWORKS 2019. Studies in Computational Intelligence, vol 881. Springer, Cham. https://doi.org/10.1007/978-3-030-36687-2_6

Download citation

Publish with us

Policies and ethics