Heuristic Approaches to Stochastic Quadratic Assignment Problem: VaR and CVar Cases
Loading...
Date
2017-06-01
ORCID
Advisor
Referee
Mark
Journal Title
Journal ISSN
Volume Title
Publisher
Institute of Automation and Computer Science, Brno University of Technology
Altmetrics
Abstract
The goal of this paper is to continue our investigation of the heuristic approaches of solving thestochastic quadratic assignment problem (StoQAP) and provide additional insight into the behavior of di erentformulations that arise through the stochastic nature of the problem. The deterministic Quadratic AssignmentProblem (QAP) belongs to a class of well-known hard combinatorial optimization problems. Working with severalreal-world applications we have found that their QAP parameters can (and should) be considered as stochasticones. Thus, we review the StoQAP as a stochastic program and discuss its suitable deterministic reformulations.The two formulations we are going to investigate include two of the most used risk measures - Value at Risk(VaR) and Conditional Value at Risk (CVaR). The focus is on VaR and CVaR formulations and results of testcomputations for various instances of StoQAP solved by a genetic algorithm, which are presented and discussed.
Description
Citation
Mendel. 2017 vol. 23, č. 1, s. 73-78. ISSN 1803-3814
https://mendel-journal.org/index.php/mendel/article/view/55
https://mendel-journal.org/index.php/mendel/article/view/55
Document type
Peer-reviewed
Document version
Published version
Date of access to the full text
Language of document
en