Detail publikace

A HEURISTIC APPROACH TO THE FACILITY LOCATION PROBLEM FOR WASTE MANAGEMENT: A CASE STUDY

Originální název

A HEURISTIC APPROACH TO THE FACILITY LOCATION PROBLEM FOR WASTE MANAGEMENT: A CASE STUDY

Anglický název

A HEURISTIC APPROACH TO THE FACILITY LOCATION PROBLEM FOR WASTE MANAGEMENT: A CASE STUDY

Jazyk

en

Originální abstrakt

The aim of this paper is to develop a model for the waste processing facility location problem in selected regions of the Czech Republic and to test a heuristic algorithm that would provide an effective solution to similar larger problems. Within this context, it is understood that the facility location decisions are made on the basis of the minimization of the total costs. The total costs include waste collection costs, facility location investments (or waste treatment costs) and penalty costs for underutilized capacity. Two modelled problems are illustrated on the basis of two examples of limited size. In order to determine whether similar, larger problems can be solved e.g. covering the whole of the Czech Republic, a heuristic algorithm is put forward and test computations performed. The algorithm used in this paper is a novel variant of Success-History Based Parameter Adaptation for Differential Evolution which implements Multi-Chaotic parent selection (MC-SHADE).

Anglický abstrakt

The aim of this paper is to develop a model for the waste processing facility location problem in selected regions of the Czech Republic and to test a heuristic algorithm that would provide an effective solution to similar larger problems. Within this context, it is understood that the facility location decisions are made on the basis of the minimization of the total costs. The total costs include waste collection costs, facility location investments (or waste treatment costs) and penalty costs for underutilized capacity. Two modelled problems are illustrated on the basis of two examples of limited size. In order to determine whether similar, larger problems can be solved e.g. covering the whole of the Czech Republic, a heuristic algorithm is put forward and test computations performed. The algorithm used in this paper is a novel variant of Success-History Based Parameter Adaptation for Differential Evolution which implements Multi-Chaotic parent selection (MC-SHADE).

Dokumenty

BibTex


@article{BUT134966,
  author="Dušan {Hrabec} and Adam {Viktorín} and Radovan {Šomplák} and Michal {Pluháček} and Pavel {Popela}",
  title="A HEURISTIC APPROACH TO THE FACILITY LOCATION PROBLEM FOR WASTE MANAGEMENT: A CASE STUDY
",
  annote="The aim of this paper is to develop a model for the waste processing facility location problem in selected regions of the Czech Republic and to test a heuristic algorithm that would provide an effective solution to similar larger problems. Within this context, it is understood that the facility location decisions are made on the basis of the minimization of the total costs. The total costs include waste collection costs, facility location investments (or waste treatment costs) and penalty costs for underutilized capacity. Two modelled problems are illustrated on the basis of two examples of limited size. In order to determine whether similar, larger problems can be solved e.g. covering the whole of the Czech Republic, a heuristic algorithm is put forward and test computations performed. The algorithm used in this paper is a novel variant of Success-History Based Parameter Adaptation for Differential Evolution which implements Multi-Chaotic parent selection (MC-SHADE).",
  address="VUT",
  chapter="134966",
  howpublished="print",
  institution="VUT",
  number="1",
  volume="2016",
  year="2016",
  month="june",
  pages="61--66",
  publisher="VUT",
  type="journal article in Scopus"
}