The L-shaped method for large-scale mixed-integer waste management decision making problems
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F17%3A63517655" target="_blank" >RIV/70883521:28140/17:63517655 - isvavai.cz</a>
Nalezeny alternativní kódy
RIV/00216305:26210/17:PU125027
Výsledek na webu
<a href="http://www.aidic.it/cet/17/61/179.pdf" target="_blank" >http://www.aidic.it/cet/17/61/179.pdf</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.3303/CET1761179" target="_blank" >10.3303/CET1761179</a>
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
The L-shaped method for large-scale mixed-integer waste management decision making problems
Popis výsledku v původním jazyce
It is without a doubt that deciding upon strategic issues requires us to somehow anticipate and consider possible variations of the future. Unfortunately, when it comes to the actual modelling, the sheer size of the problems that accurately describe the uncertainty is often extremely hard to work with. This paper aims to describe a possible way of dealing with the issue of large-scale mixed integer models (in term of the number of possible future scenarios it can handle) for the studied waste management decision making problem. The algorithm is based on the idea of decomposing the overall problem alongside the different scenarios and solving these smaller problems instead. The use of the algorithm is demonstrated on a strategic waste management problem of choosing the optimal sites to build new incineration plants, while minimizing the expected cost of waste transport and processing. The uncertainty was modelled by 5,000 scenarios and the problem was solved to high accuracy using relatively modest means (in terms of computational power and needed software).
Název v anglickém jazyce
The L-shaped method for large-scale mixed-integer waste management decision making problems
Popis výsledku anglicky
It is without a doubt that deciding upon strategic issues requires us to somehow anticipate and consider possible variations of the future. Unfortunately, when it comes to the actual modelling, the sheer size of the problems that accurately describe the uncertainty is often extremely hard to work with. This paper aims to describe a possible way of dealing with the issue of large-scale mixed integer models (in term of the number of possible future scenarios it can handle) for the studied waste management decision making problem. The algorithm is based on the idea of decomposing the overall problem alongside the different scenarios and solving these smaller problems instead. The use of the algorithm is demonstrated on a strategic waste management problem of choosing the optimal sites to build new incineration plants, while minimizing the expected cost of waste transport and processing. The uncertainty was modelled by 5,000 scenarios and the problem was solved to high accuracy using relatively modest means (in terms of computational power and needed software).
Klasifikace
Druh
J<sub>SC</sub> - Článek v periodiku v databázi SCOPUS
CEP obor
—
OECD FORD obor
10102 - Applied mathematics
Návaznosti výsledku
Projekt
Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.
Návaznosti
V - Vyzkumna aktivita podporovana z jinych verejnych zdroju
Ostatní
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ů
Údaje specifické pro druh výsledku
Název periodika
Chemical Engineering Transactions
ISSN
2283-9216
e-ISSN
—
Svazek periodika
Neuveden
Číslo periodika v rámci svazku
61
Stát vydavatele periodika
IT - Italská republika
Počet stran výsledku
6
Strana od-do
1087-1092
Kód UT WoS článku
—
EID výsledku v databázi Scopus
2-s2.0-85030759300