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

Kód výsledku v IS VaVaI

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

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

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

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10103 - Statistics and probability

Projekt

<a href="/cs/project/LO1202" target="_blank" >LO1202: NETME CENTRE PLUS</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

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 statě ve sborníku

Proceedings of 22nd International Conference on Soft Computing MENDEL 2016

ISBN

978-80-214-5365-4

ISSN

1803-3814

e-ISSN

—

Počet stran výsledku

6

Strana od-do

117-122

Název nakladatele

Brno University of Technology

Místo vydání

Brno, Czech Republic

Místo konání akce

Brno

Datum konání akce

8. 6. 2016

Typ akce podle státní příslušnosti

EUR - Evropská akce

Kód UT WoS článku

—