To address the issue of product family formation, we propose an approach that integrates the AHP algorithm with the Average Linkage Clustering (ALC) hierarchical clustering method. This approach aims to streamline decision-making and optimize the formation of product families in manufacturing systems. Our methodology commences with defining the system, identifying its key components, and establishing relevant criteria for product family formation. Subsequently, we proceed to define the products and their variations, taking into account their technical characteristics and specific requirements. Once the products are defined, we move on to the pivotal step of criterion selection. Here, we assess the relative importance of these criteria in the context of product family formation. The AHP algorithm facilitates a structured analysis, allowing us to assign weights to various criteria based on their influence on family formation [
65]. Following this, we calculate matrices for each criterion, enabling us to obtain similarity measures between products. These similarity measures are then employed within the ALC algorithm to generate a dendrogram. This dendrogram provides a graphical representation of similarity relationships among products, simplifying the process of family formation. Our approach offers numerous advantages. It supports a systematic and comprehensive analysis of product families, considering both technical aspects and product-specific requirements. Furthermore, it facilitates the comparison and selection of optimal family formation options, optimizing resource allocation and enhancing manufacturing process efficiency.
Figure 2 outlines the proposed methodology for product family formation for reconfigurable manufacturing systems (RMSs).
Preliminary Analysis: The first phase combines the system definition and product definition steps to establish a comprehensive foundation for RMS design. This involves clearly defining the system, its purpose, and its boundaries using the QQOQCCP approach (who, what, where, when, how, how much, and why), which systematically identifies the stakeholders, requirements, and constraints. The Ishikawa tool (fishbone diagram) is employed to perform a detailed cause-and-effect analysis, uncovering potential challenges and their root causes. To complement these structured tools, brainstorming sessions are conducted to foster creativity and explore diverse design possibilities. Additionally, this phase defines the product and its variants. Functional analysis is applied to identify the core functions of the product, while the functional relationship diagram (FAST diagram) visualizes the relationships between these functions. The tree diagram is used to systematically decompose the product into its variants, highlighting the unique characteristics of each. This combined analysis ensures that the RMS design accommodates product diversity while aligning with the overarching system objectives.
Criteria Selection: In this phase, researchers identify and prioritize the evaluation criteria needed to assess the performance of various RMS configurations. The process begins with brainstorming to generate an extensive list of potential criteria, followed by the application of the prioritization axis to rank these criteria based on their importance. To refine this selection further, Pareto analysis is conducted to pinpoint the most impactful criteria, ensuring the evaluation process focuses on the factors that significantly influence RMS performance. By prioritizing relevant criteria, this phase streamlines the subsequent evaluation and decision-making processes.
Matrix Construction: This phase involves the construction of comparison matrices to systematically evaluate RMS variants against the selected criteria. Matrix-based methods are employed to calculate comparison matrices for each criterion, quantifying the relative performance of the alternatives. The detailed methodologies and applications of these matrix-based methods will be elaborated upon in the following section, offering a deeper understanding of their role in the evaluation process. To further enhance the analysis, weighted similarity measures are applied to generate a similarity matrix, providing a structured and objective assessment of the RMS configurations. These tools ensure a robust evaluation, allowing for a clear comparison of the alternatives.
Clustering: The final phase focuses on grouping the RMS variants into clusters based on their similarities. The Average Linkage Clustering (ALC) algorithm is applied to process the similarity matrix and generate meaningful clusters. These clusters are represented visually using a dendrogram, which illustrates the hierarchical relationships among the RMS variants. This clustering process facilitates the identification of product families and their associated RMS configurations, offering decision-makers a clear pathway for selecting optimal designs that align with system requirements and constraints.
The structured methodology presented above ensures systematic progression from defining the system to identifying optimal product families within the RMS framework. In the subsequent section, we delve deeper into the matrix-based methods introduced in Phase 3. This includes a detailed explanation of the techniques used to construct comparison matrices, generate similarity measures, and evaluate RMS variants objectively. This discussion provides a robust foundation for understanding how these methods contribute to effective clustering and decision-making processes in RMS design.
3.1. Comparison Criteria
In the context of our methodology, we pay special attention to essential comparison criteria that play a key role in evaluating and optimizing configurations of reconfigurable manufacturing systems (RMSs) for different product families. These criteria include assembly sequence, machining sequence, components, tools and directions, and production demand. These criteria have been rigorously selected for their relevance and significance in assessing the performance and flexibility of RMS configurations in response to the specific needs of each product. The consideration of multiple criteria requires the use of appropriate mathematical and statistical tools for data normalization and comparison. In this initial stage of our work, we focus on a limited number of comparison criteria, but it is important to note that our method is extensible to accommodate other relevant criteria. Thus, we will be able to adapt our approach to integrate additional criteria that will allow for a more in-depth analysis of production systems. Our goal is to provide a comprehensive and informed assessment of different RMS configurations for each product family, facilitating decision-making during the optimal design of these systems. To achieve this, we will ensure the application of calculation methods and construction of similarity matrices specific to each criterion, enabling the precise evaluation of the performance of different configurations. By using mathematical and statistical tools and appropriate analytical approaches, we aim to establish meaningful relationships between the comparison criteria and the performance of RMS configurations. This rigorous approach will allow us to better understand the interactions between the criteria and identify the most performant and flexible configurations for each product family. In our case, product comparison criteria are assessed using three main mathematical tools: Robinson–Foulds distance, Jaccard similarity coefficient, and the similarity matrix. Each of these tools is specifically designed to generate the similarity matrix associated with a given criterion.
Table 2 concisely summarizes the tools assigned to each criterion, along with the corresponding calculation method. In the following section, we will detail each tool separately.
3.1.1. The Robinson–Foulds Distance (RFij)
The Robinson–Foulds distance is a measure used to assess the difference between two phylogenetic trees, which are graphical representations of evolutionary relationships between different species or genetic sequences. In biology, a phylogenetic tree helps understand how species are related and how they have evolved from a common ancestor [
66]. In the context of forming product families in reconfigurable manufacturing systems, the Robinson–Foulds distance can be adapted to compare the assembly sequences of different products. By using this measure, it is possible to evaluate the similarity between products and group them into coherent families, facilitating the design of efficient and flexible reconfigurable manufacturing systems [
66].
The Robinson–Foulds distance (RF) between two phylogenetic trees Ti and Tj can be calculated using Equation (1):
where RFmax is the maximum possible number of differences between two trees with mi and mj leaves, respectively. The value of RFmax for two trees with mi and mj leaves is given by Equation (2):
RF(Ti, Tj) represents the Robinson–Foulds distance between trees T1 and T2 and is calculated as follows (Equation (3)):
Here, Ci represents the set of branches (nodes) in tree Ti that are not present in tree Tj, and Cj represents the set of branches in tree Tj that are not present in tree Ti. By using the normalized Robinson–Foulds distance (RFsn), a value ranging from 0 to 1, which quantifies the similarity between phylogenetic trees, is obtained. A value closer to 0 indicates greater similarity between trees, while a value closer to 1 indicates greater dissimilarity between trees. The use of the Robinson–Foulds distance in forming product families for reconfigurable manufacturing systems enables informed decisions regarding optimal system configurations and resource allocation for each product family. By grouping similar products, it is possible to optimize equipment and resource utilization while maintaining sufficient flexibility to adapt to future changes.
Example:
We shall now proceed to calculate the Robinson–Foulds distance (RF) between the two given phylogenetic trees, denoted as T1 and T2 (
Figure 3). In the context of phylogenetic trees, T1 and T2 have the same leaves, which are 1, 2, 3, 4, and 5. So, m1 = m2 = 5 and
RFmax = ½(m1 + m2 − 2) = ½(5 + 5 − 2) = 4.
To calculate the set of branches (nodes):
for Tree T1, C1 represents {(1,2), (1,2,3), (4,5), (1,2,3,4,5)}, and for Tree T2, C2 represents {(2,3), (1,2,3), (1,2,3,4), (1,2,3,4,5)}.
To calculate the differences in branches:
|C1\C2| = |{(1,2), (4,5)}| = 2/(the elements that are in C1 but not in C2).
|C2\C1| = |{(2,3), (1,2,3,4)}| = 2/(the elements that are in C2 but not in C1).
To calculate RF(T1, T2):
RF(T1, T2) = ½(|C1\C2| + |C2\C1|) = ½(2 + 2) = ½ * 4 = 2,
and RFsn(T1, T2) = (RFmax − RF(T1, T2))/RFmax = (4 − 2)/4 = 0.5.
3.1.2. The Levenshtein Distance
When forming product families within reconfigurable manufacturing systems (RMSs), evaluating the similarity between machining sequences is essential for reconfiguration optimization. To achieve this, the edit distance, also known as the Levenshtein distance, can be a valuable tool. The edit distance measures the minimum number of operations required to transform one sequence into another. These operations typically include inserting, deleting, or substituting characters. To calculate the edit distance between two machining sequences, follow these steps:
Create an (m + 1) × (n + 1) Levenshtein distance matrix, where m is the length of the first sequence and n is the length of the second sequence.
Initialize the first row of the matrix from 0 to m (i.e., 0, 1, 2, …, m) and the first column from 0 to n.
Traverse the elements of the matrix, starting from the second row and second column. For each element (i, j) of the matrix, calculate the minimum edit distance as follows:
If the characters at position i in the first sequence and position j in the second sequence are identical, assign the value from matrix–cell (i − 1, j − 1) to cell (i, j). Otherwise, assign to cell (i, j) the smallest value among (i − 1, j), (i, j − 1), and (i − 1, j − 1), then add 1.
- 4.
Once you have traversed the entire matrix, the edit distance between the two sequences is contained in cell (m, n).
Then, to obtain a similarity coefficient between the machining sequences, the following formula can be used (Formula (4)):
where d(S1, S2) is the calculated edit distance between sequences S1 and S2, and |S1| and |S2| are the respective lengths of the sequences. The similarity coefficient ranges from 0 to 1, where 0 indicates complete similarity (the sequences are identical), and 1 indicates complete dissimilarity (the sequences are entirely different). For example, if we compare two machining sequences, S1 = “A-B-C-D” and S2 = “A-C-B-D,” the edit distance is 2 (by swapping “B” and “C”). Using the formula above, the similarity would be 1 − (2/4) = 0.5. This similarity value reflects the extent to which the machining sequences are similar, which can be useful for product family formation and RMS optimization.
3.1.3. The Jaccard Similarity Coefficient
The Jaccard similarity coefficient, often denoted as Jij, constitutes a fundamental metric harnessed within our methodology for the meticulous comparison of components and tools across diverse product families within reconfigurable manufacturing systems. This coefficient, Jij, serves as a quantitative gauge to assess the likeness between any two products, i and j, contingent upon the presence or absence of shared components and tools. This critical coefficient is mathematically expressed as Equation (5):
Herein,
‘a’ conveys the tally of components shared in common by products i and j;
‘b’ represents the count of components exclusive to product i, not shared with j;
‘c’ signifies the count of components exclusive to product j, not found in i.
This equation elegantly encapsulates the essence of the Jaccard similarity coefficient. It quantifies the similarity by dividing the count of shared components (‘a’) by the total count of components across both products (‘a + b + c’). The resulting value is bound within the range of 0 to 1, where 0 signifies a complete absence of similarity (indicating that there are no shared components), while 1 denotes perfect similarity (implying that the two products share identical components). This mathematical formulation holds pivotal importance within our methodology as it offers a precise and quantifiable means to scrutinize and delineate the degrees of commonality and differentiation among product variants concerning their components and tools. By systematically applying the Jaccard similarity coefficient to assess product families, we gain profound insights into the intricacies of their relationships and resemblances. This, in turn, underpins the process of forming coherent product families by clustering products exhibiting higher Jaccard similarity coefficients. These coefficients bear testament to greater commonality in components and tools. In our approach, the utilization of this coefficient is paramount in making informed decisions regarding resource allocation and configuration choices for each product family, ultimately augmenting manufacturing system efficiency and adaptability.
For example, let us consider two different types of smartphones, Phone A and Phone B, and we want to evaluate their component similarity. As is shown in
Table 3, these smartphones have various components, including processors, cameras, memory, and battery types.
Now, let us calculate the Jaccard similarity coefficient (JAB) between Phone A and Phone B based on their components. We will use Formula (5) to do so.
‘a’ (shared components): 2 (64 GB of RAM, lithium-ion battery), ‘b’ (components unique to Phone A): 2 (Qualcomm Snapdragon processor, 12-megapixel camera), and ‘c’ (components unique to Phone B): 2 (MediaTek Helio processor, 16-megapixel camera).
Then, apply the formula: JAB = 2/(2 + 2 + 2) = 2/6 = 1/3.
The Jaccard similarity coefficient (JAB) between Phone A and Phone B is 1331 or approximately 0.33. This indicates a moderate degree of similarity in their components, with one-third of the components being shared between the two smartphones. The coefficient provides a quantitative measure of their similarity, which can be valuable for grouping similar products within reconfigurable manufacturing systems.
3.1.4. The Demand Similarity Coefficient
The demand similarity coefficient, denoted as Dij, serves as a quantitative measure to assess how closely aligned or distinct the production demands of two specific products, i and j, are from each other. This coefficient, as expressed in Equation (6), takes into consideration the individual demand levels (di and dj) of these products, as well as the overall range of demands observed within the entire set of products being considered for grouping [
12].
In this equation, the term |di − dj| represents the absolute difference in demand between products i and j, while dmax and dmin represent the maximum and minimum demand values, respectively, among all the products included in the grouping analysis.
For instance, let us consider a scenario involving four distinct products: Product X, with a demand of 100 units; Product Y, with a demand of 80 units; Product Z, with a demand of 120 units; and Product W, with a demand of 90 units. To calculate the demand similarity coefficient between Products X and Y, we can apply Equation (5) as follows:
The result, in this case, indicates a demand similarity coefficient of 0.5 or 50% between Products X and Y. This figure implies a moderate level of similarity in their production demands. Such quantitative assessments enable manufacturing systems to effectively group products with similar demand patterns, thus aiding in optimized resource allocation and production planning. Importantly, this approach minimizes the risk of plagiarism while providing an informative example.
3.2. Similarity Matrix and ALC Algorithm
The algorithmic approach for clustering initiates with the computation of similarity matrices for each criterion, involving pairwise comparisons between the products. This fundamental step allows for the quantification of how alike or distinct products are concerning different aspects. Subsequently, degrees of importance are assigned to each criterion, emphasizing their respective significance in the overall evaluation process [
31]. Once the individual similarity matrices are established, the final similarity matrix is constructed by aggregating them while considering the weighted importance assigned to each criterion. This process involves a weighted sum of the matrices, where each criterion’s matrix is multiplied by its corresponding degree of importance and then summed up. The result is a comprehensive similarity matrix that synthesizes the multiple aspects of comparison, duly normalized by the degrees of importance to ensure equitable contributions from each criterion. This is represented by Equation (7):
Here, S denotes the final similarity matrix, ‘n’ signifies the number of criteria, σᵢ represents the degree of importance for criterion ‘i’, and Cᵢ represents the comparison matrix for criterion ‘i’. This equation illustrates the aggregation of individual criterion matrices, each weighted by its respective importance factor, to construct the ultimate similarity matrix. With the final similarity matrix in hand, the algorithm proceeds to employ the Average Linkage Clustering (ALC) technique to generate a dendrogram. ALC is a hierarchical clustering method that organizes products into coherent groups based on their similarities, as indicated in the similarity matrix. The process of forming families begins by treating each product or product family individually. The algorithm then searches for the two most similar products or product families using the highest similarity coefficient, as determined by the following Equation (8):
Here,
Spq represents the similarity between product families
p and
q,
is the sum of similarities between individual products in
p and
q, and
Np and
Nq are the numbers of products in families
p and
q, respectively. This mathematical equation is crucial for the ALC algorithm as it allows for the recalculation of similarity between merged families while considering the similarity between individual products within each family [
31]. A typical formula for calculating similarity between two families, based on the similarity coefficient between individual products, is applied at each merging step. This iterative process repeats until all product families are grouped into a hierarchical structure, forming a dendrogram. This hierarchical dendrogram graphically represents the similarity relationships between product families, making decision-making easier during the design of reconfigurable manufacturing systems. The algorithm for Average Linkage Clustering (ALC) employed in product grouping is visually illustrated in the forthcoming
Figure 4. The ALC algorithm systematically constructs the dendrogram by iteratively merging product families based on their similarity. Each level of the dendrogram represents varying degrees of similarity, while the horizontal branches illustrate the merging of product families. The vertical lines on the dendrogram indicate the point at which these mergers occurred, and the height at which they intersect corresponds to the level of similarity between the merged families.
Figure 5 demonstrates the dendrogram generation process utilizing the ALC method. By examining the dendrogram, engineers and decision-makers can gain a comprehensive understanding of how product families cluster together, identifying which ones share the highest degree of similarity.
This hierarchical representation aids in optimizing system configurations, resource allocation, and production planning by providing a clear visual depiction of product relationships within the manufacturing system. Consequently, it streamlines the decision-making process, leading to more efficient and adaptable reconfigurable manufacturing systems.