Self-organizing Migrating Algorithm for the Single Row Facility Layout Problem

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F20%3A10246919" target="_blank" >RIV/61989100:27240/20:10246919 - isvavai.cz</a>

Výsledek na webu

<a href="https://ieeexplore.ieee.org/document/9185657" target="_blank" >https://ieeexplore.ieee.org/document/9185657</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/CEC48606.2020.9185657" target="_blank" >10.1109/CEC48606.2020.9185657</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Self-organizing Migrating Algorithm for the Single Row Facility Layout Problem

Popis výsledku v původním jazyce

Single row facility layout problem is an important problem encountered in facility design, factory construction, production optimization, and other areas. At the same time, it is a challenging NP-hard combinatorial optimization problem that has been addressed by many advanced algorithms. In practical scenarios, real-world problems can be cast as single row facility location problem instances with different high-level properties and efficient algorithms that can solve them are sought. This work uses a variant of the self-organizing migration algorithm developed recently for permutation problems to tackle the single row facility layout problem and evaluates its accuracy and performance. (C) 2020 IEEE.

Název v anglickém jazyce

Self-organizing Migrating Algorithm for the Single Row Facility Layout Problem

Popis výsledku anglicky

Single row facility layout problem is an important problem encountered in facility design, factory construction, production optimization, and other areas. At the same time, it is a challenging NP-hard combinatorial optimization problem that has been addressed by many advanced algorithms. In practical scenarios, real-world problems can be cast as single row facility location problem instances with different high-level properties and efficient algorithms that can solve them are sought. This work uses a variant of the self-organizing migration algorithm developed recently for permutation problems to tackle the single row facility layout problem and evaluates its accuracy and performance. (C) 2020 IEEE.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/LTAIN19176" target="_blank" >LTAIN19176: Metaheuristický rámec pro vícecílové kombinatorické optimalizační problémy (META MO-COP)</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í

2020

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

2020 IEEE Congress on Evolutionary Computation, CEC 2020 - Conference Proceedings

ISBN

978-1-72816-929-3

ISSN

—

e-ISSN

—

Počet stran výsledku

8

Strana od-do

—

Název nakladatele

IEEE

Místo vydání

Piscataway

Místo konání akce

Glasgow

Datum konání akce

19. 7. 2020

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

WRD - Celosvětová akce

Kód UT WoS článku

—