A reformulated nonlinear model to solve the facility layout problem

Vázquez-Román, Richart; Díaz‐Ovalle, Christian O.; Jung, Seungho; Castillo-Borja, Florianne

doi:10.1080/00986445.2018.1499095

Cited by 8 publications

(3 citation statements)

References 54 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The multi-row FLP (MRFLP) also tries to arrange departments on the plant floor so that the material handling cost is minimized (Neghabi et al, 2014). Precise methods using mathematical methods seek the best solution and generally employ a mathematical programming formulation (Vázquez-Román et al, 2019). Unlike heuristics, metaheuristics are a general form of the search process in the solution space regardless of the considered problem, without guaranteeing finding the optimal solution.…”

Section: According To Mckendallmentioning

confidence: 99%

A novel memory-based simulated annealing algorithm to solve multi-line facility layout problem

Zolfi¹,

Jouzdani²,

Shirouyehzad³

2023

10.5267/j.dsl

View full text Add to dashboard Cite

In this paper, a memory-based simulated annealing algorithm called the Dual Memory Simulated Annealing Algorithm (DMSA) is presented to solve multi-line facility layout problems. The objective is to minimize the total material handling cost. Two memory buffers and a restart mechanism are considered. Two benchmark problems were selected from the literature review papers and solved using the standard simulated annealing (SA) algorithm and the DMSA. The obtained results show that solutions provided by the DMSA algorithm are cost-effective compared to the standard SA algorithm and the other algorithms used for solving these test cases. Moreover, to further evaluate the performance of the DMSA algorithm in large scale problems, eleven test cases were selected from the benchmark library of the quadratic assignment problem (QAP). According to the results, the performance of the algorithm in finding solutions to complex problems is exemplary.

show abstract

Section: According To Mckendallmentioning

confidence: 99%

A novel memory-based simulated annealing algorithm to solve multi-line facility layout problem

Zolfi¹,

Jouzdani²,

Shirouyehzad³

2023

10.5267/j.dsl

View full text Add to dashboard Cite

show abstract

“…The model solved sequentially may lead to suboptimal solutions, so Leno et al [20] proposed a hybrid algorithm to optimize the internal and external layout at the same time. Various algorithms were adopted, such as GA [21,22] and the simulated annealing algorithm [23,24], and both of these have obtained reasonable results. To improve the performance of each algorithm, many kinds of hybrid algorithms [25,26] were often applied as well.…”

Section: Introductionmentioning

confidence: 99%

Coupling Layout Optimization of Key Plant and Industrial Area

Zhao

et al. 2020

Processes

View full text Add to dashboard Cite

Layout problems are an engineering task that heavily relies on project experience. During the design of a plant, various factors need to be considered. Most previous efforts on industrial layout design have focused on the arrangement of facilities in a plant. However, the area-wide layout was not thoroughly studied and the relationship between plant layout and area-wide layout was rarely mentioned. In this work, the key plant that has the greatest impact on the industrial area is figured out first, and then the coupling relationships between the key plant and the industrial area are studied by changing the occupied area and length-width ratio of the key plant. Both of them are achieved by changing the floor number. A hybrid algorithm involving the genetic algorithm (GA) and surplus rectangle fill algorithm (SRFA) is applied. Various constraints are considered to make the layout more reasonable and practical. In the case study, a refinery with 20 plants is studied and the catalytic cracking plant is found to be the key plant. After the retrofit, the total cost of the refinery is 1,806,100 CNY/a less than that before, which illustrates the effectiveness of the method.

show abstract

“…En los últimos diez años la distribución en planta ha sido modelada matemáticamente como un problema de asignación cuadrática (QAP) Zhang et al, 2019), a través de programación lineal (LP) (Gai & Ji, 2019;Xiao et al, 2016), programación lineal entera (ILP) (al Hawarneh et al, 2019;Horta et al, 2016), programación lineal entera mixta (MILP) (Brunoro Ahumada et al, 2018;Ejeh et al, 2018;, programación no lineal entera (NLIP) (Abdollahi et al, 2019;Anjos & Vieira, 2016;Neghabi et al, 2014), programación no lineal entera mixta (MINLP) (de Lira-Flores et al, 2019;Gulsen et al, 2019;Vázquez-Román et al, 2019), programación semidefinida (SDP) (Hungerländer, 2014;Hungerländer & Anjos, 2015;Hungerländer & Rendl, 2013) y mediante teoría de grafos (Zheng, 2014). Tales modelos, de forma general, han estado sujetos a 36 tipos de restricciones diferentes.…”

Section: Agradecimientosunclassified

Enfoque multiobjetivo bottom-up para la planificación dinámica de la distribución espacial en plantas industriales

Pérez-Gosende¹

View full text Add to dashboard Cite

proyectos: "Industrial data services for quality control in smart manufacturing (i4Q)" financiado por el programa Horizon 2020 bajo el acuerdo de subvención No. 958205; y los proyectos "Optimización de tecnologías de producción cero-defectos habilitadoras para cadenas de suministro 4.0 (CADS4.0)" financiado por el Ministerio de Ciencia, Innovación y Universidades de España, bajo el acuerdo de subvención RTI2018-101344-B-I00 e "Industrial production and logistics optimization in industry 4.0 (i4OPT)" financiado por la Generalitat Valenciana en el marco del proyecto de grupos de investigación de excelencia PROMETEO/2021/065. RESUMLa planificació de la distribució espacial en plantes industrials (FLP) és una de les decisions més importants en el context de la direcció d'operacions, i un dels problemes de major discussió en la literatura científica emmarcada en el camp ampli de l'enginyeria industrial. No obstant això, l'ús generalitzat de l'enfocament de solució top-down tradicional, que s'inicia amb el disseny de la distribució del conjunt dels departaments o cel•les de treball que conformen el sistema de producció i prossegueix amb la distribució detallada a l'interior d'aquests, part d'assumpcions poc compatibles amb la realitat operacional industrial que impliquen unes certes limitacions per a la seua adopció en la pràctica. Això, unit al fet que els models matemàtics emprats en la generació d'alternatives de layout utilitzen en la seua majoria el cost de maneig de materials com una funció monoobjetivo de caràcter quantitatiu, desvirtuant la naturalesa multiobjectiva del problema, accentua un buit que genera oportunitats de millora en la presa de decisions de planificació del layout en la pràctica industrial. En aquest context, aquesta tesi doctoral, recolzada per un estudi minuciós de l'estat de l'art i l'anàlisi de models d'optimització matemàtica de referència, presenta un marc conceptual per a la presa de decisions de planificació del FLP des d'una perspectiva multiobjectiu, i un nou model d'optimització multiobjectiu no lineal enter mixt (MOMINLP) per a facilitar la presa de decisions de distribució espacial en plantes industrials metallmecàniques en entorns de demanda dinàmics mitjançant un enfocament de planificació bottom-up, tenint en compte criteris quantitatius i qualitatius. El model proposat, denominat bottom-up mDFLP, considera tres funcions objectiu que pretenen: (1) minimitzar el cost total de maneig de materials i el cost total de reorganització, (2) maximitzar el rating de proximitat subjectiva entre departaments, i (3) maximitzar el ràtio d'utilització d'àrea. El model bottom-up mDFLP ha sigut validat en una empresa del sector metallmecànic, confirmant un millor acompliment en els valors de les funcions objectiu respecte als obtinguts en la distribució en planta actual.

show abstract

A reformulated nonlinear model to solve the facility layout problem

Cited by 8 publications

References 54 publications

A novel memory-based simulated annealing algorithm to solve multi-line facility layout problem

A novel memory-based simulated annealing algorithm to solve multi-line facility layout problem

Coupling Layout Optimization of Key Plant and Industrial Area

Enfoque multiobjetivo bottom-up para la planificación dinámica de la distribución espacial en plantas industriales

Contact Info

Product

Resources

About