# Optimal Machine Tools Selection Using Interval-Valued Data FCM Clustering Algorithm

Authors: Yupeng Xin; Xitian Tian; Lijiang Huang
Journal: Mathematical Problems in Engineering
 (2014)

---

## Abstract

Machine tool selection directly affects production rates, accuracy, and flexibility. In order to quickly and accurately select the appropriate machine tools in machining process planning, this paper proposes an optimal machine tools selection method based on interval-valued data fuzzy C-means (FCM) clustering algorithm. We define the machining capability meta (MAE) as the smallest unit to describe machining capacity of machine tools and establish MAE library based on the MAE information model. According to the manufacturing process requirements, the MAEs can be queried from MAE library. Subsequently, interval-valued data FCM algorithm is used to select the appropriate machine tools for manufacturing process. Through computing matching degree between manufacturing process machining constraints and MAEs, we get the most appropriate MAEs and the corresponding machine tools. Finally, a case study of an exhaust duct part of the aeroengine is presented to demonstrate the applicability of the proposed method.


---

## Body

## 1. Introduction

Machine tools selection is one of the most important strategic decisions in production planning [1]. The proper selection of machine tools can boost manufacturing throughputs and quality of finished products, while reducing manufacturing costs [2]. Machining capacity is one of the main considerations in machine tools selection [3–5]. However, due to the complexity and fuzziness of the machine tools capacity, there are no quantitative criteria to evaluate the matching degree of machine tools and manufacturing process technological requirements. The result is that the machine tool selection scheme made by technologists may be used to focus on individual commonly used, high-performance machines [6–9]. In this case, it is hard to balance production tasks in the production planning phase, which leads to part of the machine tools’ overloaded work, while the other parts of the machine tools are idle and result in a waste of manufacturing resources [10–12].In order to resolve this problem, Song et al. [13] established machining capacity model of machine tool and obtained feature information by STEP files to inspect machine tools constraints conditions and then to determine whether the machine tools meet the parts machining requirements. Hao et al. [14] established machining capacity model of machine tool under network collaborative environment and, on this basis, constructed a network manufacturing resource optimization selection system. To resolve matching problem between manufacturing resources and manufacturing process in cross-enterprise process proliferation, Zhao and Mo [15] established machining capacity model of machine tool and resolved matching problem between manufacturing resources and manufacturing process in cross-enterprise process proliferation.The basic idea of these studies is to take machining capacity as the core to establish machine tool information model, through building the manufacturing process constraints or objective optimization function, and realize machine tools optimal selection using mathematical algorithm. From another perspective, the machine tools selection can be regarded as a matching process of machine tools capacities and manufacturing process technological requirements [16]. However, different machine tools may have similar machining capacities; it is difficult for technologists to estimate which is the most appropriate machine tool for a specific manufacturing process. Therefore, it is necessary to research the machining capacity similarity of different machine tools. Due to the fuzziness of the machine tools capacity, researchers try to use fuzzy clustering algorithm to solve this problem.Tian et al. [17] clustered machining elements using FCM algorithm and optimized clustering analysis by calculating membership degrees of machining methods, cutting tools compatibility, and other process elements. But this method has some difficulties in determining the fuzzy membership and cannot well reflect the matching degrees between machining requirements and machine tools capabilities. In order to solve this problem, Aghdaie et al. [18] calculated the degree of the similarity between the requirements and resources using grey correlation degree and established optimal objective function within the class polymerization degree and separation degree. Aghdaie’s work makes up for the deficiency of clustering algorithm proposed in Tian’s paper. Liu [19] completed optimal evaluation index system of machine tools and the attribute weighting factor decision algorithm using cluster analysis and rough set theory.The algorithms described above are only for the single value, however machining capacity model includes interval-valued data which is hard to be processed by these methods. For solving this problem, Chuang et al. [20] proposed interval-valued data FCM algorithm. On that basis, Ozkan and Türken [21] proposed an improved FCM algorithm for interval-valued data and discussed the relationship of different interval-valued data FCM algorithms. These works have made some progress in interval-valued data fuzzy cluster. The disadvantage is that they still defined distance by Euclidean distance of the point set rather than the distance of interval-valued data. Aiming at this problem, this paper introduces a new distance measure method of interval-valued data and expands FCM clustering algorithm.In this paper we propose to define the machining capability meta (MAE) as the smallest unit to describe machining capacity of machine tools and quantitatively analyze the machining capacity similarity of different machine tools using a new interval-valued data FCM algorithm. Through computing matching degree between manufacturing process constraints and MAEs, we get the most appropriate MAEs for the manufacturing process and, finally, get the optimal selection of machine tools according to the correspondence between machine tools and MAEs.The rest of the review paper is synthesized as follows. Section2 elaborates the definition of MAE and establishes the MAE information model. Section 3 introduces the optimal selection method of machine tools and explains the necessity of interval-valued data FCM algorithm for this method and presents the proposed method in detail. Section 4 presents the case study and,finally, the conclusion is stated in Section 5.


## 2. Machining Capacity Meta Model

Machining capacity elements mainly include machinable parts types, machinable features types, machinable features dimension, machining accuracy, and technical constraints. Among these factors, the machinable features dimension and the machining accuracy are the main metrics of machine tools capacity. In this paper, based on the manufacturing features, we take MAE as the minimum unit to reflect the machining capacity of machine tools, which can be defined as follows.Definition 1.
MAE is the minimum unit to reflect the machine tools machining capacity, its formalized representation is:MAE
:
:
=
{
ID
,
BasProperty
,
EleCapacity
}, where ID is the identifier of MAE, BasProperty is the basic property of MAE, EleCapacity is manufacturing meta.Definition 2.
The formalized representation of BasProperty isBasProperty
:
:
=
{
PT
,
FT
,
MO
,
MT
}, where PT is machinable parts types, like axis, sleeve, plate, and box. FT is machinable features types, like hole and groove. MO is machining operation, like turning, milling, and drilling. MT is machinable materials.Definition 3.
Manufacturing meta is the information set of machinable dimension and machining quality. According to different parts types, manufacturing meta contains different elements. One assumes that parts types are divided into rotational and nonrotational, aiming at rotational parts, the formalized representation of manufacturing meta isEleCapacity
:
:
=
{
ML
,
MD
,
FL
,
FD
,
MA
,
MR
}, where ML is machinable parts length, MD is machinable parts diameter, FL is machinable feature length, FD is machinable feature diameter, MA is dimensional accuracy, and MR is surface roughness.According to the above definitions, we establish MAE information model as shown in Figure1. A MAE corresponds to a manufacturing feature. The manufacturing feature describes the machining region of a machining operation and expresses the result of a machining operation. A machining feature corresponds to a machining operation, which includes machining strategy and machine tool, cutting tools, and fixture. The machining capacity of machine tool is reflected by MAE, a machine tool corresponds to multiple MAEs.Figure 1
The MAE information model.


## 3. Optimal Machine Tools Selection Method Based on Interval-Valued Data FCM Algorithm

The optimal selection method proposed in this paper is based on MAE library; the establishment of MAE library needs to summarize the manufacturing features of enterprise’s production parts and analyze the machining information of each feature. The machine tools selection process can be divided into preselection phase and optimal selection phase, as shown in Figure2. In preselection phase, we query the MAEs from MAE library in accordance with the manufacturing process requirements. In optimal selection phase, firstly, using interval-valued data FCM algorithm, we quantitatively analyze the machining capacity similarity of MAEs which were queried in preselection phase and cluster the MAEs into different groups. Secondly, through calculating the matching degree between process constraints and MAEs, we can get the most appropriate MAEs for the process and, finally, get the most appropriate machine tools according to the responding relationship between MAEs and machine tools.Figure 2
The machine tool selection process.In preselection phase, considering that BasProperty is nonnumerical, in order to maximum eliminate differences due to inconsistent name and description and insure the accuracy of the matching results, we code BasProperty using parts coding methods as MAEs’ ID. Parts coding systems (such as OPTIZ system and KK-3 systems) commonly have a longer code digits [22]; the MAEs coding can simply select part of the codes based on BasProperty.In optimal selection phase, the MAEs selected in preselection phase is further optimized based on the matching degree of MAEs capacity and manufacturing process requirements; this process needs to solve two problems.(
1
) How to quantify the similarity of different MAEs machining capacities? (
2
) How to define and calculate the matching degree between manufacturing process requirements and MAEs? Therefore, we focus on the two problems solving method in the following subsection.


### 3.1. Analysis on MAEs Similarity

In order to quantitatively analyze the machining capacity similarity of MAEs, we build feature space based on EleCapacity. Due to the fact that parts of the EleCapacity elements are interval-valued data (such as machinable part length: 250 mm~800 mm and machinable part diameter: 50 mm~120 mm), traditional FCM algorithm cannot process such feature space. Therefore, we adopt the distance measure method of interval-valued data proposed by Yu and Fan [23] to calculate fuzzy membership degree of different MAEs and expand the FCM algorithm.Definition 4.
LetR be real number field, for all a
_
,
a
-
∈
R, a
_
≤
a
-, closed interval data a
=
[
a
_
,
a
-
]
=
{
x
∣
x
∈
R
,
a
_
≤
x
≤
a
-
}
=
{
x
∣
x
=
(
1
-
λ
)
a
_
+
λ
a
-
,
λ
∈
[
0,1
]
} is called interval-valued data.Definition 5.
Leta
=
[
a
_
,
a
-
], b
=
[
b
_
,
b
-
]
∈
I
(
R
), p
≥
1, x
,
y
∈
[
0,1
], and a
x
=
(
1
-
x
)
a
_
+
x
a
-, b
y
=
(
1
-
y
)
b
_
+
y
b
-, respectively, be the true value of a and b. Considering the difference value of each point in a and b, we define the distance of a and b as follows:
(1)
d
(
a
,
b
)
=
(
∬
0
1
|
a
x
-
b
y
|
p
d
x
d
y
)
1
/
p
=
(
∬
0
1
∑
j
=
1
n
|
[
(
1
-
x
)
X
k
j
_
+
x
X
k
j
¯
]
iiiiiiiiiiiiiiiiiii
-
[
(
1
-
y
)
V
i
j
_
+
y
V
i
j
¯
]
|
P
d
x
d
y
∑
j
=
1
n
|
[
(
1
-
x
)
X
k
j
_
+
x
X
k
j
¯
]
)
1
/
p
.According to Definition5, d
(
a
,
b
)
≥
0; if d
(
a
,
b
)
=
0, then x
=
y, d
(
a
,
b
)
=
d
(
b
,
a
), one can obtain d
(
a
,
b
) from Minkowski integral inequality
(2)
d
(
a
,
b
)
=
(
∬
0
1
|
a
x
-
b
y
|
p
d
x
d
y
)
1
/
p
=
(
∬
0
1
|
(
a
x
-
c
z
)
+
(
c
z
-
b
y
)
|
P
d
x
d
y
)
1
/
p
≤
(
∬
0
1
|
(
a
x
-
c
z
)
|
P
d
x
d
z
)
1
/
p
+
(
∬
0
1
|
(
c
z
-
b
y
)
|
P
d
z
d
y
)
1
/
p
=
d
(
a
,
c
)
+
d
(
c
,
b
)
,
where c
=
[
c
_
,
c
-
]
∈
I
(
R
), for all z
∈
[
0,1
], let c
y
=
(
1
-
z
)
c
_
+
z
c
- be the true value of c. One can also define the distance of interval vectors as follows.Definition 6.
Let interval vectorsA
=
[
a
1
,
a
2
,
…
,
a
j
,
…
,
a
n
] and B
=
[
b
1
,
b
2
,
…
,
b
j
,
…
,
b
n
], where a
j
,
b
j
∈
I
(
R
), the distance of A and B can be defined as
(3)
d
(
A
,
B
)
=
(
∬
0
1
∑
j
=
1
n
|
a
j
-
b
j
|
P
d
x
d
y
)
1
/
p
=
(
∬
0
1
∑
j
=
1
n
|
[
(
1
-
x
)
a
j
_
+
x
a
j
¯
]
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
-
[
(
1
-
y
)
b
j
_
+
y
b
j
¯
]
|
P
d
x
d
y
∑
j
=
1
n
|
[
(
1
-
x
)
a
j
_
+
x
a
j
¯
]
)
1
/
p
.
Let feature space beMAE
=
{
mae
1
,
…
,
mae
k
,
…
,
mae
N
}, where mae
k
=
(
mae
k
1
,
…
,
mae
k
j
,
…
,
mae
k
n
)
∈
I
(
R
)
n, k
=
1,2
,
…
,
N; n is the number of machining capacity parameters; c is the predefined number of clusters.
The cluster centers matrix isV
T
=
(
V
1
,
…
,
V
i
,
…
,
V
c
), where V
i
=
(
V
i
1
,
…
,
V
i
j
,
…
,
V
i
n
)
∈
I
(
R
)
n, i
=
1,2
,
…
,
c.So one can get fuzzyc division of interval-valued data as follows:
(4)
F
c
=
{
∑
k
=
1
N
μ
i
k
U
c
×
N
=
(
μ
i
k
)
c
×
N
∈
M
c
×
N
∣
μ
i
k
∈
[
0,1
]
,
∀
i
,
k
;
i
i
i
i
i
∑
i
=
1
c
μ
i
k
=
1
,
∀
k
;
0
<
∑
k
=
1
N
μ
i
k
<
N
,
∀
i
}
,
where i
=
1,2
,
…
,
c, k
=
1,2
,
…
,
N, M
c
×
N is c
×
N order matrix set; μ
i
k is the membership of the V
i cluster; ∑
i
=
1
c
μ
i
k
=
1, for all k indicates that the sum of membership is 1; 0
<
∑
k
=
1
N
μ
i
k
<
N, for all i indicates that each subset is nonempty, neither is universal set X. 0
≤
∑
k
=
1
N
μ
i
k
≤
N, for all i indicates that empty set and universal set both are allowed; such division space is called degenerate fuzzy c partition space. In cluster analysis, if we can get the optimal division matrix (
U
c
×
N
=
(
μ
i
k
)
c
×
N
) of the specified data set, then the corresponding clusters are the optimal classifications under the specified condition.The interval-valued data FCM algorithm attempts to minimize the objective function by organizing the data into different clusters. The objective function is as follows:(5)
J
m
(
MAE
,
V
,
c
)
=
∑
k
=
1
N
∑
i
=
1
c
μ
i
k
m
d
i
k
p
(
1
≤
m
≤
N
)
,
where N is the number of data, c is the cluster number, and i
=
1,2
,
…
,
c, k
=
1,2
,
…
,
N.We can getd
i
k as follows:
(6)
d
i
k
=
d
i
k
(
MAE
k
,
V
i
)
=
(
∬
0
1
∑
j
=
1
n
|
[
(
1
-
x
)
MAE
k
j
_
+
x
MAE
k
j
¯
]
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
-
[
(
1
-
y
)
V
i
j
_
+
y
V
i
j
¯
]
|
P
d
x
d
y
∬
0
1
∑
j
=
1
n
|
[
(
1
-
x
)
MAE
k
j
_
+
x
MAE
k
j
¯
]
)
1
/
p
,
considering d
i
k
≥
0 and ∑
j
=
1
n
|
[
(
1
-
x
)
MAE
k
j
_
+
x
MAE
k
j
¯
]
-
[
(
1
-
y
)
V
i
j
_
+
y
V
i
j
¯
]
|
P
≥
0, let p
=
2, (5) is converted to
(7)
J
m
(
MAE
,
V
,
c
)
=
∑
k
=
1
N
∑
i
=
1
c
μ
i
k
m
∬
0
1
∑
j
=
1
n
|
[
(
1
-
x
)
MAE
k
j
_
+
x
MAE
k
j
¯
]
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
-
[
(
1
-
y
)
V
i
j
_
+
y
V
i
j
¯
]
|
2
d
x
d
y
.We can get the iterative solution of (7) as follows:
(8)
μ
i
k
=
(
[
∑
j
=
1
n
1
/
m
-
1
∑
i
=
1
c
[
(
∑
j
=
1
n
∬
0
1
∑
j
=
1
n
|
[
(
1
-
x
)
MA
E
k
j
_
+
x
MA
E
k
j
¯
]
iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii
-
[
(
1
-
y
)
V
i
j
_
+
y
V
i
j
¯
]
|
2
d
x
d
y
∑
j
=
1
n
|
[
(
1
-
x
)
M
A
E
k
j
_
+
x
M
A
E
k
j
¯
]
)
iiiiiiiiiiiii
×
(
∑
j
=
1
n
|
[
(
1
-
x
)
M
A
E
k
j
_
+
x
M
A
E
k
j
¯
]
∬
0
1
∑
j
=
1
n
|
[
(
1
-
x
)
MA
E
k
j
_
+
x
MA
E
k
j
¯
]
iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii
-
[
(
1
-
y
)
V
i
′
j
_
iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii
+
y
V
i
′
j
¯
]
|
2
d
x
d
y
∑
j
=
1
n
|
[
(
1
-
x
)
M
A
E
k
j
_
+
x
M
A
E
k
j
¯
]
)
-
1
∑
j
=
1
n
]
1
/
m
-
1
∑
j
=
1
n
)
-
1
,
where
(9)
V
i
j
_
=
V
i
j
¯
=
[
∑
k
=
1
N
μ
i
k
m
(
MAE
k
j
_
+
MAE
k
j
¯
)
]
[
2
∑
k
=
1
N
μ
i
k
m
]
.The selection method of cluster numberc refers to reference [24], this paper does not discuss in detail. The FCM algorithm is a kind of local search algorithm [25, 26]; in order to prevent the results converge to local optimal solution, we need to choose the reasonable initial cluster centers. This paper chooses cluster centers using an improved min-max distance algorithm proposed in reference [27]. The interval-valued data FCM algorithm can be implemented as follows.Step 1.
Set the predefined number of clustersc, where 2
≤
c
≤
n, n is the number of MAEs.Step 2.
Calculate two MAEs distanced
(
mae
j
1
,
mae
j
2
), j
1
,
j
2
=
1,2
,
…
,
n. Select the maximum distance of two MAEs which can be expressed as mae
p
1 and mae
p
2. Make mae
p
1 and mae
p
2 as the cluster center; d
(
mae
p
1
,
mae
p
2
)
=
max
⁡
1
≤
j
1
,
j
2
≤
n
⁡
d
(
mae
j
1
,
mae
j
1
), where r
=
2.Step 3.
Ifc
=
2, then go to Step 5, else, calculate the distance of other machining capacity meta mae
j and cluster center mae
p
h which is expressed as d
(
mae
j
,
mae
p
h
), j
=
1
,
…
,
n and mae
j
∉
{
mae
p
1
,
…
,
mae
p
r
}, h
=
1
,
…
,
r.
Ifd
(
mae
p
r
+
1
,
mae
p
)
=
max
⁡
{
min
⁡
1
≤
h
≤
r
⁡
d
(
mae
j
,
mae
p
h
)
∣
j
=
1
,
…
,
n
} and mae
p
∈
{
mae
p
1
,
…
,
mae
p
r
}, then mae
p
r
+
1 is the (
r
+
1
)th cluster center; update r
=
r
+
1.Step 4.
Ifr
=
c, then go to Step 5; otherwise go to Step 3.Step 5.
Calculated
(
mae
j
,
mae
p
)
=
min
⁡
1
≤
h
≤
r
d
(
mae
j
,
mae
p
h
) and classify each MAE based on minimum distance principle. If j
=
1,2
,
…
,
n, then put mae
j in the group of mae
p.Step 6.
Calculate the cluster center of each group. Consider:(10)
v
0
i
=
(
v
03
i
,
v
04
i
,
…
,
v
0
N
i
)
,
v
0
K
i
=
[
v
0
K
i
_
,
v
0
K
i
¯
]
,
v
0
K
i
_
=
1
N
i
∑
MAE
j
∈
G
i
A
k
j
_
,
v
0
K
i
¯
=
1
N
i
∑
MAE
j
∈
G
i
A
k
j
¯
,
where i
=
1,2
,
…
,
c; k
=
3,4
,
…
,
N; j
=
1,2
,
…
,
n; N
i is the number of MAEs in the i
th group, and G
i is the i
th group; V
0
=
(
v
01
,
v
02
,
…
,
v
0
c
) is the initial cluster center.Step 7.
Standardize the feature space by (11) as follows:
(11)
A
k
j
_
′
=
A
k
j
_
-
(
A
k
)
min
⁡
(
A
k
)
max
⁡
-
(
A
k
)
min
⁡
,
A
k
j
¯
′
=
A
k
j
¯
-
(
A
k
)
min
⁡
(
A
k
)
max
⁡
-
(
A
k
)
min
⁡
,
where (
A
k
)
max
⁡
=
min
⁡
1
≤
j
≤
n
⁡
{
A
k
j
¯
}, (
A
k
)
min
⁡
=
min
⁡
1
≤
j
≤
n
⁡
{
A
k
j
_
}, and k
=
3,4
,
…
,
N.
For example set parametersA
1
1
=
[
200,600
], A
1
2
=
[
750,1000
], and A
1
3
=
[
1500,2000
], and then we can get (
A
1
)
max
⁡
=
2000, (
A
1
)
min
⁡
=
200, and (
A
1
)
max
⁡
-
(
A
1
)
min
⁡
=
2000
-
200
=
1800. According to (11) the calculated result of standardized process is A
1
1
′
=
[
0,0.2222
], A
1
2
′
=
[
0.3056,0.4444
], and A
1
3
′
=
[
0.7222,1
].Step 8.
Determine the terminative precisionε, set iterative count number b
=
0.Step 9.
Calculate the membershipμ
i
j
(
b
)
(
i
=
1,2
,
…
,
c
;
j
=
1,2
,
…
,
n
) by (8).Step 10.
Update each group centerV
i
j
_ and V
i
j
¯ by (9).Step 11.
If|
J
m
(
b
+
1
)
-
J
m
(
b
)
|
<
ε, then algorithm ends, and we can get cluster center matrix V
* and fuzzy division matrix U
*; if |
J
m
(
b
+
1
)
-
J
m
(
b
)
|
≥
ε, set b
=
b
+
1 and go to Step 9 till the iteration is over.Fuzzy division matrixU
* calculated by FCM algorithm corresponds to the fuzzy division of MAEs. We can make the division more clearly and get general division under two principles as follows.(1)
The principle of minimum distance, which can be elaborated as follows: ifd
i
0
k
(
MAE
k
-
V
i
0
)
=
min
⁡
1
≤
i
≤
c
⁡
d
i
k
(
MAE
k
-
V
i
), then put MAE
k in the i
0th group.
(2)
The principle of maximum membership, which can be elaborated as follows: in thekth column of U
*, if μ
i
k
=
max
⁡
1
≤
i
≤
c
⁡
(
μ
i
k
), then put MAE
k in the i
0th group.


### 3.2. Matching Degree of Manufacturing Process Requirements and MAEs

In order to accurately describe the matching degree of manufacturing process requirements and MAEs, this paper defines the concept of EleCapacity matching degree as follows.Definition 7.
EleCapacity matching degree (EMD) reflects the suitability of EleCapacity for manufacturing process requirements. The suitability means that the EleCapacity being either lower or much higher than manufacturing process requirements is inappropriate, which will reduce the matching degree.The EMD is calculated based on the cluster groups of MAEs. The EleCapacity constraints can be extracted in accordance with manufacturing process requirements. For rotational part, theEleCapacity constraints can be expressed as R
=
{
D
,
L
,
P
A
,
P
R
}, where D is the outer diameter size range of machining feature, L is the length size range of machining feature, P
A is machining accuracy requirements, and P
R is surface roughness requirements. The distance between R and cluster centers V reflects the matching degree of manufacturing process requirements and MAEs, so according to Definition 7 the computational formula of EMD is
(12)
EMD
=
d
(
R
,
V
)
=
(
∬
0
1
∑
i
=
1
c
∑
j
=
1
m
|
r
j
-
v
i
j
|
2
d
x
d
y
)
1
/
2
=
(
∬
0
1
∑
i
=
1
c
∑
j
=
1
m
|
[
(
1
-
x
)
r
j
_
+
x
r
j
¯
]
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
-
[
(
1
-
y
)
v
i
j
_
+
y
v
i
j
¯
]
|
2
d
x
d
y
∬
0
1
∑
i
=
1
c
∑
j
=
1
m
|
[
(
1
-
x
)
r
j
_
+
x
r
j
¯
]
)
1
/
2
,
where c is the number of clusters, m is the number of EleCapacity elements, r
j is thejth standardized element of EleCapacity process constraints, and v
i
j is the cluster center of the ith group and thejth element.According to the minimum distance principle described in Section3.1, if EMD
=
min
⁡
1
≤
i
≤
c
⁡
d
i
(
R
-
V
i
), then the ith group is the most appropriate MAEs set to meet manufacturing process requirements.


## 3.1. Analysis on MAEs Similarity

In order to quantitatively analyze the machining capacity similarity of MAEs, we build feature space based on EleCapacity. Due to the fact that parts of the EleCapacity elements are interval-valued data (such as machinable part length: 250 mm~800 mm and machinable part diameter: 50 mm~120 mm), traditional FCM algorithm cannot process such feature space. Therefore, we adopt the distance measure method of interval-valued data proposed by Yu and Fan [23] to calculate fuzzy membership degree of different MAEs and expand the FCM algorithm.Definition 4.
LetR be real number field, for all a
_
,
a
-
∈
R, a
_
≤
a
-, closed interval data a
=
[
a
_
,
a
-
]
=
{
x
∣
x
∈
R
,
a
_
≤
x
≤
a
-
}
=
{
x
∣
x
=
(
1
-
λ
)
a
_
+
λ
a
-
,
λ
∈
[
0,1
]
} is called interval-valued data.Definition 5.
Leta
=
[
a
_
,
a
-
], b
=
[
b
_
,
b
-
]
∈
I
(
R
), p
≥
1, x
,
y
∈
[
0,1
], and a
x
=
(
1
-
x
)
a
_
+
x
a
-, b
y
=
(
1
-
y
)
b
_
+
y
b
-, respectively, be the true value of a and b. Considering the difference value of each point in a and b, we define the distance of a and b as follows:
(1)
d
(
a
,
b
)
=
(
∬
0
1
|
a
x
-
b
y
|
p
d
x
d
y
)
1
/
p
=
(
∬
0
1
∑
j
=
1
n
|
[
(
1
-
x
)
X
k
j
_
+
x
X
k
j
¯
]
iiiiiiiiiiiiiiiiiii
-
[
(
1
-
y
)
V
i
j
_
+
y
V
i
j
¯
]
|
P
d
x
d
y
∑
j
=
1
n
|
[
(
1
-
x
)
X
k
j
_
+
x
X
k
j
¯
]
)
1
/
p
.According to Definition5, d
(
a
,
b
)
≥
0; if d
(
a
,
b
)
=
0, then x
=
y, d
(
a
,
b
)
=
d
(
b
,
a
), one can obtain d
(
a
,
b
) from Minkowski integral inequality
(2)
d
(
a
,
b
)
=
(
∬
0
1
|
a
x
-
b
y
|
p
d
x
d
y
)
1
/
p
=
(
∬
0
1
|
(
a
x
-
c
z
)
+
(
c
z
-
b
y
)
|
P
d
x
d
y
)
1
/
p
≤
(
∬
0
1
|
(
a
x
-
c
z
)
|
P
d
x
d
z
)
1
/
p
+
(
∬
0
1
|
(
c
z
-
b
y
)
|
P
d
z
d
y
)
1
/
p
=
d
(
a
,
c
)
+
d
(
c
,
b
)
,
where c
=
[
c
_
,
c
-
]
∈
I
(
R
), for all z
∈
[
0,1
], let c
y
=
(
1
-
z
)
c
_
+
z
c
- be the true value of c. One can also define the distance of interval vectors as follows.Definition 6.
Let interval vectorsA
=
[
a
1
,
a
2
,
…
,
a
j
,
…
,
a
n
] and B
=
[
b
1
,
b
2
,
…
,
b
j
,
…
,
b
n
], where a
j
,
b
j
∈
I
(
R
), the distance of A and B can be defined as
(3)
d
(
A
,
B
)
=
(
∬
0
1
∑
j
=
1
n
|
a
j
-
b
j
|
P
d
x
d
y
)
1
/
p
=
(
∬
0
1
∑
j
=
1
n
|
[
(
1
-
x
)
a
j
_
+
x
a
j
¯
]
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
-
[
(
1
-
y
)
b
j
_
+
y
b
j
¯
]
|
P
d
x
d
y
∑
j
=
1
n
|
[
(
1
-
x
)
a
j
_
+
x
a
j
¯
]
)
1
/
p
.
Let feature space beMAE
=
{
mae
1
,
…
,
mae
k
,
…
,
mae
N
}, where mae
k
=
(
mae
k
1
,
…
,
mae
k
j
,
…
,
mae
k
n
)
∈
I
(
R
)
n, k
=
1,2
,
…
,
N; n is the number of machining capacity parameters; c is the predefined number of clusters.
The cluster centers matrix isV
T
=
(
V
1
,
…
,
V
i
,
…
,
V
c
), where V
i
=
(
V
i
1
,
…
,
V
i
j
,
…
,
V
i
n
)
∈
I
(
R
)
n, i
=
1,2
,
…
,
c.So one can get fuzzyc division of interval-valued data as follows:
(4)
F
c
=
{
∑
k
=
1
N
μ
i
k
U
c
×
N
=
(
μ
i
k
)
c
×
N
∈
M
c
×
N
∣
μ
i
k
∈
[
0,1
]
,
∀
i
,
k
;
i
i
i
i
i
∑
i
=
1
c
μ
i
k
=
1
,
∀
k
;
0
<
∑
k
=
1
N
μ
i
k
<
N
,
∀
i
}
,
where i
=
1,2
,
…
,
c, k
=
1,2
,
…
,
N, M
c
×
N is c
×
N order matrix set; μ
i
k is the membership of the V
i cluster; ∑
i
=
1
c
μ
i
k
=
1, for all k indicates that the sum of membership is 1; 0
<
∑
k
=
1
N
μ
i
k
<
N, for all i indicates that each subset is nonempty, neither is universal set X. 0
≤
∑
k
=
1
N
μ
i
k
≤
N, for all i indicates that empty set and universal set both are allowed; such division space is called degenerate fuzzy c partition space. In cluster analysis, if we can get the optimal division matrix (
U
c
×
N
=
(
μ
i
k
)
c
×
N
) of the specified data set, then the corresponding clusters are the optimal classifications under the specified condition.The interval-valued data FCM algorithm attempts to minimize the objective function by organizing the data into different clusters. The objective function is as follows:(5)
J
m
(
MAE
,
V
,
c
)
=
∑
k
=
1
N
∑
i
=
1
c
μ
i
k
m
d
i
k
p
(
1
≤
m
≤
N
)
,
where N is the number of data, c is the cluster number, and i
=
1,2
,
…
,
c, k
=
1,2
,
…
,
N.We can getd
i
k as follows:
(6)
d
i
k
=
d
i
k
(
MAE
k
,
V
i
)
=
(
∬
0
1
∑
j
=
1
n
|
[
(
1
-
x
)
MAE
k
j
_
+
x
MAE
k
j
¯
]
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
-
[
(
1
-
y
)
V
i
j
_
+
y
V
i
j
¯
]
|
P
d
x
d
y
∬
0
1
∑
j
=
1
n
|
[
(
1
-
x
)
MAE
k
j
_
+
x
MAE
k
j
¯
]
)
1
/
p
,
considering d
i
k
≥
0 and ∑
j
=
1
n
|
[
(
1
-
x
)
MAE
k
j
_
+
x
MAE
k
j
¯
]
-
[
(
1
-
y
)
V
i
j
_
+
y
V
i
j
¯
]
|
P
≥
0, let p
=
2, (5) is converted to
(7)
J
m
(
MAE
,
V
,
c
)
=
∑
k
=
1
N
∑
i
=
1
c
μ
i
k
m
∬
0
1
∑
j
=
1
n
|
[
(
1
-
x
)
MAE
k
j
_
+
x
MAE
k
j
¯
]
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
-
[
(
1
-
y
)
V
i
j
_
+
y
V
i
j
¯
]
|
2
d
x
d
y
.We can get the iterative solution of (7) as follows:
(8)
μ
i
k
=
(
[
∑
j
=
1
n
1
/
m
-
1
∑
i
=
1
c
[
(
∑
j
=
1
n
∬
0
1
∑
j
=
1
n
|
[
(
1
-
x
)
MA
E
k
j
_
+
x
MA
E
k
j
¯
]
iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii
-
[
(
1
-
y
)
V
i
j
_
+
y
V
i
j
¯
]
|
2
d
x
d
y
∑
j
=
1
n
|
[
(
1
-
x
)
M
A
E
k
j
_
+
x
M
A
E
k
j
¯
]
)
iiiiiiiiiiiii
×
(
∑
j
=
1
n
|
[
(
1
-
x
)
M
A
E
k
j
_
+
x
M
A
E
k
j
¯
]
∬
0
1
∑
j
=
1
n
|
[
(
1
-
x
)
MA
E
k
j
_
+
x
MA
E
k
j
¯
]
iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii
-
[
(
1
-
y
)
V
i
′
j
_
iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii
+
y
V
i
′
j
¯
]
|
2
d
x
d
y
∑
j
=
1
n
|
[
(
1
-
x
)
M
A
E
k
j
_
+
x
M
A
E
k
j
¯
]
)
-
1
∑
j
=
1
n
]
1
/
m
-
1
∑
j
=
1
n
)
-
1
,
where
(9)
V
i
j
_
=
V
i
j
¯
=
[
∑
k
=
1
N
μ
i
k
m
(
MAE
k
j
_
+
MAE
k
j
¯
)
]
[
2
∑
k
=
1
N
μ
i
k
m
]
.The selection method of cluster numberc refers to reference [24], this paper does not discuss in detail. The FCM algorithm is a kind of local search algorithm [25, 26]; in order to prevent the results converge to local optimal solution, we need to choose the reasonable initial cluster centers. This paper chooses cluster centers using an improved min-max distance algorithm proposed in reference [27]. The interval-valued data FCM algorithm can be implemented as follows.Step 1.
Set the predefined number of clustersc, where 2
≤
c
≤
n, n is the number of MAEs.Step 2.
Calculate two MAEs distanced
(
mae
j
1
,
mae
j
2
), j
1
,
j
2
=
1,2
,
…
,
n. Select the maximum distance of two MAEs which can be expressed as mae
p
1 and mae
p
2. Make mae
p
1 and mae
p
2 as the cluster center; d
(
mae
p
1
,
mae
p
2
)
=
max
⁡
1
≤
j
1
,
j
2
≤
n
⁡
d
(
mae
j
1
,
mae
j
1
), where r
=
2.Step 3.
Ifc
=
2, then go to Step 5, else, calculate the distance of other machining capacity meta mae
j and cluster center mae
p
h which is expressed as d
(
mae
j
,
mae
p
h
), j
=
1
,
…
,
n and mae
j
∉
{
mae
p
1
,
…
,
mae
p
r
}, h
=
1
,
…
,
r.
Ifd
(
mae
p
r
+
1
,
mae
p
)
=
max
⁡
{
min
⁡
1
≤
h
≤
r
⁡
d
(
mae
j
,
mae
p
h
)
∣
j
=
1
,
…
,
n
} and mae
p
∈
{
mae
p
1
,
…
,
mae
p
r
}, then mae
p
r
+
1 is the (
r
+
1
)th cluster center; update r
=
r
+
1.Step 4.
Ifr
=
c, then go to Step 5; otherwise go to Step 3.Step 5.
Calculated
(
mae
j
,
mae
p
)
=
min
⁡
1
≤
h
≤
r
d
(
mae
j
,
mae
p
h
) and classify each MAE based on minimum distance principle. If j
=
1,2
,
…
,
n, then put mae
j in the group of mae
p.Step 6.
Calculate the cluster center of each group. Consider:(10)
v
0
i
=
(
v
03
i
,
v
04
i
,
…
,
v
0
N
i
)
,
v
0
K
i
=
[
v
0
K
i
_
,
v
0
K
i
¯
]
,
v
0
K
i
_
=
1
N
i
∑
MAE
j
∈
G
i
A
k
j
_
,
v
0
K
i
¯
=
1
N
i
∑
MAE
j
∈
G
i
A
k
j
¯
,
where i
=
1,2
,
…
,
c; k
=
3,4
,
…
,
N; j
=
1,2
,
…
,
n; N
i is the number of MAEs in the i
th group, and G
i is the i
th group; V
0
=
(
v
01
,
v
02
,
…
,
v
0
c
) is the initial cluster center.Step 7.
Standardize the feature space by (11) as follows:
(11)
A
k
j
_
′
=
A
k
j
_
-
(
A
k
)
min
⁡
(
A
k
)
max
⁡
-
(
A
k
)
min
⁡
,
A
k
j
¯
′
=
A
k
j
¯
-
(
A
k
)
min
⁡
(
A
k
)
max
⁡
-
(
A
k
)
min
⁡
,
where (
A
k
)
max
⁡
=
min
⁡
1
≤
j
≤
n
⁡
{
A
k
j
¯
}, (
A
k
)
min
⁡
=
min
⁡
1
≤
j
≤
n
⁡
{
A
k
j
_
}, and k
=
3,4
,
…
,
N.
For example set parametersA
1
1
=
[
200,600
], A
1
2
=
[
750,1000
], and A
1
3
=
[
1500,2000
], and then we can get (
A
1
)
max
⁡
=
2000, (
A
1
)
min
⁡
=
200, and (
A
1
)
max
⁡
-
(
A
1
)
min
⁡
=
2000
-
200
=
1800. According to (11) the calculated result of standardized process is A
1
1
′
=
[
0,0.2222
], A
1
2
′
=
[
0.3056,0.4444
], and A
1
3
′
=
[
0.7222,1
].Step 8.
Determine the terminative precisionε, set iterative count number b
=
0.Step 9.
Calculate the membershipμ
i
j
(
b
)
(
i
=
1,2
,
…
,
c
;
j
=
1,2
,
…
,
n
) by (8).Step 10.
Update each group centerV
i
j
_ and V
i
j
¯ by (9).Step 11.
If|
J
m
(
b
+
1
)
-
J
m
(
b
)
|
<
ε, then algorithm ends, and we can get cluster center matrix V
* and fuzzy division matrix U
*; if |
J
m
(
b
+
1
)
-
J
m
(
b
)
|
≥
ε, set b
=
b
+
1 and go to Step 9 till the iteration is over.Fuzzy division matrixU
* calculated by FCM algorithm corresponds to the fuzzy division of MAEs. We can make the division more clearly and get general division under two principles as follows.(1)
The principle of minimum distance, which can be elaborated as follows: ifd
i
0
k
(
MAE
k
-
V
i
0
)
=
min
⁡
1
≤
i
≤
c
⁡
d
i
k
(
MAE
k
-
V
i
), then put MAE
k in the i
0th group.
(2)
The principle of maximum membership, which can be elaborated as follows: in thekth column of U
*, if μ
i
k
=
max
⁡
1
≤
i
≤
c
⁡
(
μ
i
k
), then put MAE
k in the i
0th group.


## 3.2. Matching Degree of Manufacturing Process Requirements and MAEs

In order to accurately describe the matching degree of manufacturing process requirements and MAEs, this paper defines the concept of EleCapacity matching degree as follows.Definition 7.
EleCapacity matching degree (EMD) reflects the suitability of EleCapacity for manufacturing process requirements. The suitability means that the EleCapacity being either lower or much higher than manufacturing process requirements is inappropriate, which will reduce the matching degree.The EMD is calculated based on the cluster groups of MAEs. The EleCapacity constraints can be extracted in accordance with manufacturing process requirements. For rotational part, theEleCapacity constraints can be expressed as R
=
{
D
,
L
,
P
A
,
P
R
}, where D is the outer diameter size range of machining feature, L is the length size range of machining feature, P
A is machining accuracy requirements, and P
R is surface roughness requirements. The distance between R and cluster centers V reflects the matching degree of manufacturing process requirements and MAEs, so according to Definition 7 the computational formula of EMD is
(12)
EMD
=
d
(
R
,
V
)
=
(
∬
0
1
∑
i
=
1
c
∑
j
=
1
m
|
r
j
-
v
i
j
|
2
d
x
d
y
)
1
/
2
=
(
∬
0
1
∑
i
=
1
c
∑
j
=
1
m
|
[
(
1
-
x
)
r
j
_
+
x
r
j
¯
]
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
i
-
[
(
1
-
y
)
v
i
j
_
+
y
v
i
j
¯
]
|
2
d
x
d
y
∬
0
1
∑
i
=
1
c
∑
j
=
1
m
|
[
(
1
-
x
)
r
j
_
+
x
r
j
¯
]
)
1
/
2
,
where c is the number of clusters, m is the number of EleCapacity elements, r
j is thejth standardized element of EleCapacity process constraints, and v
i
j is the cluster center of the ith group and thejth element.According to the minimum distance principle described in Section3.1, if EMD
=
min
⁡
1
≤
i
≤
c
⁡
d
i
(
R
-
V
i
), then the ith group is the most appropriate MAEs set to meet manufacturing process requirements.


## 4. Case Study

In this case, we choose a machining example of exhaust duct part of the aeroengine to validate the proposed method in this paper. As shown in Figure3, after the processes of rough turning exterior surface, rough turning interior surface, turning end face, fine turning exterior surface, fine turning interior surface, and drilling, the forging blank is processed into the exhaust duct part. We choose the process of rough turning exterior surface as verification process and select machine tools for this process using the proposed method.Figure 3
The machining process of the exhaust duct part.We summarize the verification process technological requirements as shown in Table1 and adopt OPTIZ system to encode the part, coding results, and the meaning of each code digit as shown in Figure 4. We select the first five digits and the 7th digit of this part codes to compose MAE’s ID; according to Table 1 and OPTIZ system encoding rules, the MAE codes in conformity with the validation process is 0
*
*
302 (* is random number).Table 1
The verification process technological requirements.
Property
Parameter
Machining method
Turning
Machining material
40CrNiMo
Part type
Wheel
Feature type
Cylindrical surface
Maximum diameter of part (mm)
550
Maximum length of part (mm)
150
Outer diameter of feature (mm)
500
Length of feature (mm)
100
Machining accuracy (μm)
20
Surface roughness (μm)
1.6Figure 4
Codes information of part.Through the matching query in preselection phase, there are 10 MAEs that meet the validation process requirements; the parameters of these MAEs and the corresponding machine tools are presented in Tables2 and 3.Table 2
Parameters of MAEs and corresponding machines tools.
MAE
MAE codes
FD (mm)
FL (mm)
MA (μm)
MR (μm)
Machine tools
mae1
001302
[
250
,
800
]
[
85
,
250
]
[
-
10,10
]
1
m
1
,
m
2
,
m
3
mae2
011302
[
440
,
800
]
[
85
,
250
]
[
-
10,10
]
0.8
m
4
mae3
010302
[
440
,
1000
]
[
120
,
360
]
[
-
20,20
]
1.6
m
5
,
m
6
mae4
002302
[
300
,
1000
]
[
100
,
300
]
[
-
15,15
]
1.6
m
7
,
m
8
mae5
013302
[
250
,
850
]
[
50
,
400
]
[
-
2,2
]
0.4
m
9
mae6
023302
[
400
,
1600
]
[
100
,
500
]
[
-
15,15
]
1.6
m
10
,
m
11
mae7
021302
[
250
,
1000
]
[
50
,
460
]
[
-
5,5
]
0.8
m
12
,
m
13
,
m
14
mae8
022302
[
160
,
600
]
[
46
,
250
]
[
-
5,5
]
1.0
m
15
mae9
012302
[
240
,
600
]
[
46
,
250
]
[
-
2,2
]
0.8
m
16
,
m
17
mae10
020302
[
500
,
1420
]
[
100
,
400
]
[
-
2,2
]
0.6
m
18Table 3
The machine tools capacity information.
Machine tool code
Machine tool name
Part type
Feature type
Outer diameter of feature (mm)
Length of part (mm)
Machining accuracy (μm)
Surface roughness (Ra)
m
1
Horizontal CNC lathe 1
Wheel
Cylindrical surface
250~800
85~250
±10
1
m
2
Horizontal lathe
Wheel
Cylindrical surface
250~800
85~250
±10
1
m
3
Horizontal CNC lathe 2
Wheel
Cylindrical surface
250~800
85~250
±10
1
m
4
The ground horizontal lathe1
Wheel
Cylindrical surface
440~800
85~250
±10
0.8
m
5
Vertical lathe 1
Wheel
Cylindrical surface
440~1000
120~360
±20
1.6
m
6
Single pole vertical lathe
Wheel
Cylindrical surface
440~1000
120~360
±20
1.6
m
7
Vertical lathe 2
Wheel
Cylindrical surface
300~1000
100~300
±15
1.6
m
8
Double poles vertical lathe
Wheel
Cylindrical surface
300~1000
100~300
±15
1.6
m
9
Ultrafine grinding machine 1
Wheel
Cylindrical surface
250~850
50~400
±2
0.4
m
10
Vertical CNC lathe 1
Wheel
Cylindrical surface
400~1600
100~500
±15
1.6
m
11
Vertical CNC lathe 2
Wheel
Cylindrical surface
400~1600
100~500
±15
1.6
m
12
NC external grinding machine
Wheel
Cylindrical surface
250~1000
50~460
±5
0.8
m
13
Vertical honing machine
Wheel
Cylindrical surface
250~1000
50~460
±5
0.8
m
14
Vertical grinder
Wheel
Cylindrical surface
250~1000
50~460
±5
0.8
m
15
Horizontal CNC lathe 3
Wheel
Cylindrical surface
160~600
46~250
±5
1.0
m
16
Horizontal CNC lathe 4
Wheel
Cylindrical surface
240~600
46~250
±2
0.8
m
17
The ground horizontal lathe 2
Wheel
Cylindrical surface
240~600
46~250
±2
0.8
m
18
Ultrafine grinding machine 2
Wheel
Cylindrical surface
500~1420
100~400
±2
0.6According to Table2 we establish feature space and cluster the 10 MAEs using interval-valued data FCM algorithm elaborated in Section 3.1. Let the predefined number of clusters c
=
3 and the terminative precision ε
=
1
0
-
5. Table 4 presents the selection result of the initial cluster center, after 5 iterations using MATLAB simulation; the final calculated results of cluster center and membership are presented in Tables 5 and 6.Table 4
The parameter values of initial cluster center.
Initial cluster center
P
3
P
4
P
5
P
6
P
7
v
01
[0.0781, 0.3750]
[0.0430, 0.4493]
[0.3312, 0.6687]
0.4167
1.0000
v
02
[0.1528, 0.7222]
[0.1336, 0.7504]
[0.0833, 0.9167]
1.0000
0.1667
v
03
[0.1204, 0.6458]
[0.0455, 0.8238]
[0.4250, 0.5750]
0.1667
0.0833Table 5
The parameter values of final cluster center.
Final cluster center
P
3
P
4
P
5
P
6
P
7
v
1
0.2277
0.2484
0.5
0.4187
0.9879
v
2
0.4248
0.4325
0.5
0.9775
0.1682
v
3
0.3878
0.4328
0.5
0.1775
0.08472Table 6
The membership of cluster center.
mae1
mae2
mae3
mae4
mae5
mae6
mae7
mae8
mae9
mae10
u
1
j
0.9083
0.9072
0.09448
0.06999
0.07946
0.1046
0.1016
0.9259
0.9426
0.07995
u
2
j
0.0461
0.04087
0.7838
0.8224
0.09171
0.7242
0.1748
0.0371
0.02529
0.1098
u
3
j
0.04563
0.05191
0.1217
0.1076
0.8288
0.1712
0.7236
0.03699
0.03211
0.8102We cluster these 10 MAEs in accordance with the maximum membership principle and cluster 18 machines tools as shown in Table2 based on the correspondence between MAEs and machines tools; the cluster results are shown in Table 7. We can build process constraint vector as R
=
(
[
500,550
]
,
[
100,150
]
,
[
-
0.02,0.02
]
,
1.6
) and calculate EMD using the method mentioned in Section 3.2: em
d
1
=
0.0924, em
d
2
=
0.1271, and em
d
3
=
0.2676. According to the minimum distance principle, the first machines tools set is the most appropriate for this process.Table 7
The cluster results of machines tools.
Group
MAE set
Machines tools set
1
mae1, mae2, mae8, mae9
m
1
,
m
2
,
m
3
,
m
4
,
m
15
,
m
16
,
m
17
2
mae3, mae4, mae6
m
5
,
m
6
,
m
7
,
m
8
,
m
10
,
m
11
3
mae5, mae7, mae10
m
9
,
m
12
,
m
13
,
m
14
,
m
18Combining Tables6 and 7 we can see that MAEs in the same group have a high degree of polymerization (Table 7 shows that the membership degree of MAEs in group 1 has reached more than 0.9); on the other hand, different groups have a high degree of dispersion, which can be reflected by the calculation results of membership degrees as shown in Table 6.In Table7, ma
e
7 and ma
e
8 have the same machining accuracy (the values of MA are equal), but they belong to different groups; it proves that the cluster results depend on the coupling effect of the whole machining capacity parameters, and not on being restricted by a single parameter.The algorithm has only 5 iteration times in computational experiment and can rapidly converge to the preset minimum value. Therefore, the computational efficiency of this algorithm is relatively high.


## 5. Conclusion

Because of the complexity and fuzziness of machine tools capacity, it is difficult to evaluate machine tools matching degree for manufacturing process. In this research, we define MAE to describe the machine tools capacity. Based on the MAE information model, we propose a machine tools optimal selection method using interval-valued data FCM clustering algorithm. Finally, we get the most appropriate machine tools by the EMD which reflects matching degree of machine tools and manufacturing process. Aiming at the interval-valued data in MAE model, we have expanded the traditional FCM algorithm.The results show that the proposed interval-valued data FCM clustering algorithm can cluster feature space, lessen impact of individual parameter on the clustering results, and ensure the objectivity of the clustering results. The optimal machine tools selection method proposed in this research can help technologists to choose the appropriate machine tools for manufacturing process in machining process planning.



---

*Source: 921647-2014-07-03.xml*