Next Article in Journal
A Reconfigurable Framework for Hybrid Quantum–Classical Computing
Previous Article in Journal
Assessing Environmental Influences on Flash Storage for Vehicle Computing: A Quantitative and Analytical Investigation
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Evolutionary Algorithm for Efficient Flexible Workstation Layout in Multi-Product Handcrafted Manufacturing

by
Eduardo Fernández-Echeverría
1,
Gregorio Fernández-Lambert
2,*,
Luis Enrique García-Santamaría
2,*,
Loecelia Ruvalcaba-Sánchez
3,
Roberto Angel Melendez-Armenta
4,
Juan Manuel Carrión-Delgado
5 and
José Aparicio-Urbano
6
1
ITS de Zacapoaxtla, Tecnológico Nacional de México, Zacapoaxtla 73680, Puebla, Mexico
2
Laboratorio de Logística y Sustentabilidad en Economías Emergentes, Tecnológico Nacional de México/ITS de Misantla, Km 1.8 Carretera a Loma del Cojolite s/n, Misantla 93850, Veracruz, Mexico
3
Centro de Investigación en Ciencias de Información Geoespacial, Contoy 137, Col. Lomas de Padierna, Alcaldía Tlalpan, Mexico City 14240, Mexico
4
Affective Computing and Educational Innovation Laboratory, Division of Graduate Studies and Research, Tecnológico Nacional de México-Instituto Tecnológico Superior de Misantla, Km 1.8 Carretera a Loma del Cojolite, Misantla 93850, Veracruz, Mexico
5
ITS de Xalapa, Tecnológico Nacional de México, Sección 5A Reserva Territorial S/N, Santa Barbara 91096, Veracruz, Mexico
6
División de Ingeniería Industrial, Tecnológico Nacional de México/Tecnológico de Estudios Superiores de Jocotitlán, Carretera Toluca-Atlacomulco KM 44.8 Ejido de San Juan y, San Agustin, Jocotitlan 50700, Estado de Mexico, Mexico
*
Authors to whom correspondence should be addressed.
Algorithms 2025, 18(5), 270; https://doi.org/10.3390/a18050270
Submission received: 15 March 2025 / Revised: 10 April 2025 / Accepted: 3 May 2025 / Published: 5 May 2025
(This article belongs to the Section Algorithms for Multidisciplinary Applications)

Abstract

:
This study proposes an Evolutionary Algorithm (EA) to optimize the workstation layout in multi-product handcrafted furniture workshops with simultaneous manufacturing. The algorithm models the arrangement of workstations within a limited space, enhancing activity coordination and reducing unnecessary worker movement. The optimized solution is obtained through the application of evolutionary operators, including selection, crossover, mutation, and refinement, iterating over successive generations. To evaluate the EA’s performance, a computational simulation is conducted using ProModel®, comparing its efficiency against conventional methodologies such as Systematic Layout Planning (SLP) and the CRAFT algorithm. In a case study involving the simultaneous elaboration of three different products, each by a different artisan, the EA successfully reduces the total worker travel distance by 51.45% and the system’s total processing time by 13.2%. The results indicate that the proposed approach not only enhances operational efficiency in a smaller environment but also lays the groundwork for integrating advanced strategies. These include cellular manufacturing and hybrid production schemes, ultimately enhancing flexibility and sustainability in this sector.

1. Introduction

Operation synchronization in production systems enhances workflow sequencing, reduces wait times, and minimizes resource waste [1,2]. In large manufacturing enterprises, these objectives are achieved through automation, artificial intelligence, information and communication technologies, and computational planning tools [3,4]. These organizations employ Enterprise Resource Planning (ERP) systems, Manufacturing Execution Systems (MESs), or real-time process simulation to coordinate tasks, adjust production schedules, and optimize machinery and personnel usage [5,6].
In contrast, microenterprises—particularly family-run artisanal units that manufacture multiple products simultaneously—often operate within linear production systems with multi-tasking workstations in confined spaces [7]. The limited adoption of technology in these environments hinders efficient activity coordination, leading to idle time, unnecessary worker movement, and suboptimal resource utilization [8,9]. This combination of factors underscores the need for strategies to optimize task distribution and improve workflow efficiency in these smaller manufacturing systems.
Artisanal workshops organized into linear operations produce in small batches with high variability in design and materials, requiring periodic adjustments to workstations, tools, and resources [10,11]. Multi-product workstations predominantly rely on manual operations with simple tools, where the artisan’s experience and empirical adaptation determine the workflow [12].
While this flexibility is valuable, it often lacks structured planning, as the arrangement of tools and materials is primarily based on immediate worker accessibility rather than workflow efficiency. As a result, inefficiencies such as unnecessary walking and downtime arise, impacting overall manufacturing system performance [13,14].
Beyond technological limitations, these multi-product artisanal enterprises manufacture goods on demand without adhering to standardized production processes [15]. This necessitates constant adjustments in tool placement and operation sequencing [16], increasing worker movement, wait times, and production delays. This ultimately leads to frequent improvisations at every stage.
Scheduling in the artisanal industry largely depends on worker experience. This lack of operation synchronization compromises operational efficiency, and dynamic space utilization [17,18]. These inefficiencies not only delay production but also lead to late deliveries and frequent missed deadlines. This directly affects the competitiveness of the artisanal sector in global markets [19].
To address these challenges, the literature reports various computational and heuristic approaches to improve space allocation and activity coordination across workstations. Mathematical facility layout models have been employed to reduce unnecessary worker movement [20], while discrete event simulation enables the assessment of different configurations before implementation [21,22]. Additionally, Evolutionary Algorithms have proven particularly suitable for optimizing resource allocation in constraint-laden processes [23,24]. These approaches have been successfully applied in the automotive, consumer goods, and agribusiness industries, readily demonstrating that operation synchronization reduces costs and production times [25,26,27,28]. However, their implementation in artisanal workshops remains limited, highlighting a gap in the application of these techniques within this sector.
While large industries have integrated advanced planning and automation systems, artisanal workshops not only resist adopting new technologies [29] but also lack solutions tailored to their high variability. This makes it difficult to implement advanced production system optimization methodologies [30,31]. Some studies have explored hybrid methodologies to optimize facility layout, such as the work of Anacona-Mopan et al. [32], who integrated discrete event simulation with the Computerized Relative Allocation of Facilities Technique (CRAFT), achieving a 13.22% reduction in material flow costs and a 4.28% decrease in workflow time. However, these approaches represent an intermediate stage between traditional heuristics and advanced combinatorial models, underscoring the need for more adaptable methodologies for the artisanal sector.
Pérez-Gosende et al. [21] identified that initial solutions obtained through Systematic Layout Planning (SLP) can be improved with advanced tools such as Genetic Algorithms (GAs), Particle Swarm Optimization (PSO), and Variable Neighborhood Search (VNS). Additionally, simulation-based techniques such as Data Envelopment Analysis (DEA), and Multi-Criteria Decision Making (MCDM) complete the roster. Although these approaches have proven effective in industries with established infrastructure, their application in artisanal workshops remains a challenge due to spatial distribution variability and the absence of automated processes. In this context, Evolutionary Algorithms (EAs) have emerged as a more flexible alternative for layout optimization in highly dynamic environments such as the artisanal manufacturing system studied in this work. However, while the literature highlights the feasibility of applying computational optimization techniques in production systems with spatial and technological constraints, this remains an underexplored aspect for these microenterprises.
This study poses the following research question: Can an Evolutionary Algorithm (EA) effectively optimize the workstation layout and worker movements in artisanal workshops?
Despite advances in facility layout optimization using heuristic and metaheuristic approaches, important gaps remain in the literature. First, most studies focus on industrial settings with fixed workflows and automated operations, overlooking the complexity of artisanal systems with multiproduct environments and little to no automation. Secondly, although methodologies such as SLP, CRAFT, and hybrid models have shown efficiency in structured environments, their application in dynamic artisanal workstation configurations is limited. Thirdly, there is little empirical validation of Evolutionary Algorithms in real-world artisanal workshops, particularly in Latin American contexts characterized by spatial, technological, and organizational constraints. Finally, the literature lacks methodological frameworks adapted to simultaneous product manufacturing, where coordination between workers and stations must occur without advanced technologies. This study addresses these gaps by proposing and validating an Evolutionary Algorithm designed for flexible-tasking, low-automation, multiproduct artisanal workshops.
This study evaluates the efficiency of an EA in optimizing facility layout for human–machine operations in a multi-product artisanal manufacturing system with flexible workstations. Through simulations based on a real-world case study, the EA’s impact on reducing idle time and unnecessary worker movement between stations is analyzed, comparing its performance against conventional facility layout optimization methodologies. In this regard, this work contributes to the application of EAs within the artisanal sector, providing a robust methodological framework to enhance operational efficiency in these simple, high-variability environments.
In this context, the present study contributes to the body of knowledge through three main aspects: (1) the application of an EA to optimize the workstation layout in an artisanal workshop with simultaneous multiproduct elaboration (an environment that remains underexplored in the literature); (2) the computational validation of the model through simulations in ProModel®, comparing its performance with conventional methods such as SLP and CRAFT; and (3) the generation of empirical evidence demonstrating significant reductions in operator travel distances and total system time. This last point contributes to improved operational synchronization and spatial efficiency in old-style, multi-tasking environments. These contributions provide a foundation for future research for the integration of advanced optimization techniques in this area.

2. Materials and Methods

This study adopts a quantitative, experimental, and computational approach to optimize workstation layout in an artisanal workshop, with multi-product elaboration and flexible workstations. An EA is implemented to minimize worker travel distances and reduce downtimes, aiming to synchronize operations.
This study compares the performance of the EA against traditional methods, including SLP and the CRAFT algorithm. The evaluation is conducted through computational simulation using ProModel® Version 7 [33], allowing for an assessment of the EA’s effectiveness in terms of reducing walking distances and production times.

2.1. Description of the Production System

This study was conducted in an artisanal wooden furniture workshop, where production is based on small batches with high product variability. The work area, which has a rectangular layout, covers a total surface of 166.50 m2 and consists of an initial workstation arrangement that includes nine workstations (WS), a material storage area (MSA), a finished product storage area (FPW), and three worktables (WT) (Figure 1).
Due to the simultaneous use of flexible workstations, workers frequently move between stations as needed during the furniture-manufacturing process. The initial workstation layout in this artisanal sector is primarily based on the workshop owner’s preference rather than on the actual demand for each operation. This arrangement, originally designed for single-product manufacturing, becomes inefficient when multiple furniture pieces are produced simultaneously. As a result, idle times increase, and workflow disorganization occurs, as a single furniture piece may require attention at certain stations multiple times or in a different sequence depending on its manufacturing process.

2.2. Mathematical Formulation of the Problem

The facility layout issue with equal spaces is formulated as a discrete assignment problem, where WS must be optimally positioned to minimize the total distance traveled by workers within the production area. The workspace is structured as a rectangular grid of 4 × 8 equally sized cells, forming the layout matrix. The following notation is used throughout the model:
  • i ∈ I = {1,2,3,4}: row index of the layout matrix.
  • j ∈ J = {1,2,…,8}: column index of the layout matrix.
  • kK = {1,2,…,16}: index of workstations (WS).
  • lL = {1,2,3}: index of workers.
  • N = |K|: 16: total number of assignable positions in the matrix.
  • d(i,j),(i’,j’): Euclidean distance between two cells: (i,j) and (i’,j’).
  • rl: route assigned to worker l, as a sequence of WS positions.
  • sl: ordered set of cells visited by worker l based on task sequence.
  • dl: total travel distance incurred by worker l.
  • xijk ∈ {0,1}: binary decision variable: 1 if workstation k is placed at cell (i,j), 0 otherwise.
The objective function that minimizes the total distance of all workers is as follows:
M i n   Z = l L d l
Constraints.
The total travel distance for each worker l is computed as the sum of Euclidian distances between consecutive cells in the route sl, given the layout defined by the decision variables:
( i , j ) , ( i , j )   s l d ( i , j ) , ( i , j )   x i j r l x i j r l + 1 = d l       l L
Each workstation must be assigned to exactly one location:
i I j J x i j k 1 k K
Each cell can host at most one workstation:
k K X i j k 1       i I ,   j J
The total number of assigned cells equals the number of workstations:
i I j J k K x i j k k = N
Fixed pre-assignments. Some workstations are pre-assigned to specific locations due to physical or infrastructure constraints:
x 11 1 = 1
x 21 1 = 1
x 31 2 = 1
x 27 3 = 1
x 28 3 = 1
x 41 16 = 1
x i j k = { 0 , 1 } ; i I ,   j J , k K
The proposed model seeks to optimize the facility layout by minimizing the total travel distance of all workers, as defined in objective function (1). This objective is needed for improving process efficiency and reducing idle time within the production system. Constraint (2) ensures that each worker’s assigned route aligns with the spatial distribution of workstations, enabling accurate distance calculations based on Euclidean metrics between consecutive cells. Constraint (3) ensures that each workstation is assigned to exactly one location, while constraint (4) prevents multiple workstations from being placed in the same cell, preserving the validity of the layout. Constraint (5) ensures that the number of assigned workstations equals the number of assignable positions, guaranteeing full use of available space. Constraints (6) to (11) define fixed assignments for specific workstations due to infrastructure limitations or operational requirements, such as storage zones or immovable equipment. Lastly, constraint (12) enforces the binary nature of the decision variables, ensuring each assignment is discrete and clearly defined, which is essential for the structure of the facility layout optimization.

2.3. Proposed Evolutionary Algorithm

Evolutionary Algorithms have been widely applied in industrial engineering for resource allocation and facility layout efficiency problems. In this study, an EA is implemented to optimize the placement of workstations in wooden furniture workshop. The EA follows three main stages: (1) generation of the initial population, where 10,000 individuals are created, each representing a unique workstation layout configuration; (2) crossover, where high-performing individuals are selected, and their characteristics are combined to generate new solutions; and (3) mutation, where random changes are introduced to prevent premature convergence to suboptimal solutions.
The iterative process terminates when either the maximum number of generations is reached or no significant improvement in worker travel distance is observed over a predetermined number of consecutive iterations. In this regard, the pseudocode in Appendix A.1 outlines a simplified Evolutionary Algorithm, where an initial population of individuals is generated and evaluated using an objective function. Over multiple generations, the population evolves through two key processes: survival and reproduction.
In the survival process, a subset of individuals is randomly selected for the next generation, where they may mutate with a given probability before being inserted into the new population. Meanwhile, in the reproduction process, two individuals are selected via a tournament mechanism, undergo crossover with a defined probability to generate offspring, and subsequently, these offspring may mutate before being evaluated and integrated into the next generation. Thus, this iterative process enables the population to evolve progressively, adapting to the optimization problem and improving performance with each generation.
Although the structure of the proposed EA relies on classical operators—selection, crossover, mutation, and survival—its novelty lies in its adaptation to the context of multiproduct artisanal manufacturing. The EA encodes solutions as 4 × 8 cell matrices that represent the actual workspace, including fixed areas such as storage zones and service areas. The crossover and mutation processes include validation routines to ensure that the solutions remain feasible. Additionally, a decreasing mutation rate—from 80% to 5%—was used to maintain diversity at the beginning and promote convergence in later stages. This configuration was fine-tuned through sensitivity analysis. The EA is integrated with the ProModel® simulation environment, allowing for performance evaluation that considers operation synchronization and the actual movements of operators. These features make the algorithm suitable for high-variability, non-automated production settings.

2.4. Case Study

2.4.1. Input Parameters (Constraints)

The search area for the EA corresponds to a rectangular surface divided into 4 rows and 8 columns, resulting in 32 equal-sized location cells. Within this matrix, certain cells are preassigned to fixed areas, specifically: the Raw Material Warehouse (AMP), the Material Storage Area (AMT), the Temporary Warehouse for Finished Products (TWFP), and the Service Zone (S).
Moreover, workers manufacture different products and follow specific workstation sequences. The total travel distance evaluation is based on the Euclidean distance between cells, and all workers begin production simultaneously.

2.4.2. Individual Encoding

Each solution within the EA is represented as a 4 × 8 matrix, where each cell has a unique assignment to facilitate its evaluation. Additionally, some cells are preassigned to fixed areas, ensuring that realistic constraints are maintained within the model.
In this context, Figure 1 illustrates the initial facility layout, including preassigned fixed areas corresponding to the Raw Material Warehouse (RMW:1), the Material Storage Area (MSA:2), the Finished Product Warehouse (FPW:3), and the Service Area (SAR:16). The figure also establishes the relationship between facility elements and their respective alphanumeric codes.

2.4.3. Initial Population Generation

The number of generations and initial population size were determined based on previous studies in heuristic optimization [23,24]. Specifically, a population size of 5000 individuals and a maximum of 1000 iterations were established to ensure a balance between searched space exploration and convergence toward an optimal solution. To prevent premature convergence and enhance solution diversity, the mutation rate was gradually reduced from 80% to 5% throughout the evolutionary process. These values were experimentally adjusted and later validated through sensitivity analysis in the simulation. The procedure for generating a new individual is detailed in Appendix A.2.
The relationship between facility elements and their respective codes, along with the initial workstation layout, where empty cells are represented as “0,” is shown in Figure 1. Additionally, the figure depicts the sequence of worker movements in each system iteration. The workers follow predefined trajectories, as seen with Worker 1, who starts at WT 4 (R1 →), moves to the RMW, and returns to the starting point (R2 ←), repeating this cycle (Figure 2a). Likewise, Workers 2 and 3 follow specific paths between workstations and storage areas (Figure 2b,c). This analysis helps identify configurations that reduce travel distances, improve space utilization, and enhance production flow efficiency.

2.4.4. Crossover

For the crossover process, two parent solutions are selected through a random tournament, ensuring that they are distinct from each other. A single random crossover point is defined within the encoding of each parent, and the new individual is generated by taking the first segment from Parent 1 and the remaining segment from Parent 2. Afterward, the offspring undergoes a verification and reconstruction process to ensure its feasibility within the system.

2.4.5. Mutation

The mutation process involves randomly selecting two non-fixed workstation elements within the facility layout and swapping their positions. The mutation rate decreases progressively across generations, starting from 80% and gradually reducing to 5%, preventing premature convergence while maintaining solution diversity. The mutation algorithm is detailed in Appendix A.3.

2.4.6. New Population

The new population consists of 40% of the top-performing individuals, selected through a random tournament method. In this approach, n = 20 individuals are randomly chosen, and the one with the shortest total travel distance is retained. The remaining 60% is generated through crossover, combining features of the selected individuals.
Afterward, the new population undergoes a mutation process, where some individuals are randomly modified to preserve solution diversity and prevent premature convergence.

2.5. Evolutionary Algorithm Configuration

The configuration of the EA was established through a two-step process: (1) initial parameter setting based on previous studies on heuristic optimization applied to facility layout problems [23,24], and (2) parameter adjustment through sensitivity analysis conducted in the ProModel® simulation environment.
A population of 5000 individuals was used, with a maximum of 1000 generations, a crossover rate of 60%, and a mutation rate decreasing from 80% to 5%. These values were selected to balance the exploration of the solution space with convergence speed. The proportion of survivors varied between 40% and 80%, depending on the scenario evaluated. Each configuration was independently executed 20 times to ensure consistent results and to estimate the algorithm’s average performance. These parameters ensure a balance between exploration and exploitation in the search process, allowing the EA to efficiently optimize workstation layout under the high variability and spatial constraints typical of artisanal manufacturing environments.
A canonical version of the EA was implemented in the C programming language, due to its computational efficiency and suitability for resource-constrained environments. Although more advanced variants of the algorithm exist—incorporating elitism, adaptive operators, or hybrid strategies—this study focused on a calibrated base model to improve performance without increasing complexity. This methodological decision provides a solid foundation for future applications in larger-scale systems.
During the calibration phase, the effects of population size and number of generations on convergence were analyzed. With 5000 individuals, sufficient genetic diversity was observed in the early generations, and the objective function value tended to stabilize around generation 750, with no evidence of premature convergence. The average execution time per run was 3.2 min on a computer equipped with an Intel i7 processor and 16 GB of RAM, which is considered reasonable for environments with limited computing resources.

2.6. Sensitivity Analysis of Algorithm Parameters

To evaluate the stability of the EA under different operating conditions, a sensitivity analysis was conducted on its initial parameters. This analysis made it possible to identify how configuration decisions influence the algorithm’s performance and to prevent issues resulting from improper calibration.
Four experimental configurations were defined by adjusting the number of generations, the percentage of survivors, and the mutation rate while keeping the population size constant at 5000 individuals. These parameters were selected due to their direct influence on the balance between exploration and exploitation of the solution space (Table 1).
These configurations were applied to the three defined production scenarios (2P × 2W, 3P × 3W, and 4P × 4W). The performance metric used was the average travel distance covered by operators. The objective was to identify which parameter combination yielded the most consistent and efficient results in layout optimization.

2.7. Scalability and Computational Complexity Considerations

The computational complexity of the EA is determined by the population size (P), the number of generations (G), and the dimensions of the layout matrix. Everyone represents a different configuration of workstations within a 4 × 8 matrix, and its evaluation is based on the cumulative calculation of Euclidean distances according to operator paths. The per-generation complexity is approximately O(P × E), where E represents the time required to evaluate an individual. The implementation in C programming language allowed for acceptable execution times, even under large configurations.
In exploratory tests using larger matrices (e.g., 6 × 10 or 8 × 12), execution time increased linearly with population size, while the search space expanded combinatorially. Although the model remains feasible for medium-sized problems, future scalability can be improved through adaptive control of population size, parallel evaluation of individuals, or the integration of hybrid local search strategies. These enhancements would enable the algorithm to be applied to more complex and less variable manufacturing environments while maintaining computational efficiency.

2.8. Validation of the Simulation Model in ProModel®

To ensure the accuracy of the simulation model in ProModel®, validation was conducted following the methodology proposed by Law [34]. The simulation results were compared with historical production data from the artisanal workshop, verifying consistency in cycle times, worker movements, and workstation utilization. Additionally, a sensitivity analysis was performed to evaluate the model’s stability under variations in production sequences and workstation arrangements, confirming its robustness in representing the actual system.

2.9. Statistical Validation

To validate the effectiveness of the EA in facility layout optimization, a one-way ANOVA was performed, comparing the SLP, CRAFT, and EA methods based on total travel distance. Each method was tested over 15 iterations, while data normality was verified using the Shapiro–Wilk test [35]. With a significance level of 0.01 the mean, standard deviation, F-statistic, and p-value were calculated [36]. Additionally, to ensure EA convergence without excessive computational costs, 1000 generations with 10,000 individuals were selected, following evolutionary optimization criteria for facility layout problems [37].

3. Results

The EA was evaluated in a simulation environment using ProModel® Version 7 to optimize workstation layout and minimize the distance travelled by operators in an artisanal production workshop. Its performance was compared against the SLP method and the CRAFT algorithm.

3.1. Reduction in Travel Distance

The results demonstrate that redistributing workstations using the EA significantly reduced operational movement (Table 2). In the initial layout, the total distance travelled by operators was 868.95 m. After optimization with the EA, this was reduced to 400.56 m, representing a 53.90% improvement. In comparison, the CRAFT algorithm achieved a 38.60% reduction, while SLP resulted in only a 27.70% improvement (Table 3).
A detailed analysis of individual operators revealed that Operator 2, who initially travelled 385.85 m, reduced their movement to 162.02 m with the EA (a 58.00% reduction), while Operator 3 decreased their travel distance from 359.22 m to 153.15 m (a 57.36% reduction). This confirms that the EA not only optimizes the overall workflow of the workshop but also enhances the individual efficiency of each operator.

3.2. Comparison with Traditional Methods

The comparative analysis confirms the superiority of the EA over conventional methods such as SLP and CRAFT, particularly in high-variability environments. While SLP and CRAFT are effective in facilities with fixed layouts, the EA enables dynamic adjustments, making it especially useful in artisanal manufacturing, where designs and materials frequently change.
The results presented in Table 3 show that the EA reduced the total travel distance by 447.08 m, equivalent to a 51.45% decrease compared to the initial layout, outperforming the reductions achieved by SLP (27.70%) and CRAFT (38.60%). Additionally, the reorganization of workstations reduced the occupied area by 22 m2, a critical advantage for workshops with spatial constraints. On an individual level, Worker 2, who initially recorded the longest travel distance, reduced their movement from 385.85 m to 175.13 m, demonstrating that the EA improves workstation arrangement and optimizes production sequencing, reducing travel times and maximizing space utilization.
Before conducting the ANOVA test, the assumptions of normality, homogeneity of variance, and data independence were verified. The Shapiro–Wilk test was applied to assess normality in the distribution of travel distances for each method, yielding p-values of 0.09 for EA, 0.12 for CRAFT, and 0.07 for SLP, indicating no sufficient evidence to reject normality. Levene’s test was used to evaluate variance equality across methods, with a p-value of 0.25, confirming homoscedasticity. The independence of observations was ensured through controlled iterations without interference between values.
The one-way ANOVA test resulted in an F-statistic of 8806.19 and a p-value < 0.01, indicating significant differences among the evaluated methods (Table 4). These results confirm the effectiveness of the EA in optimizing facility layouts.
In terms of computational efficiency, the EA exhibited a higher average execution time per run (192.0 s) compared to traditional methods such as CRAFT (25.2 s) and SLP (13.5 s). However, this longer processing time is compensated by the significant reductions in operator travel distance and overall system time. As shown in Table 3, while traditional methods provide faster execution, the EA’s superior optimization performance justifies the additional computational cost, especially in artisanal production environments with high variability and space constraints.
Figure 3 illustrates how workstation placement varies across the different optimization methods and its impact on the spatial distribution of the workshop. Notably, ET-4 (Worker 1’s station) and ET-14 (Shredder station) retain strategic positions across all methods, confirming their significance in overall productivity. This finding further validates the EA as an effective technique for improving workstation layout in artisanal manufacturing with limited resources.
Figure 4 demonstrates the reduction in total system time, highlighting the differences between the initial layout and the optimized configuration. These results confirm that the EA efficiently enhances operation synchronization, reduces idle time, and optimizes space utilization and resource management.

3.3. Reduction in Total System Time

In addition to reducing travel distances, the EA improved the system’s operational efficiency by decreasing the total manufacturing process time from 9284.09 min to 8538.33 min, representing a 13.2% improvement (Table 5).
Figure 5 compares the average time in the system for each product across two scenarios: the initial layout and the optimized layout using the EA. The results show a significant reduction, particularly for Product 2, where the processing time decreased from 4096.53 min to 3219.8 min. This reduction is attributed to better workstation synchronization and reduced interference among operators, minimizing blockages and waiting times.
These findings confirm that the EA is a viable solution for optimizing artisanal elaboration, enhancing workspace organization, and increasing productivity in multi-tasking environments.

3.4. Evaluation on Multiple Scenarios

To validate the proposed algorithm, simulations were conducted in three production scenarios, varying the number of products and operators. The configurations considered were as follows: (i) two products with two operators (2P × 2W), (ii) three products with three operators (3P × 3W—baseline case), and (iii) four products with four operators (4P × 4W). In all cases, the layout, task sequence, and variability remained unchanged to isolate the effect of workload on the performance of the compared methods.
The results, presented in Table 6, show that the EA achieved the best performance across all scenarios. In terms of total travel distance, the EA achieved reductions of 63.45% in 2P × 2W, 53.91% in 3P × 3W, and 57.18% in 4P × 4W, compared to the initial layout. In contrast, the traditional methods SLP and CRAFT obtained smaller reductions in all configurations.
These results indicate that the EA remains effective in both low- and high-workload conditions. Its consistent behavior supports its application in smaller manufacturing systems with variable workflows. Furthermore, as the number of products and operators increases, the EA maintains its performance, confirming its applicability to larger and more complex systems.

4. Discussion

Multi-product artisanal manufacturing faces operational challenges due to the flexible arrangement of workstations and production variability. Unlike industrial environments with fixed layouts and standardized workflows, these systems require optimization methodologies that not only minimize unnecessary movement but also synchronize human–machine operations to improve overall system efficiency. Traditional layout optimization approaches, such as SLP and the CRAFT algorithm, have proven effective in structured environments, but their applicability to non-technical businesses remains limited, particularly when dynamic workstation reconfiguration is required.
This study implemented an EA programmed in C++ to optimize workstation distribution and synchronize operations in a multi-product wooden furniture workshop, where three types of products are simultaneously manufactured across 16 flexible workstations. The results demonstrate that the EA reduced total worker travel distance by 51.45% (from 868.95 m to 421.87 m) and total system time by 13.2% (from 9284.09 min to 8057.85 min), significantly outperforming conventional methodologies.
These findings align with previous studies where layout optimization has proven to reduce costs and travel distances in industrial environments with fixed structures [38]. However, unlike these approaches, the EA applied in this study enables dynamic adjustments, overcoming the limitations of traditional methods in systems with high operational variability. This capability makes it particularly relevant in flexible manufacturing and small-batch production, where layout configurations must continuously adapt to demand.
The use of metaheuristics in layout optimization has been widely explored in high-automation environments. Zhao and Wei [39] combined an enhanced Genetic Algorithm with SLP, successfully improving cellular layout in injection molding workshops. Similarly, Pérez-Gosende et al. [21] determined that integrating SLP with advanced tools such as GA, Particle Swarm Optimization (PSO), and Variable Neighborhood Search (VNS) optimizes space allocation and reduces operational costs. However, these approaches do not address dynamic operation synchronization, which is a critical factor in artisanal manufacturing. The present study demonstrates that Evolutionary Algorithms can be successfully applied in such environments, synchronizing tasks in multi-product systems without requiring advanced automation.
From a methodological perspective, the stability of the EA depends on key parameter configurations, such as population size, crossover rate, and mutation probability. Faruque et al. [30] suggest that integrating an EA with machine learning and hybrid metaheuristics enhances adaptability in environments with high uncertainty. This presents an opportunity to optimize its performance in more complex operational systems with greater demand variability.
While this study demonstrates that the EA outperforms traditional methods in reducing travel distances and synchronizing operations in artisanal manufacturing, its scalability and stability should be further explored in larger-scale systems with greater product diversity. Integrating EA with advanced simulation models and digital twins would allow for performance evaluation in different scenarios in a real-world implementation, ultimately optimizing decision-making in environments with spatial and operational constraints.
Although the proposed EA outperformed SLP and CRAFT, its current structure can be improved to enhance convergence, maintain diversity, and increase solution quality. Key modifications include incorporating elitism, applying an adaptive mutation rate based on population diversity, replacing single-point crossover with multi-point or uniform crossover, and enforcing a minimum Hamming distance between individuals (Appendix A.4). These enhancements can prevent premature convergence and improve performance in layout problems with spatial and operational constraints. They should be validated against reference algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) under identical conditions.

5. Conclusions

Mexican artisanal manufacturing is characterized by family-based management and the lack of formal records in its production processes, which has limited its study from a scientific perspective. This study addressed the facility layout problem in a workshop specializing in wooden furniture manufacturing. This is typically an environment marked by limited space, shared workstations, and simultaneous multi-product elaboration without predefined sequential scheduling. These conditions make layout optimization in this sector a complex challenge, difficult to resolve using conventional methodologies.
To tackle this issue, an EA was implemented to optimize workstation distribution and synchronize operations. The results indicate that the EA reduced total worker travel distance by 51.45% (from 868.95 m to 421.87 m) and decreased total system time by 13.2% (from 9284.09 min to 8057.85 min), significantly outperforming traditional methodologies such as SLP and CRAFT. Additionally, space redistribution reduced the occupied area by 22 m2, improving internal mobility and reducing downtime. On an individual level, Worker 2 reduced their travel distance by 54.6% (from 385.85 m to 175.13 m), while Worker 3 decreased their walking by 55.8% (from 359.22 m to 158.63 m), demonstrating the EA’s impact on workflow optimization in artisanal manufacturing.
Despite these advancements, certain limitations were identified in the model’s implementation. The EA’s sensitivity to parameter calibration, such as population size, crossover rate, and mutation probability, can affect solution stability and quality. Additionally, its applicability in larger-scale production systems with greater product diversity remains an open area for further exploration to ensure its scalability and robustness in manufacturing environments with spatial and technological constraints.
Given these considerations, future research should focus on applying the EA to other manufacturing models, such as cellular manufacturing within the artisanal wooden furniture sector, to distribute and organize workstations into specialized production cells. This transition could optimize workflow without compromising system flexibility, adapting to multi-product elaboration and the need for dynamic adjustments in workstation and material layout. Combining EA with multi-objective optimization models and machine-learning-based heuristics could enable real-time workstation reconfiguration, adjusting to demand variations and spatial constraints. Furthermore, the integration of digital twins would facilitate model validation in real-world implementation, minimizing operational risks and enhancing process control in artisanal manufacturing.
Finally, further EA optimization should explore the incorporation of material handling and transportation costs, leading to a more comprehensive optimization of the total production system. This approach would not only minimize worker travel distances but also reduce internal logistics costs, strengthening the competitiveness of artisanal workshops compared to more technologically advanced production models.

Author Contributions

Writing (Original Draft), E.F.-E., G.F.-L. and L.E.G.-S.; Writing (Review and Editing), L.R.-S., J.M.C.-D. and J.A.-U.; Data Curation, J.A.-U. and R.A.M.-A.; Methodology and Validation, G.F.-L., R.A.M.-A. and L.E.G.-S. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

The data presented in this study are available in this article.

Acknowledgments

The authors express their gratitude to the Group of Artisanal Wooden Furniture Industry Enterprises of Misantla, Veracruz, Mexico, for their valuable support and collaboration in facilitating the development of this research.

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A

Appendix A.1. Pseudocode for the Layout Redistribution Problem

BEGIN/*Simple evolutionary algorithm */
Generate an initial ’population
Computing the evaluation function of each individual.
FOR Generations DO
BEGIN/* Produce new generation */
FOR Survivors DO
BEGIN
      Randomly select individual survivor.
      Mute survivor with some probability.
      Insert survivor in the new population.
END
FOR Totalpopulation1- Survivor DO
BEGIN/* Reproductive cycle */
      Select two individuals from the previous generation, for the crossing (Selection by tournament).
      To cross with some probability the tow individuals obtaining two descendants.
      Mute descendant with some probability.
      Compute the function of the evolution of the mutated descendant.
      Insert mutated descendant in the new generation.
      END
END
END

Appendix A.2. Pseudocode for Generating a New Individual

BEGIN
   FOR i = 1 TO TPOPULATION
   BEGIN
      initialize Individual(individual[i])
      create Individual(individual[i])
      set Travel Indices(individual[i])
      evaluate Individual(individual[i])
   END
END

Appendix A.3. Pseudocode for the Mutation Algorithm

BEGIN
   FOR i = TO SURVIVORS
   BEGIN
      Element = tournament()
      individual[i] = individual[element]
   END
   BEGIN
      father1 = tournament();
      DO
            father2 = tournament();
            UNTIL father2 <> father1
            Individual[i] = cross(father1, father2)
   END
   FOR i = 1 TO MUTATION
   element = random.between(1 and TPOPULATION)
   mutate(individual[element])
END

Appendix A.4. Pseudocode of the Evolutionary Algorithm with Integrated Improvements

bEGIN
   GenerateInitialPopulation()
   FOR i = 1 TO POPULATION_SIZE
   BEGIN
      Evaluate(individual[i])
   END
   //Improvement 1: Elitism
   Elites = SelectBestK(individual, ELITE_COUNT)
   FOR i = 1 TO ELITE_COUNT
   BEGIN
      new_population[i] = Elites[i]
   END
   FOR gen = 1 TO GENERATIONS
   BEGIN
      //Survivor selection with adaptive mutation
      FOR i = 1 TO SURVIVORS
      BEGIN
         element = random(1, POPULATION_SIZE)
         diversity = calculate_diversity(population)
         mutation_rate = adapt_mutation(diversity)
         new_population[i] = mutate(individual[element], mutation_rate)
      END
      //Reproduction with multi-point crossover
      FOR i = SURVIVORS + 1 TO POPULATION_SIZE
      BEGIN
         parent1 = tournament()
         DO
            parent2 = tournament()
         UNTIL parent2 <> parent1
         child = multipoint_crossover(parent1, parent2, 2)
         //Improvement 4: Diversity control
         IF HammingDistance(child, population) < THRESHOLD THEN
            child = mutate(child, HIGH_MUTATION)
         Evaluate(child)
         new_population[i] = child
      END
      //Population replacement
      FOR i = 1 TO POPULATION_SIZE
      BEGIN
         individual[i] = new_population[i]
      END
   END
END

References

  1. Meijer, M.S.; van Jaarsveld, W.; de Kok, T. Synchronization in a Two-Supplier Assembly System: Combining a Fixed Lead-Time Module with Capacitated Make-to-Order Production. Nav. Res. Logist. 2022, 69, 766–782. [Google Scholar] [CrossRef]
  2. Alves, L.V.; Pena, P.N.; Takahashi, R.H. Planning on Discrete Event Systems Using Parallelism Maximization. Control Eng. Pract. 2021, 112, 104813. [Google Scholar] [CrossRef]
  3. Wan, J.; Li, X.; Dai, H.-N.; Kusiak, A.; Martínez-García, M.; Li, D. Artificial-Intelligence-Driven Customized Manufacturing Factory: Key Technologies, Applications, and Challenges. Proc. IEEE 2021, 109, 377–398. [Google Scholar] [CrossRef]
  4. Ghahramani, M.; Qiao, Y.; Zhou, M.C.; O’Hagan, A.; Sweeney, J. AI-Based Modeling and Data-Driven Evaluation for Smart Manufacturing Processes. IEEE/CAA J. Autom. Sin. 2020, 7, 1026–1037. [Google Scholar] [CrossRef]
  5. Ruano, J.H.M.; Segura, J.M.; Mendoza, J.H. Un Sistema ERP para las PYME en América Latina: Revisión de Literatura. Ing. Solidar. 2022, 18, 1–24. [Google Scholar] [CrossRef]
  6. Santos, M.; João, E.; Canelas, J.; Bernardino, J.; Pedrosa, I. The Incorporation of Business Intelligence with Enterprise Resource Planning in SMEs. In Proceedings of the 16th Iberian Conference on Information Systems and Technologies (CISTI), Chaves, Portugal, 23–26 June 2021; IEEE: Piscataway, NJ, USA, 2021; pp. 1–6. [Google Scholar] [CrossRef]
  7. García-Santamaría, L.E.; Fernández-Lambert, G.; Mayett-Moreno, Y.; Alarcón-Ruíz, T.; Parra-Hernández, N.A. Cadenas Rurales de Suministro para la Producción de Muebles de Madera en Misantla, Veracruz. Rev. Mex. Cienc. For. 2023, 14, 58–86. [Google Scholar] [CrossRef]
  8. López-García, A.; Ramírez-Urquidy, M.A.; López-García, A.C. El Financiamiento como Estrategia de Desarrollo en Microempresas Artesanales de San Bartolo Coyotepec, Oaxaca, México. Econ. Soc. Territ. 2022, 22, 23–56. [Google Scholar] [CrossRef]
  9. Chombo, R.A.; Zepeda, J.A.R.; Álvarez, X.P.C. Diagnóstico del Proceso de Producción Artesanal de la Mujer Ñañho en Querétaro, México. Cienc. Intercult. 2018, 22, 48–58. [Google Scholar] [CrossRef]
  10. Flores, C.E.B. Variables Sociodemográficas del Sector Artesanal en un Programa de Logística Inversa. Sapienza Organ. 2017, 4, 53–90. Available online: https://www.redalyc.org/journal/5530/553056607004/html/ (accessed on 20 May 2024).
  11. García-Santamaría, L.; Fernández-Lambert, G.; Díaz-Domínguez, L.; Landa-Zárate, M.; Bandala-Martínez, E. Subcontratación de Operaciones en la Industria de Muebles de Madera Artesanal: Un Enfoque Multicriterio para la Toma de Decisiones. In Tendencias en la Investigación Universitaria, Una Visión desde Latinoamérica; Chirinos, Y., Ramírez, A., Godínez, R., Barbera, N., Rojas, D., Eds.; Fondo Editorial Universitario Servando Garcés: Lima, Peru, 2024; Volume XXIV. [Google Scholar] [CrossRef]
  12. Eglash, R.; Robert, L.; Bennett, A. Automation for the Artisanal Economy: Enhancing the Economic and Environmental Sustainability of Crafting Professions with Human–Machine Collaboration. AI Soc. 2020, 35, 595–609. [Google Scholar] [CrossRef]
  13. Gutiérrez, R.U.; Wanner, A. Innovations in the Production of Ceramic Luminous Environments: Where Craftsman Meets Computer. Inf. Constr. 2016, 117, 73–82. Available online: https://informesdelaconstruccion.revistas.csic.es/index.php/informesdelaconstruccion/article/download/5810/6714/0 (accessed on 20 May 2024).
  14. Gozzi, N.E. Análisis del Impacto de la Flexibilidad Laboral en Centros de Servicios de Empresas Multinacionales en Argentina. Doctoral Dissertation, Universidad de Buenos Aires, Facultad de Ciencias Económicas, Buenos Aires, Argentina, 2013. Available online: http://bibliotecadigital.econ.uba.ar/download/tpos/1502-0133_GozziNE.pdf (accessed on 20 May 2024).
  15. Bautista-Flores, E.; Tena-Hernández, N.Y. Talleres Familiares y Emprendimiento: Un Análisis con Ceramistas de Juan Mata Ortiz, Chihuahua. Rev. Espac. 2024, 45, 80–97. [Google Scholar] [CrossRef]
  16. Delgado-Loor, A.Y.; Zambrano-Montesdeoca, J.L. Los Factores de Competitividad Empresarial en los Emprendimientos Productivos Artesanales de la Ciudad de Portoviejo (Ecuador). MQRInvestigar 2024, 8, 5934–5957. [Google Scholar] [CrossRef]
  17. Flores-Meza, S.; Limaymanta-Perales, J.; Eyzaquirre-Munarriz, J.; Raymundo-Ibañez, C.; Perez, M. Lean Manufacturing Model for Production Management to Increase SME Productivity in the Non-Primary Manufacturing Sector. IOP Conf. Ser. Mater. Sci. Eng. 2020, 796, 012019. [Google Scholar] [CrossRef]
  18. Namicela, M.B.R. Revisión Teórica de Modelos de Gestión Logístico para el Sector Artesanal Macanero Gualaceo-Ecuador. ConcienciaDigital 2021, 4, 19–47. [Google Scholar] [CrossRef]
  19. Jiménez-Castañeda, J.C.; Domínguez-Hernández, M.L.; Martínez-Castro, C.J. Estrategias y Competitividad de los Negocios de Artesanía en México. Pensam. Gestión 2009, 26, 165–190. Available online: http://www.scielo.org.co/scielo.php?pid=S1657-62762009000100008&script=sci_arttext (accessed on 20 May 2024).
  20. Pournaderi, N.; Ghezavati, V.R.; Mozafari, M. Developing a Mathematical Model for the Dynamic Facility Layout Problem Considering Material Handling System and Optimizing It Using Cloud Theory-Based Simulated Annealing Algorithm. SN Appl. Sci. 2019, 1, 832. [Google Scholar] [CrossRef]
  21. Pérez-Gosende, P.; Mula, J.; Díaz-Madroñero, M. Facility Layout Planning: An Extended Literature Review. Int. J. Prod. Res. 2021, 59, 3777–3816. [Google Scholar] [CrossRef]
  22. Zúñiga, E.R.; Moris, M.U.; Syberfeldt, A.; Fathi, M.; Rubio-Romero, J.C. A Simulation-Based Optimization Methodology for Facility Layout Design in Manufacturing. IEEE Access 2020, 8, 163818–163828. [Google Scholar] [CrossRef]
  23. Mollajafari, M.; Ebrahimi-Nejad, S. Recent Advancements in Automotive Engineering by Using Evolutionary Algorithms and Nature-Inspired Heuristic Optimization; IntechOpen: London, UK, 2025. [Google Scholar] [CrossRef]
  24. Bozorg-Haddad, O.; Solgi, M.; Loáiciga, H.A. Meta-Heuristic and Evolutionary Algorithms for Engineering Optimization; John Wiley & Sons: Hoboken, NJ, USA, 2017. [Google Scholar]
  25. Fan, S.; Zhang, Q.; Tao, J.; Yang, Q.; Ling, N. Research on Optimization Method of Motor Manufacturing Layout Based on Genetic Algorithm. In Proceedings of the Fourth International Conference on Mechanical, Electric and Industrial Engineering (MEIE2021), Kunming, China, 22–24 May 2021; IOP Publishing: Bristol, UK, 2021; Volume 1983, p. 012111. [Google Scholar] [CrossRef]
  26. Liu, J.; Liu, S.; Liu, Z.; Li, B. Configuration Space Evolutionary Algorithm for Multi-Objective Unequal-Area Facility Layout Problems with Flexible Bays. Appl. Soft Comput. 2020, 89, 106052. [Google Scholar] [CrossRef]
  27. Vidal, J.C.; Mucientes, M.; Bugarín, A.; Lama, M. Machine Scheduling in Custom Furniture Industry Through Neuro-Evolutionary Hybridization. Appl. Soft Comput. 2011, 11, 1600–1613. [Google Scholar] [CrossRef]
  28. Ma, X.; Pu, X.; Fu, Y. Multi-Objective Integrated Harvest and Distribution Scheduling for Fresh Agricultural Products with Farm-to-Door Requirements Using Q-Learning and Problem Knowledge-Based Cooperative Evolutionary Algorithms. Comput. Ind. Eng. 2025, 200, 110755. [Google Scholar] [CrossRef]
  29. Dahane, A.; Benameur, R.; Kechar, B. An Innovative Smart and Sustainable Low-Cost Irrigation System for Smallholder Farmers’ Communities. In Proceedings of the 3rd International Conference on Embedded & Distributed Systems (EDiS), Oran, Algeria, 27–29 September 2022; IEEE: Piscataway, NJ, USA, 2022; pp. 37–42. [Google Scholar] [CrossRef]
  30. Faruque, M.O.; Sharmin, S.; Talukder, T.; Chowdhury, S.N. Management Information Systems: Evaluating the Adoption and Impact of Cloud Computing in Enterprise Information Systems. J. Asian Bus. Strategy 2024, 14, 90. [Google Scholar] [CrossRef]
  31. Omowole, B.M.; Olufemi-Philips, A.Q.; Ofadile, O.C.; Eyo-Udo, N.L.; Ewim, S.E. Barriers and Drivers of Digital Transformation in SMEs: A Conceptual Analysis. Int. J. Front. Res. Multidiscip. Stud. 2024, 5, 019–036. [Google Scholar] [CrossRef]
  32. Anacona-Mopan, Y.; Segura-Dorado, J.; Paz-Orozco, H. Optimización de la Distribución en Planta con Formulación QAP y Simulación de Eventos Discretos. Inf. Técnico 2023, 87, 13–28. [Google Scholar] [CrossRef]
  33. García Dunna, E.; García Reyes, H.; Cárdenas Barrón, L. Simulación y Análisis de Sistemas con ProModel; Rosas, P.M., Ed.; Pearson Educación de México, S.A. de C.V.: Mexico City, Mexico, 2006. [Google Scholar]
  34. Law, A.M. Simulation Modeling and Analysis, 5th ed.; McGraw-Hill: New York, NY, USA, 2015. [Google Scholar]
  35. González-Estrada, E.; Cosmes, W. Shapiro–Wilk Test for Skew Normal Distributions Based on Data Transformations. J. Stat. Comput. Simul. 2019, 89, 3258–3272. [Google Scholar] [CrossRef]
  36. Flores Muñoz, P.; Muñoz Escobar, L.; Sánchez Acalo, T. Estudio de Potencia de Pruebas de Normalidad Usando Distribuciones Desconocidas con Distintos Niveles de No Normalidad. Perfiles 2019, 1, 4–11. [Google Scholar] [CrossRef]
  37. Micheli, G.J.; Rampoldi, A.; Baccanti, F. A Revised Systematic Layout Planning to Fit Disabled Workers Contexts. Sustainability 2021, 13, 6850. [Google Scholar] [CrossRef]
  38. Dresanala, M.; Kusuma Dewi, S.; Utama, D.M. Sustainable Layout Design Based on Integrated Systematic Layout Planning and TOPSIS: A Case Study. J. Tek. Ind. 2023, 24, 51–64. [Google Scholar] [CrossRef]
  39. Zhao, M.; Wei, X. Research on Cell Layout of Injection Workshop Based on Improved SLP-GA. In Proceedings of the 4th International Seminar on Computer Technology, Mechanical and Electrical Engineering (ISCME 2019), Chengdu, China, 13–15 December 2019; IOP Publishing: Bristol, UK, 2020; Volume 1486, p. 072079. [Google Scholar] [CrossRef]
Figure 1. Facility layout and its relationship with the alphanumeric code. The diagram shows the spatial arrangement of the facility elements (RMW, MSA, FPW, WT, WS, SAR) within the production system. Each element is coded (COD), decoded (DEC), and linked to a specific workshop station (WS). Colors indicate functional categories: green for active workshop stations (WS), orange for worker stations (WT), gray for inactive or unassigned areas, and white for storage or service elements (RMW, MSA, FPW, SAR). The “Code” and “Decoding” matrices provide a numeric-alphabetic reference for identifying element positions. Cells marked with “0” indicate non-assigned zones.
Figure 1. Facility layout and its relationship with the alphanumeric code. The diagram shows the spatial arrangement of the facility elements (RMW, MSA, FPW, WT, WS, SAR) within the production system. Each element is coded (COD), decoded (DEC), and linked to a specific workshop station (WS). Colors indicate functional categories: green for active workshop stations (WS), orange for worker stations (WT), gray for inactive or unassigned areas, and white for storage or service elements (RMW, MSA, FPW, SAR). The “Code” and “Decoding” matrices provide a numeric-alphabetic reference for identifying element positions. Cells marked with “0” indicate non-assigned zones.
Algorithms 18 00270 g001
Figure 2. (a) Case study: worker movement sequences: Worker 1. (b) Case study: worker movement sequences: Worker 2. (c) Case study: worker movement sequences: Worker 3. The figure shows the physical arrangement of facility elements in the production system. Each block is labelled with a number corresponding to the decoding in Figure 1. Colors indicate functional categories: grey blocks represent storage and service areas (Raw Material Warehouse, Material Storage Area, Finished Product Warehouse, and Service Area); green blocks represent active workshop stations (e.g., saws, planers, shredders); and orange blocks indicate worker stations (WT). This layout supports the identification of spatial relationships and operational flow.
Figure 2. (a) Case study: worker movement sequences: Worker 1. (b) Case study: worker movement sequences: Worker 2. (c) Case study: worker movement sequences: Worker 3. The figure shows the physical arrangement of facility elements in the production system. Each block is labelled with a number corresponding to the decoding in Figure 1. Colors indicate functional categories: grey blocks represent storage and service areas (Raw Material Warehouse, Material Storage Area, Finished Product Warehouse, and Service Area); green blocks represent active workshop stations (e.g., saws, planers, shredders); and orange blocks indicate worker stations (WT). This layout supports the identification of spatial relationships and operational flow.
Algorithms 18 00270 g002aAlgorithms 18 00270 g002b
Figure 3. Solutions for facility layout redesign using SLP (a), CRAFT (b), and EA (c) for the simultaneous production of three different products with flexible workstations. Each matrix shows the spatial arrangement of facility elements. The numbers represent the coded workshop stations listed in Figure 1. Grey-shaded cells indicate shared or repeated use of the same workstation (e.g., station 3), reflecting workstation flexibility in the redesign.
Figure 3. Solutions for facility layout redesign using SLP (a), CRAFT (b), and EA (c) for the simultaneous production of three different products with flexible workstations. Each matrix shows the spatial arrangement of facility elements. The numbers represent the coded workshop stations listed in Figure 1. Grey-shaded cells indicate shared or repeated use of the same workstation (e.g., station 3), reflecting workstation flexibility in the redesign.
Algorithms 18 00270 g003
Figure 4. Impact of the EA on travel distance optimization. (a) Comparison between initial travel distance and optimized travel distance after applying the EA. (b) Total travel distance reduction across SLP, CRAFT, and EA optimization methods.
Figure 4. Impact of the EA on travel distance optimization. (a) Comparison between initial travel distance and optimized travel distance after applying the EA. (b) Total travel distance reduction across SLP, CRAFT, and EA optimization methods.
Algorithms 18 00270 g004
Figure 5. Average time in the system for each product in initial and optimized layouts.
Figure 5. Average time in the system for each product in initial and optimized layouts.
Algorithms 18 00270 g005
Table 1. Algorithm parameter configurations.
Table 1. Algorithm parameter configurations.
Configuration *PopulationGenerationSurvivorsMutation Rate
Scenario 15000100040000.80
Scenario 2500050040000.80
Scenario 3500050020000.80
Scenario 4500050020000.20
* 2P×2W: 3 products, 2 workers; 3P×3W: 3 products, 3 workers; 4P×4W: 4 products, 4 workers.
Table 2. Comparison of operator travel distance in initial and EA-optimized layouts.
Table 2. Comparison of operator travel distance in initial and EA-optimized layouts.
OperatorLayoutUDST (h)NUTPU (min)% BT% UTTDI (m)DTO (m)
Worker 1Initial162.68210.100.09123.88
Optimized145.57210.080.010.0785.37
Worker 2Initial162.68500.1400.2385.85
Optimized145.57500.0600.13162.02
Worker 3Initial162.68560.1200.19359.22
Optimized145.57560.0600.13153.15
Total Travel Distance868.95400.56
UD: Units, ST: Schedule Time, NU: Number of Uses, TPU: Average Time per Use, BT: Blockage in Transport, UT: Utilization, TDI: Total Distance—Initial, TDO: Total Distance—Optimized.
Table 3. Solution Data for SLP, CRAFT, and EA Methods.
Table 3. Solution Data for SLP, CRAFT, and EA Methods.
WorkerSolution Method
ITD SLP ††CAW †††EA ††††
1123.88114.8684.785.37
2385.85274.95194.7162.02
3359.22238.43223.3153.15
Total travel distance (m)868.95628.24533.5400.56
Distance reduction (m)240.71335.45468.38
Total travel distance reduction (%)27.7038.6053.90
Average execution time per run (s) 13.525.2192.00
ITD: Initial travel distance per worker; †† SLP: Systematic Layout Planning; ††† CAW: CRAFT algorithm in WinQSB®; †††† EA: Evolutionary Algorithm.
Table 4. One-way ANOVA for optimization methods.
Table 4. One-way ANOVA for optimization methods.
SOV SS ††DF †††MS ††††F-Statisticp-Value
Between groups315,769.252157,884.638806.19<0.01
Within groups753.014217.93
Total316,522.2644
SOV: Source of variation; †† SS: Sum of squares; ††† DF: Degrees of freedom; †††† MS: Mean square.
Table 5. Comparison of average processing time per entity in the initial and EA-optimized layouts.
Table 5. Comparison of average processing time per entity in the initial and EA-optimized layouts.
ProductLayoutTOCQSATS (min)ATM (min)AWT (min)AOT (min)ABT (min)
Product 1Initial102510.702.470.3582199.68308.19
Optimized102451.761.950.132070.51379.16
Product 2Initial104096.537.42330.773758.340.00
Optimized103219.83.62317.512896.71.96
Product 3Initial102676.857.160.002589.4280.27
Optimized102866.773.630.002797.0666.07
Total System TimeInitial9284.09
Optimized8538.33
TO: Total outputs, CQS: Current quantity in the system, ATS: Average time in the system, ATM: Average time in movement, AWT: Average waiting time, AOT: Average operation time, ABT: Average blocked time.
Table 6. Artisanal production scenarios using EA, SLP, and CRAFT.
Table 6. Artisanal production scenarios using EA, SLP, and CRAFT.
MetricScenario
2P×2W *3P×3W * (Base)4P×4W *
Initial Distance (m)654.12868.951007.98
SLP Distance (m)498.92628.24728.75
CRAFT Distance (m)442.95533.5628.86
EA Distance (m)239.07400.56431.52
* 2P×2W: 3 products, 2 workers; 3P×3W: 3 products, 3 workers; 4P×4W: 4 products, 4 workers.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Fernández-Echeverría, E.; Fernández-Lambert, G.; García-Santamaría, L.E.; Ruvalcaba-Sánchez, L.; Melendez-Armenta, R.A.; Carrión-Delgado, J.M.; Aparicio-Urbano, J. An Evolutionary Algorithm for Efficient Flexible Workstation Layout in Multi-Product Handcrafted Manufacturing. Algorithms 2025, 18, 270. https://doi.org/10.3390/a18050270

AMA Style

Fernández-Echeverría E, Fernández-Lambert G, García-Santamaría LE, Ruvalcaba-Sánchez L, Melendez-Armenta RA, Carrión-Delgado JM, Aparicio-Urbano J. An Evolutionary Algorithm for Efficient Flexible Workstation Layout in Multi-Product Handcrafted Manufacturing. Algorithms. 2025; 18(5):270. https://doi.org/10.3390/a18050270

Chicago/Turabian Style

Fernández-Echeverría, Eduardo, Gregorio Fernández-Lambert, Luis Enrique García-Santamaría, Loecelia Ruvalcaba-Sánchez, Roberto Angel Melendez-Armenta, Juan Manuel Carrión-Delgado, and José Aparicio-Urbano. 2025. "An Evolutionary Algorithm for Efficient Flexible Workstation Layout in Multi-Product Handcrafted Manufacturing" Algorithms 18, no. 5: 270. https://doi.org/10.3390/a18050270

APA Style

Fernández-Echeverría, E., Fernández-Lambert, G., García-Santamaría, L. E., Ruvalcaba-Sánchez, L., Melendez-Armenta, R. A., Carrión-Delgado, J. M., & Aparicio-Urbano, J. (2025). An Evolutionary Algorithm for Efficient Flexible Workstation Layout in Multi-Product Handcrafted Manufacturing. Algorithms, 18(5), 270. https://doi.org/10.3390/a18050270

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop