Verification of Information in Large Databases by Mathematical Programming in Waste Management

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F17%3APU124896" target="_blank" >RIV/00216305:26210/17:PU124896 - isvavai.cz</a>

Výsledek na webu

<a href="http://www.aidic.it/cet/17/61/162.pdf" target="_blank" >http://www.aidic.it/cet/17/61/162.pdf</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.3303/CET1761162" target="_blank" >10.3303/CET1761162</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Verification of Information in Large Databases by Mathematical Programming in Waste Management

Popis výsledku v původním jazyce

The obligation to register production and waste management leads to a formation of a large-scale database. The reporting obligation concerns immediately a large number of subject that may cause discrepancies in reported data. The paper presents an approach for error detection in large data files. Errors are reflected as inconsistency in total production and processing or in transportation between two nodes. In this case, the area (node), that has sent the waste, registers a different quantity than the node that has received the waste. The database of waste management is an essential source of information for many calculations and analysis, which further open up the scope for the realisation of projects, so it is important to have accurate data. This paper presents an approach for identifying errors in the database using mathematical programming techniques. This issue was solved as a task of network flow with an emphasis on the force of mass balance in nodes. The objective is to make the amount of produced and delivered waste to each node equal to the amount that was there processed or removed. This is required with the minimum modification of the input data. Weights are introduced to distinguish high and low-quality data by assigning bigger values to arcs where sent amount correspond with quantity received. In this case, there is no reason to consider the data as erroneous. This tool has been tested through a case study on the database of waste management in the Czech Republic. The considered network consist of 206 nodes representing municipalities, which corresponds to 42,230 edges (possible flows). The output from the calculation is a large amount of data, which are in terms of approximation to initial values interpreted as maps. However, the tool could be used for other areas of records and databases, where there is a transfer of any material flow. In the further research, the model can be supplemented by specific constraints arising from additional informatio

Název v anglickém jazyce

Verification of Information in Large Databases by Mathematical Programming in Waste Management

Popis výsledku anglicky

The obligation to register production and waste management leads to a formation of a large-scale database. The reporting obligation concerns immediately a large number of subject that may cause discrepancies in reported data. The paper presents an approach for error detection in large data files. Errors are reflected as inconsistency in total production and processing or in transportation between two nodes. In this case, the area (node), that has sent the waste, registers a different quantity than the node that has received the waste. The database of waste management is an essential source of information for many calculations and analysis, which further open up the scope for the realisation of projects, so it is important to have accurate data. This paper presents an approach for identifying errors in the database using mathematical programming techniques. This issue was solved as a task of network flow with an emphasis on the force of mass balance in nodes. The objective is to make the amount of produced and delivered waste to each node equal to the amount that was there processed or removed. This is required with the minimum modification of the input data. Weights are introduced to distinguish high and low-quality data by assigning bigger values to arcs where sent amount correspond with quantity received. In this case, there is no reason to consider the data as erroneous. This tool has been tested through a case study on the database of waste management in the Czech Republic. The considered network consist of 206 nodes representing municipalities, which corresponds to 42,230 edges (possible flows). The output from the calculation is a large amount of data, which are in terms of approximation to initial values interpreted as maps. However, the tool could be used for other areas of records and databases, where there is a transfer of any material flow. In the further research, the model can be supplemented by specific constraints arising from additional informatio

Druh

J_SC - Článek v periodiku v databázi SCOPUS

CEP obor

—

OECD FORD obor

10103 - Statistics and probability

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

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

Rok uplatnění

2017

Kód důvěrnosti údajů

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

Název periodika

Chemical Engineering Transactions

ISSN

2283-9216

e-ISSN

—

Svazek periodika

2017

Číslo periodika v rámci svazku

61

Stát vydavatele periodika

IT - Italská republika

Počet stran výsledku

6

Strana od-do

985-990

Kód UT WoS článku

—

EID výsledku v databázi Scopus

2-s2.0-85030750706