Detail publikace

Heuristic approaches to stochastic quadratic assignment problem: VO and MM cases

Originální název

Heuristic approaches to stochastic quadratic assignment problem: VO and MM cases

Anglický název

Heuristic approaches to stochastic quadratic assignment problem: VO and MM cases

Jazyk

en

Originální abstrakt

The aim of the paper is to build on the previous article, which dealt with heuristic approaches to solving of the so-called EV and EO deterministic reformulations of a stochastic quadratic assignment problem (StoQAP) and focus on the following VO and MM deterministic reformulations. It is known that the deterministic Quadratic Assignment Problem (QAP) belongs to a class of well-known combinatorial optimization problems. Working with several real-world applications we have found that the QAP parameters can also be considered stochastic ones. Thus, we review a Stochastic Quadratic Assignment Problem (StoQAP) as a stochastic program and discuss its suitable deterministic reformulations. The focus is on VO and MM reformulations and results of test computations for the selected instances of StoQAP by metaheuristic are presented.

Anglický abstrakt

The aim of the paper is to build on the previous article, which dealt with heuristic approaches to solving of the so-called EV and EO deterministic reformulations of a stochastic quadratic assignment problem (StoQAP) and focus on the following VO and MM deterministic reformulations. It is known that the deterministic Quadratic Assignment Problem (QAP) belongs to a class of well-known combinatorial optimization problems. Working with several real-world applications we have found that the QAP parameters can also be considered stochastic ones. Thus, we review a Stochastic Quadratic Assignment Problem (StoQAP) as a stochastic program and discuss its suitable deterministic reformulations. The focus is on VO and MM reformulations and results of test computations for the selected instances of StoQAP by metaheuristic are presented.

BibTex


@inproceedings{BUT140671,
  author="Pavel {Popela} and Radomil {Matoušek} and Jakub {Kůdela}",
  title="Heuristic approaches to stochastic quadratic assignment problem: VO and MM cases",
  annote="The aim of the paper is to build on the previous article, which dealt with heuristic approaches to solving of the so-called EV and EO deterministic reformulations of a stochastic quadratic assignment problem (StoQAP) and focus on the following VO and MM deterministic reformulations. It is known that the deterministic Quadratic Assignment Problem (QAP) belongs to a class of well-known combinatorial optimization problems. Working with several real-world applications we have found that the QAP parameters can also be considered stochastic ones. Thus, we review a Stochastic Quadratic Assignment Problem (StoQAP) as a stochastic program and discuss its suitable deterministic reformulations. The focus is on VO and MM reformulations and results of test computations for the selected instances of StoQAP by metaheuristic are presented.

",
  address="Brno University of Technology",
  booktitle="Proceedings of 22nd International Conference on Soft Computing MENDEL 2016",
  chapter="140671",
  howpublished="print",
  institution="Brno University of Technology",
  year="2016",
  month="june",
  pages="117--122",
  publisher="Brno University of Technology",
  type="conference paper"
}