Facility Layout Problem with Alternative Facility Variants

Result code in 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>

Alternative codes found

RIV/68407700:21730/23:00373680

Result on the web

<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>

Result language

angličtina

Original language name

Facility Layout Problem with Alternative Facility Variants

Original language description

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.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

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

Project

<a href="/en/project/EF16_026%2F0008432" target="_blank" >EF16_026/0008432: Cluster 4.0 - Methodology of System Integration</a><br>

Continuities

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

Publication year

2023

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Applied Sciences

ISSN

2076-3417

e-ISSN

2076-3417

Volume of the periodical

13

Issue of the periodical within the volume

8

Country of publishing house

CH - SWITZERLAND

Number of pages

17

Pages from-to

1-17

UT code for WoS article

000979222400001

EID of the result in the Scopus database

2-s2.0-85156148012