Adaptive neighborhood method & GA for solving the vacancy route optimization of machining |
| |
作者姓名: | LUO Ci yong LU Bin and HAN Li |
| |
作者单位: | State Key Laboratory of Power Transmission Equipment & System Security and New Technology,Chongqing University, Chongqing 400030, P.R. China;State Key Laboratory of Power Transmission Equipment & System Security and New Technology,Chongqing University, Chongqing 400030, P.R. China;State Key Laboratory of Power Transmission Equipment & System Security and New Technology,Chongqing University, Chongqing 400030, P.R. China |
| |
摘 要: | The mathematical model of vacancy course path optimization of laser machining is built and changed to the travelling salesman problem (TSP). The Nearest Neighbor (NN) is modified to Adaptive Neighborhood Method (ANM). In ANM one mimics the traveller whose rule of thumb is not always to go next to the nearest as yet unvisited location. The next city is randomly selected from the unvisited cities in adaptive neighborhood. While solving the TSP, ANM is used to create the initial population at first, then iterations are done through selection, cross and mutation operation. In selection, the proposed algorithm only keep 90% samples from the previous generation, the remained agents are supplied by the new sample created by ANM. The results show that the algorithm shortens vacancy course in laser machining and the manufacturing efficiency is improved.
|
关 键 词: | GA TSP adaptive neighborhood method |
|
| 点击此处可从《保鲜与加工》浏览原始摘要信息 |
|
点击此处可从《保鲜与加工》下载全文 |
|