Waste processing facility location problem by stochastic programming: Models and solutions
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F19%3A63524186" target="_blank" >RIV/70883521:28140/19:63524186 - isvavai.cz</a>
Nalezeny alternativní kódy
RIV/00216305:26210/18:PU130243
Výsledek na webu
<a href="http://dx.doi.org/10.1007/978-3-319-97888-8_15" target="_blank" >http://dx.doi.org/10.1007/978-3-319-97888-8_15</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-97888-8_15" target="_blank" >10.1007/978-3-319-97888-8_15</a>
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
Waste processing facility location problem by stochastic programming: Models and solutions
Popis výsledku v původním jazyce
The paper deals with the so-called waste processing facility location problem (FLP), which asks for establishing a set of operational waste processing units, optimal against the total expected cost. We minimize the waste management (WM) expenditure of the waste producers, which is derived from the related waste processing, transportation, and investment costs. We use a stochastic programming approach in recognition of the inherent uncertainties in this area. Two relevant models are presented and discussed in the paper. Initially, we extend the common transportation network flow model with on-and-off waste-processing capacities in selected nodes, representing the facility location. Subsequently, we model the randomly-varying production of waste by a scenario-based two-stage stochastic integer linear program. Finally, we employ selected pricing ideas from revenue management to model the behavior of the waste producers, who we assume to be environmentally friendly. The modeling ideas are illustrated on an example of limited size solved in GAMS. Computations on larger instances were realized with traditional and heuristic algorithms, implemented within MATLAB.
Název v anglickém jazyce
Waste processing facility location problem by stochastic programming: Models and solutions
Popis výsledku anglicky
The paper deals with the so-called waste processing facility location problem (FLP), which asks for establishing a set of operational waste processing units, optimal against the total expected cost. We minimize the waste management (WM) expenditure of the waste producers, which is derived from the related waste processing, transportation, and investment costs. We use a stochastic programming approach in recognition of the inherent uncertainties in this area. Two relevant models are presented and discussed in the paper. Initially, we extend the common transportation network flow model with on-and-off waste-processing capacities in selected nodes, representing the facility location. Subsequently, we model the randomly-varying production of waste by a scenario-based two-stage stochastic integer linear program. Finally, we employ selected pricing ideas from revenue management to model the behavior of the waste producers, who we assume to be environmentally friendly. The modeling ideas are illustrated on an example of limited size solved in GAMS. Computations on larger instances were realized with traditional and heuristic algorithms, implemented within MATLAB.
Klasifikace
Druh
D - Stať ve sborníku
CEP obor
—
OECD FORD obor
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Návaznosti výsledku
Projekt
—
Návaznosti
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Ostatní
Rok uplatnění
2019
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 statě ve sborníku
Advances in Intelligent Systems and Computing, Volume 837
ISBN
978-331997887-1
ISSN
21945357
e-ISSN
—
Počet stran výsledku
13
Strana od-do
167-179
Název nakladatele
Springer Verlag
Místo vydání
Berlín
Místo konání akce
Brno
Datum konání akce
20. 6. 2017
Typ akce podle státní příslušnosti
WRD - Celosvětová akce
Kód UT WoS článku
—