Heuristic Approximation and Optimization for Waste-to-Energy Capacity Expansion Problem

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F16%3APU121717" target="_blank" >RIV/00216305:26210/16:PU121717 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Heuristic Approximation and Optimization for Waste-to-Energy Capacity Expansion Problem

Popis výsledku v původním jazyce

The following paper is devoted to the construction of new waste-to-energy plants in a territory where is already another fossil-fuel power station built. The aim is to create a mathematical model and show that those two devices are able to cooperate effectively. The related mathematical programs are developed, linked, and implemented in GAMS. For computational purposes a specific heuristic that optimizes unknown approximated profit function relating IRR and plant capacity is considered. The built models focus on operational policies and can be characterised as non-linear integer programs. The optimization software GAMS is used for their calculation. Because of the model complexity the solution process starting in a certain initial point may end in a local optima or not found any at all. So, the paper also focuses on the elimination of nonlinear terms by using binary variables in such a way that the transformed optimization program can be solved within acceptable time limits and the suboptimal solution is reached.

Název v anglickém jazyce

Heuristic Approximation and Optimization for Waste-to-Energy Capacity Expansion Problem

Popis výsledku anglicky

The following paper is devoted to the construction of new waste-to-energy plants in a territory where is already another fossil-fuel power station built. The aim is to create a mathematical model and show that those two devices are able to cooperate effectively. The related mathematical programs are developed, linked, and implemented in GAMS. For computational purposes a specific heuristic that optimizes unknown approximated profit function relating IRR and plant capacity is considered. The built models focus on operational policies and can be characterised as non-linear integer programs. The optimization software GAMS is used for their calculation. Because of the model complexity the solution process starting in a certain initial point may end in a local optima or not found any at all. So, the paper also focuses on the elimination of nonlinear terms by using binary variables in such a way that the transformed optimization program can be solved within acceptable time limits and the suboptimal solution is reached.

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í

2016

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

Mendel Journal series

ISSN

1803-3814

e-ISSN

—

Svazek periodika

2016

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

CZ - Česká republika

Počet stran výsledku

6

Strana od-do

123-130

Kód UT WoS článku

—

EID výsledku v databázi Scopus

2-s2.0-85014971385