Facility Layout Problem with Alternative Facility Variants

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21450%2F23%3A00373680" target="_blank" >RIV/68407700:21450/23:00373680 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/68407700:21730/23:00373680

Výsledek na webu

<a href="https://doi.org/10.3390/app13085032" target="_blank" >https://doi.org/10.3390/app13085032</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.3390/app13085032" target="_blank" >10.3390/app13085032</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Facility Layout Problem with Alternative Facility Variants

Popis výsledku v původním jazyce

The facility layout problem is one of the fundamental production system management problems. It has a significant impact on overall system efficiency. This paper introduces a new facility layout problem that allows for choosing from multiple variants of each facility. The need for choosing the most suitable selection from the facility variants while at the same time optimizing other layout quality indicators represents a new optimization challenge. We build on our previous work where single- and multi-objective evolutionary algorithms using indirect representation were proposed to solve the facility layout problem. Here, the evolutionary algorithms are adapted for the problem of facility variants, including the new solution representation and variation operators. Additionally, a cooling schedule, whose role is to control the exploration/exploitation ratio during the course of the optimization process, is proposed. It was inspired by the cooling schedule used in the simulated annealing technique. The extended evolutionary algorithms have been experimentally evaluated on two data sets, with and without the alternative variants of facilities. The obtained results demonstrate the capability of the extended evolutionary algorithms to solve the newly formulated facility layout problem efficiently. It also shows that the cooling schedule improves the convergence of the algorithms.

Název v anglickém jazyce

Facility Layout Problem with Alternative Facility Variants

Popis výsledku anglicky

The facility layout problem is one of the fundamental production system management problems. It has a significant impact on overall system efficiency. This paper introduces a new facility layout problem that allows for choosing from multiple variants of each facility. The need for choosing the most suitable selection from the facility variants while at the same time optimizing other layout quality indicators represents a new optimization challenge. We build on our previous work where single- and multi-objective evolutionary algorithms using indirect representation were proposed to solve the facility layout problem. Here, the evolutionary algorithms are adapted for the problem of facility variants, including the new solution representation and variation operators. Additionally, a cooling schedule, whose role is to control the exploration/exploitation ratio during the course of the optimization process, is proposed. It was inspired by the cooling schedule used in the simulated annealing technique. The extended evolutionary algorithms have been experimentally evaluated on two data sets, with and without the alternative variants of facilities. The obtained results demonstrate the capability of the extended evolutionary algorithms to solve the newly formulated facility layout problem efficiently. It also shows that the cooling schedule improves the convergence of the algorithms.

Druh

J_imp - Článek v periodiku v databázi Web of Science

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/EF16_026%2F0008432" target="_blank" >EF16_026/0008432: Klastr 4.0 - Metodologie systémové integrace</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2023

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 periodika

Applied Sciences

ISSN

2076-3417

e-ISSN

2076-3417

Svazek periodika

13

Číslo periodika v rámci svazku

8

Stát vydavatele periodika

CH - Švýcarská konfederace

Počet stran výsledku

17

Strana od-do

1-17

Kód UT WoS článku

000979222400001

EID výsledku v databázi Scopus

2-s2.0-85156148012