IDEAS home Printed from https://ideas.repec.org/a/hin/complx/4489802.html
   My bibliography  Save this article

Performance Optimization Method of Community Sports Facilities Configuration Based on Linear Planning Model

Author

Listed:
  • Xuefeng Tan
  • Chenggen Guo
  • Pu Sun
  • Shaojie Zhang
  • Harish Garg

Abstract

The conventional community sports facility allocation methods have high minimum costs, and a new community sports facility allocation performance optimization method is designed based on a linear programming model in order to reduce the performance capital investment. The standardized community sports facility allocation performance objective function is established, and a pairwise model is built to divide the feasible and optimal solutions, and the feasible solutions and their constraints are found out. Establish a community sports facility configuration performance optimization model, delineate the boundaries of the optimal solution by bifurcation, and set the feasible domain of the performance optimization model. The performance optimization algorithm is designed to improve the speed of community sports facility allocation performance optimization. In the experiment, the method is compared with data-driven method, digital management method, and evolutionary game algorithm, which requires less capital investment in spring, autumn, and winter than digital management method and evolutionary game algorithm, and the minimum capital investment in summer is less than the other three methods. From the above experimental data, it is clear that the performance optimization method has the smallest minimum capital investment and achieves the purpose of reducing the input cost.

Suggested Citation

  • Xuefeng Tan & Chenggen Guo & Pu Sun & Shaojie Zhang & Harish Garg, 2022. "Performance Optimization Method of Community Sports Facilities Configuration Based on Linear Planning Model," Complexity, Hindawi, vol. 2022, pages 1-7, March.
  • Handle: RePEc:hin:complx:4489802
    DOI: 10.1155/2022/4489802
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2022/4489802.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2022/4489802.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2022/4489802?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:complx:4489802. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.