Академический Документы
Профессиональный Документы
Культура Документы
Department of Mechanical Engineering, Shanghai University of Engineering Science, Shanghai 201600 China
Department of Mechanical Engineering, Shanghai University of Engineering Science, Shanghai 201600 China
3
Department of Mechanical Engineering, Shanghai University of Engineering Science, Shanghai 201600 China
4
Department of Mechanical Engineering, Shanghai University of Engineering Science, Shanghai 201600 China
2
Abstract
The arrangement of the process sequence is one of the key technologies in CAPP system antomatically generating process
diagram, is the key whether the process design is reasonable or not, is also one of the difficulties in process design. To solve this
problem, this paper proposes using genetic algorithms to optimize process sequence based on process constraints and uses a
housing part to vertify.The result shows that using genetic algorithms can effectively optimize the process routes and get the
optimal or near-optimal routings which meet the production requirements.
F { f1 , f 2 ,..., f n }
CR {c1 , c2 ,..., cm }
Here, the process sequence that meet the constraints CR is
denoted by U , feature machining unit set having the biggest
fitness which use the genetic algorithm to find is the
optimum process sequence, that is:
Gs { f s1 , f s 2 ,..., f sn }
3. PRECEDENCE RELATION CONSTRAINT
SET OF THE PROCESSING PRECEDENCE
There are some mandatory constraints and optimality
constraints between the processing characteristics of a
complex parts. The process of process sequence
optimization in the CAPP system is first find the process
sequence set meeting the mandatory constraints,then judge
according to the standard of the optimal constraints,and
finally get the processing sequence having the best quality.
Here mandatory constraint set is denoted as Ca the
optimality constraint set is denoted as Cb.
Mandaory constraint set Ca is the constraints that show the
sequence in the process of machining, for example, first
reference after the other, first surface after hole, first
primary after secondary, sequence that its features decide,
and so on. Considering these mandatory constraints, We cite
logic symbols to represent complex constraints, for example,
f1( f2 f3 ... fn ) means the machining of feature f1 must be
machined after the feature { f2 f3 ... fn } completed; f1 ( f2
f3 ... fn ) means after any of { f1 f2...fn } completed, f1
can start machining.
_______________________________________________________________________________________
Volume: 04 Issue: 03 | Mar-2015, Available @ http://www.ijret.org
624
pc (m1 , m2 ,..., mn )
Where m1,m2,...mn {1,2,...,n}, and m1m2...mn.
The genotype coding is used for the processing of genetic
algorithm, it is expressed as:
elements;
Compute b [t gci n] 1 ;
5.
AN
EXAMPLE
OF
CAPP
PROCESS
SEQUENCE OPTIMIZATION
Taking the machining features of the part shown in Figure 3
for example, use genetic algorithms to optimize the process
sequence.
_______________________________________________________________________________________
Volume: 04 Issue: 03 | Mar-2015, Available @ http://www.ijret.org
625
T1 ,..., T5 f1 , f 4 ,
f 2 , f 3 , f 5 , f 6 , f 8 , f10 , f 32 , f 34 , f 36 , f 38 ,
f 7 , f 9 , f 31 , f 33 , f 35 , f 37 , f 43
[7,9,1,4,31,33,43,11,23,16,13,15,12,21,14,17,20,8,10,2,5,35,
37,32,34,44,27,19,25,28,30,26,22,18,27,34,21,29,24,39,41,4
0,42,36,38,3,6],
Where the times of clamping and changing knife are
respectively 6 times and 8 times,and the result satisfies the
clustering constraints,its fitness is 96.37.
F { f1 , f 2 ,..., f 44 }
According to the analysis of the constraints, we can get the
mandatory constraint set:
Ca
f , f , f ,..., f , f ,..., f ,
SU1 , SU 2 , SU3 9 10 21 30 35 38
f1 ,..., f8 , f11 ,..., f 20 , f 39 ,..., f 44
6. CONCLUSION
In the CAPP system, solving the sorting problem of process
sequence is always one of the difficulties. This paper uses
genetic algorithm, in the corresponding constraints, by
copying, crossover and mutation, to conduct a global
optimization for the sorting of process route and finally uses
an example to validate its good result. This study has
important implications for the study of CAPP system
process diagrams automatical generation.
ACKNOWLEDGEMENTS
The authors would like to thank the financial support from
Scientific Research Innovation Fund of Shanghai University
of Engineering Science and the schools lab conditions to
this research. This paper comes from Project source:
Graduate research and innovation projects of SUES . Project
number: E1-0903-14-01005.
_______________________________________________________________________________________
Volume: 04 Issue: 03 | Mar-2015, Available @ http://www.ijret.org
626
REFERENCES
[1]. Joseph H. M. Tah. A Data Base Management System
for Forwork Design Applications[J].Oxford Brookes
University, 2008,5(1): 59-70
[2]. Shobrys D E. White D C. Planning, scheduling and
control systems: why can they not work together[J].
Computer & Chemical Engineering, 2000(24) : 163-173.
[3]. Bian Min. Discussion about the Type of CAPP System
and Working Principle[J]. Technology Information, 2011,
01:15-16
[4]. F.Mervyn, A. Senthil kumar, S.H.Bok,A.Y.C.Nee,
Development of an Internet-enabled 64 interactive fixture
design system. Computer-Aided Design,2003,35: 945957
[5]. B.K.Choi,K.Ko. C-space based CAPP algorithm for
freeform die-cavity machining. Computer-Aided Design
2003,35: 179189
[6]. Renner.Gabor, Ekart.Aniko. Genetic algorithms in
computer aided design. Cpmouter-Aided Design, 2003
7:709726
[7]. Chen,Yu-Ming. Management of water resources using
improved genetic algorithms. Computers and Electronics in
Agriculture, 1997, 8: 117127
BIOGRAPHIES
Shen Lei currently is a master in the
Mechanical
manufacturing
and
automation at Shanghai University of
Engineering Science. His main
research direction is application of
CAD/CAM.
E-mail:shenleiswl3258@163.com
Yigang Hu currently is professor,
working in Shanghai University of
Engineering Science. His main
research direction is technology and
application of mechanical CAD/CAM
_______________________________________________________________________________________
Volume: 04 Issue: 03 | Mar-2015, Available @ http://www.ijret.org
627