Publication detail

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

JANOŠŤÁK, F. PAVLAS, M. PUTNA, O. ŠOMPLÁK, R. POPELA, P.

Original Title

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

English Title

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

Type

journal article in Scopus

Language

en

Original Abstract

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.

English abstract

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.

Keywords

Waste management, Pricing, Heuristic algorithm, Two-stage programming, Waste-to-Energy Plant

Released

08.06.2016

Publisher

VUT

Location

Brno

Pages from

123

Pages to

130

Pages count

6

BibTex


@article{BUT131071,
  author="František {Janošťák} and Martin {Pavlas} and Ondřej {Putna} and Radovan {Šomplák} and Pavel {Popela}",
  title="Heuristic Approximation and Optimization for Waste-to-Energy Capacity Expansion Problem",
  annote="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.",
  address="VUT",
  chapter="131071",
  howpublished="print",
  institution="VUT",
  number="1",
  volume="2016",
  year="2016",
  month="june",
  pages="123--130",
  publisher="VUT",
  type="journal article in Scopus"
}