All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Clustering and optimising regional segregated resource allocation networks

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F22%3APU145624" target="_blank" >RIV/00216305:26210/22:PU145624 - isvavai.cz</a>

  • Result on the web

    <a href="https://www-sciencedirect-com.ezproxy.lib.vutbr.cz/science/article/pii/S0301479722016036" target="_blank" >https://www-sciencedirect-com.ezproxy.lib.vutbr.cz/science/article/pii/S0301479722016036</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.jenvman.2022.116030" target="_blank" >10.1016/j.jenvman.2022.116030</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Clustering and optimising regional segregated resource allocation networks

  • Original language description

    Policymakers and officials worldwide are making more stringent environmental norms and waste disposal policies to encourage industries to move towards cleaner production. One of the main challenges that industries face moving towards cleaner production is the adoption of different strategies for optimising their resource utilisation and waste reduction economically. This is particularly challenging for large-scale industries or a group of industrial plants located in an industrial region. This paper presents a novel approach to economic resource optimisation focussed mainly on large-scale industries, different industrial plants located in the vicinity of each other, or an industrial symbiosis network. In this work, a clustering algorithm is developed to segregate the given plants into different clusters based on the concept of load deficits and surpluses of each plant. The concept ideally allows only the plants with surpluses to send out their unused sources and plants with deficits to only receive external sources/resources. The clusters are formed based on the distances between plants, which in turn helps in saving transportation and communication costs. The clustered plants are then easy to optimise and manage for resource and cost optimality. The applicability of the proposed clustering algorithm is demonstrated using two case studies from the domain of water recycling networks containing multiple contaminants with detailed network design, highlighting the importance of clustering in an industrial symbiosis network. It is observed that directing the excess flows from one plant to other plants in the same cluster can save a considerable amount of fresh resources. It implies that in the broader aspect, the developed methodology can address the optimisation of economic resources and can aid in the better management of overall resources for a large-scale industrial symbiosis network.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    20704 - Energy and fuels

Result continuities

  • Project

    <a href="/en/project/EF15_003%2F0000456" target="_blank" >EF15_003/0000456: Sustainable Process Integration Laboratory (SPIL)</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2022

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    JOURNAL OF ENVIRONMENTAL MANAGEMENT

  • ISSN

    0301-4797

  • e-ISSN

    1095-8630

  • Volume of the periodical

    neuveden

  • Issue of the periodical within the volume

    322

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    12

  • Pages from-to

    „“-„“

  • UT code for WoS article

    000864068800004

  • EID of the result in the Scopus database

    2-s2.0-85137292099