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

An Improved Optimization Algorithm Based on Density Grid for Green Storage Monitoring System

Author

Listed:
  • Yanting Zhang

    (School of Marxism Studies, Jilin University, Changchun 130021, China)

  • Zhe Zhu

    (School of Marxism Studies, Jilin University, Changchun 130021, China)

  • Wei Ning

    (Economic Research Institute of Jilin Province Development and Reform Commission, Changchun 130061, China)

  • Amir M. Fathollahi-Fard

    (Department of Electrical Engineering, École de Technologie Supérieure, University of Québec, Montréal, QC H3C 1K3, Canada)

Abstract

This study takes a sample of green storage monitoring data for corn from a biochemical energy enterprise, based on the enterprise’s original storage monitoring system while establishing a “green fortress” intending to achieve green and sustainable grain storage. This paper proposes a set of processing algorithms for real-time flow data from the storage system based on cluster analysis to detect abnormal storage conditions, achieve the goal of green grain storage and maximize benefits for the enterprises. Firstly, data from the corn storage monitoring system and the current status of research on data processing algorithms are analyzed. Our study summarizes the processing of re-al-time stream data together with the characteristics of the monitoring system and discusses the application of clustering analysis algorithms. The study includes an in-depth study of the green storage monitoring system data for corn and the processing requirements for real-time stream data. As the main novelty of this research, the optimization algorithm model is applied to the green storage monitoring system for maize and is validated. Finally, the processing results for the green storage monitoring data for maize are presented in graphical and textual formats.

Suggested Citation

  • Yanting Zhang & Zhe Zhu & Wei Ning & Amir M. Fathollahi-Fard, 2022. "An Improved Optimization Algorithm Based on Density Grid for Green Storage Monitoring System," Sustainability, MDPI, vol. 14(17), pages 1-19, August.
    • Handle: RePEc:gam:jsusta:v:14:y:2022:i:17:p:10822-:d:902024
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/14/17/10822/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/14/17/10822/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Narjes Vara & Mahdieh Mirzabeigi & Hajar Sotudeh & Seyed Mostafa Fakhrahmad, 2022. "Application of k-means clustering algorithm to improve effectiveness of the results recommended by journal recommender system," Scientometrics, Springer;Akadémiai Kiadó, vol. 127(6), pages 3237-3252, June.
    2. Chandra Naik & Pushparaj D. Shetty, 2022. "FLAG: fuzzy logic augmented game theoretic hybrid hierarchical clustering algorithm for wireless sensor networks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 79(4), pages 559-571, April.
    3. Felix Bock, 2022. "Hierarchy cost of hierarchical clusterings," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 617-634, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Maryam Moradi & Gabriel J. Assaf, 2023. "Designing and Building an Intelligent Pavement Management System for Urban Road Networks," Sustainability, MDPI, vol. 15(2), pages 1-17, January.

    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. Mohammed Azmi Al-Betar & Ammar Kamal Abasi & Ghazi Al-Naymat & Kamran Arshad & Sharif Naser Makhadmeh, 2023. "Optimization of scientific publications clustering with ensemble approach for topic extraction," Scientometrics, Springer;Akadémiai Kiadó, vol. 128(5), pages 2819-2877, May.

    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:14:y:2022:i:17:p:10822-:d:902024. 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.