孔群加工路径规划问题的进化求解.pdfVIP

11 5 计算机集成制造系统 Vol. 11 No.5 2 0 0 5 5 Computer Integrated Manufacturing Systems May 2 0 0 5 : 1006- 5 11( 2005) 05- 0682- 08 1,2 2 , ( 1. , 430074; 2. CAD , 430074) : , , / 0 , H opfield , H opfield , , , , Pareto : ; ; ; ; : T P3 ; T P181. 72 : A Solution to holes machining path planning by evolutionary methods 1, 2 2 X IA O Ren- bin , TA OZhen- wu ( 1. Sch. of Management, H uazhong Univ . of S T , Wuhan 430074, China; 2. CAD Cent. , H uazhong Univ. of S T , Wuhan 430074, China) Abstract: H oles Machining Path Planning is significant to improve t he machining efficiency and qualit y of multi- hole part s. Tw o mathematical models of H oles Machining Path Planning problems w ere const ruct ed, w hich could be induced to single object ive and multi- objective combinatorial optimization problems respect ively. T wo novel evolu- tionary algorithms, Evolutionary Ant Colony Syst em algorit hm and Artificial Immune algorithm, were introduced to solve t he single objective combinatorial optim izat ion problems. Analysis indicated that these t wo algorit hms could resist the combinat orial explosion in solut ion space effectively and had lower computational complexity and higher performance compared w ith t he Hopfield algorit hm. By improving the Evolutionary Ant Colony System algorithm and Artificial Immune algorithm w ith the Technique of Fast Solution Sort ing, the M ulti- objective Evolutionary Ant Colony Syst