IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v15y2023i3p1999-d1042465.html
   My bibliography  Save this article

Research on the Siting of Rural Public Cultural Space Based on the Path-Clustering Algorithm: A Case Study of Yumin Township, Yushu City, Jilin Province, China

Author

Listed:
  • Deli Liu

    (School of Architectural and Urban Planing, Jilin Jianzhu University, Changchun 130118, China)

  • Keqi Wang

    (School of Architectural and Urban Planing, Jilin Jianzhu University, Changchun 130118, China)

Abstract

Cultural revitalization is the foundation of rural revitalization. Rural public cultural spaces are important places for rural residents to participate in cultural activities and important carriers for the occurrence, inheritance and development of rural culture. In this study, we propose a siting analysis method for public cultural spaces based on a path-clustering algorithm. Then, Yumin Township in Jilin Province is used as a case study to test the method. Within the township area, public cultural spaces are divided into three types based on the difference in service scope: “single-village decentralized”, “single-village concentration” and “multi-village concentration”. This paper focuses on the analysis of the siting of the “multi-village concentration” type of public cultural spaces using a path-clustering algorithm. First, the path-clustering algorithm is written, and then its parameters, initial clustering centers and number of clusters are analyzed for their effect on the clustering results. Two parameters, within-cluster sum of path distance (WCSPD) and maximum value of the path distance within-cluster (MPDWC), are proposed to evaluate the results of the algorithm. Then, taking Yumin Township of Jilin Province as an example, the villages in the township are clustered with travel distance as the main influencing factor. It is ensured that the shortest path distance from the central village in each cluster to other villages is no greater than the set travel distance. Finally, the public cultural space is constructed in the central village to serve all villages in the cluster. This siting analysis method can output a variety of results that can be used as a reference for decision making in rural public cultural space planning.

Suggested Citation

  • Deli Liu & Keqi Wang, 2023. "Research on the Siting of Rural Public Cultural Space Based on the Path-Clustering Algorithm: A Case Study of Yumin Township, Yushu City, Jilin Province, China," Sustainability, MDPI, vol. 15(3), pages 1-20, January.
    • Handle: RePEc:gam:jsusta:v:15:y:2023:i:3:p:1999-:d:1042465
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/15/3/1999/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/15/3/1999/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Mladenovic, Nenad & Brimberg, Jack & Hansen, Pierre & Moreno-Perez, Jose A., 2007. "The p-median problem: A survey of metaheuristic approaches," European Journal of Operational Research, Elsevier, vol. 179(3), pages 927-939, June.
    2. Yue Liu & Jun Chen & Weiguang Wu & Jiao Ye, 2019. "Typical Combined Travel Mode Choice Utility Model in Multimodal Transportation Network," Sustainability, MDPI, vol. 11(2), pages 1-15, January.
    3. Bojić, Sanja & Đatkov, Đorđe & Brcanov, Dejan & Georgijević, Milosav & Martinov, Milan, 2013. "Location allocation of solid biomass power plants: Case study of Vojvodina," Renewable and Sustainable Energy Reviews, Elsevier, vol. 26(C), pages 769-775.
    4. Comber, Alexis & Dickie, Jennifer & Jarvis, Claire & Phillips, Martin & Tansey, Kevin, 2015. "Locating bioenergy facilities using a modified GIS-based location–allocation-algorithm: Considering the spatial distribution of resource supply," Applied Energy, Elsevier, vol. 154(C), pages 309-316.
    5. Ahern, Aoife A. & Tapley, Nigel, 2008. "The use of stated preference techniques to model modal choices on interurban trips in Ireland," Transportation Research Part A: Policy and Practice, Elsevier, vol. 42(1), pages 15-27, January.
    6. S. L. Hakimi, 1964. "Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph," Operations Research, INFORMS, vol. 12(3), pages 450-459, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Tao Zhuolin & Zheng Qingjing & Kong Hui, 2018. "A Modified Gravity p-Median Model for Optimizing Facility Locations," Journal of Systems Science and Information, De Gruyter, vol. 6(5), pages 421-434, October.
    2. Michael Brusco & Douglas Steinley, 2015. "Affinity Propagation and Uncapacitated Facility Location Problems," Journal of Classification, Springer;The Classification Society, vol. 32(3), pages 443-480, October.
    3. Costa, Fabrício Rodrigues & Ribeiro, Carlos Antonio Alvares Soares & Marcatti, Gustavo Eduardo & Lorenzon, Alexandre Simões & Teixeira, Thaisa Ribeiro & Domingues, Getulio Fonseca & Castro, Nero Lemos, 2020. "GIS applied to location of bioenergy plants in tropical agricultural areas," Renewable Energy, Elsevier, vol. 153(C), pages 911-918.
    4. Snežana Tadić & Mladen Krstić & Željko Stević & Miloš Veljović, 2023. "Locating Collection and Delivery Points Using the p -Median Location Problem," Logistics, MDPI, vol. 7(1), pages 1-17, February.
    5. Cebi, Selcuk & Ilbahar, Esra & Atasoy, Aylin, 2016. "A fuzzy information axiom based method to determine the optimal location for a biomass power plant: A case study in Aegean Region of Turkey," Energy, Elsevier, vol. 116(P1), pages 894-907.
    6. Vladimir Marianov & Daniel Serra, 2009. "Median problems in networks," Economics Working Papers 1151, Department of Economics and Business, Universitat Pompeu Fabra.
    7. Duran-Mateluna, Cristian & Ales, Zacharie & Elloumi, Sourour, 2023. "An efficient benders decomposition for the p-median problem," European Journal of Operational Research, Elsevier, vol. 308(1), pages 84-96.
    8. Colmenar, J. Manuel & Greistorfer, Peter & Martí, Rafael & Duarte, Abraham, 2016. "Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem," European Journal of Operational Research, Elsevier, vol. 252(2), pages 432-442.
    9. Bargos, Fabiano Fernandes & Lamas, Wendell de Queiroz & Bargos, Danubia Caporusso & Neto, Morun Bernardino & Pardal, Paula Cristiane Pinto Mesquita, 2016. "Location problem method applied to sugar and ethanol mills location optimization," Renewable and Sustainable Energy Reviews, Elsevier, vol. 65(C), pages 274-282.
    10. Michael Brusco & J Dennis Cradit & Douglas Steinley, 2021. "A comparison of 71 binary similarity coefficients: The effect of base rates," PLOS ONE, Public Library of Science, vol. 16(4), pages 1-19, April.
    11. Kenneth Carling & Mengjie Han & Johan Håkansson, 2012. "Does Euclidean distance work well when the p-median model is applied in rural areas?," Annals of Operations Research, Springer, vol. 201(1), pages 83-97, December.
    12. Amir Hossein Sadeghi & Ziyuan Sun & Amirreza Sahebi-Fakhrabad & Hamid Arzani & Robert Handfield, 2023. "A Mixed-Integer Linear Formulation for a Dynamic Modified Stochastic p-Median Problem in a Competitive Supply Chain Network Design," Logistics, MDPI, vol. 7(1), pages 1-24, March.
    13. İbrahim Miraç Eligüzel & Eren Özceylan & Gerhard-Wilhelm Weber, 2023. "Location-allocation analysis of humanitarian distribution plans: a case of United Nations Humanitarian Response Depots," Annals of Operations Research, Springer, vol. 324(1), pages 825-854, May.
    14. Alcaraz, Javier & Landete, Mercedes & Monge, Juan F., 2012. "Design and analysis of hybrid metaheuristics for the Reliability p-Median Problem," European Journal of Operational Research, Elsevier, vol. 222(1), pages 54-64.
    15. Bader F. AlBdaiwi & Diptesh Ghosh & Boris Goldengorin, 2011. "Data aggregation for p-median problems," Journal of Combinatorial Optimization, Springer, vol. 21(3), pages 348-363, April.
    16. Sergio García & Martine Labbé & Alfredo Marín, 2011. "Solving Large p -Median Problems with a Radius Formulation," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 546-556, November.
    17. Antiopi Panteli & Basilis Boutsinas & Ioannis Giannikos, 2021. "On solving the multiple p-median problem based on biclustering," Operational Research, Springer, vol. 21(1), pages 775-799, March.
    18. Alfandari, Laurent, 2004. "Choice Rules with Size Constraints for Multiple Criteria Decision Making," ESSEC Working Papers DR 04002, ESSEC Research Center, ESSEC Business School.
    19. S Salhi & A Al-Khedhairi, 2010. "Integrating heuristic information into exact methods: The case of the vertex p-centre problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(11), pages 1619-1631, November.
    20. M Horn, 1996. "Analysis and Computational Schemes for p-Median Heuristics," Environment and Planning A, , vol. 28(9), pages 1699-1708, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jsusta:v:15:y:2023:i:3:p:1999-:d:1042465. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.