A novel version of simulated annealing based on linguistic patterns for solving facility layout problems

Abstract

The paper presents a novel version of the simulated annealing algorithm based on linguistic patterns (LP) and fuzzy theory approach. The article describes shortly the linguistic patterns and shows on a simple illustrative example the idea of using the Łukasiewicz formula as a criterion for the facility layout optimization. Next, the detailed description of our LP version of simulated annealing is presented. The influence of the proposed algorithm parameters on the effectiveness of our approach is then examined in a simulation experiment involving four different types of facility layout problems. The outcomes from the first experiments are used for optimally setting the parameters of our proposal in the second simulation study focused on verifying its effectiveness for objects with uniform and variable sizes. The obtained results show that the presented procedure, apart from producing decent results in terms of the classic goal function and the linguistic pattern criterion, provided solutions that were qualitatively different than those generated by a crisp version.

Utilizing IoT to design a relief supply chain network for the SARS-COV-2 pandemic

“…Three different neighborhood approaches are employed in this study, which include Swap, Reversion, and Insertion. For further explanation we refer the readers to see ( [90] ). The pseudocode of the proposed SA algorithm is shown in Fig.…”

Overview of Dynamic Facility Layout Planning as a Sustainability Strategy

“…The DFLP has been classified as an NP-hard optimization problem (non-deterministic polynomial time-hard problem) because there is no exact technique that optimally solves the problem in a reasonable polynomial time Heuristics for the dynamic facility layout problem with unequal-area departments [37,52,81]. However, despite this degree of complexity, different authors have provided acceptable solutions in realistic calculation times, applying everything from exact techniques to state-of-the-art heuristic algorithms.…”

Planificación de la distribución en planta en entornos dinámicos: un estudio de revisión

“…El problema de la DFLP ha sido clasificado como un problema de optimización NP-hard (non-polynomial hard problem) de acuerdo con la teoría de la complejidad computacional, pues no existe un algoritmo que proporcione una solución óptima en un tiempo polinómico razonable [56]. Sin embargo, a pesar de este grado de complejidad, distintos autores han aportado soluciones aceptables en tiempos de cálculo realistas, aplicando desde técnicas exactas hasta algoritmos heurísticos de última generación.…”