亚洲一区欧美在线,日韩欧美视频免费观看,色戒的三场床戏分别是在几段,欧美日韩国产在线人成

遺傳算法在束流切割路徑優(yōu)化中的應(yīng)用
DOI:
作者:
作者單位:

作者簡(jiǎn)介:

通訊作者:

中圖分類號(hào):

基金項(xiàng)目:


Author:
Affiliation:

Fund Project:

  • 摘要
    • |
  • 圖/表
    • |
  • 訪問(wèn)統(tǒng)計(jì)
    • |
  • 參考文獻(xiàn)
    • |
  • 相似文獻(xiàn)
    • |
  • 引證文獻(xiàn)
    • |
  • 資源附件
    • |
  • 文章評(píng)論
    摘要:

    為提高束流加工效率，需對(duì)切割路徑進(jìn)行優(yōu)化。切割路徑優(yōu)化與一般的旅行商問(wèn)題(TSP)不同，需要保證每個(gè)輪廓中的各個(gè)點(diǎn)在優(yōu)化后順序連接。采用增加節(jié)點(diǎn)的方法把切割路徑優(yōu)化問(wèn)題變換為經(jīng)典旅行商問(wèn)題，簡(jiǎn)化問(wèn)題的求解。運(yùn)用遺傳算法求解簡(jiǎn)化后的旅行商問(wèn)題，再把優(yōu)化解變換為切割路徑優(yōu)化問(wèn)題的解，用于指導(dǎo)束流加工中的路徑規(guī)劃。試驗(yàn)表明，這種方法是有效的。

    Abstract:

    It is a basically problem to optimize the cutting paths for increasing the efficiency of high power beam cutting. The optimization of cutting paths is different from the traditional traveling salesman problem (TSP) on the limitation that a local circle in cutting paths should be cut in a certain order. A transformation method for optimization problem of cutting paths to TSP was introduced to solve this problem, and the TSP was solved by genetic algorithm. The optimum results for the TSP can be transformed back to the solution for optimization of cutting paths. The numerical simulated results show that this method is effective on optimization of high power beam cutting paths.  

    參考文獻(xiàn)
    相似文獻(xiàn)
    引證文獻(xiàn)
引用本文

孫慧平,李健,郭偉剛.遺傳算法在束流切割路徑優(yōu)化中的應(yīng)用[J].農(nóng)業(yè)機(jī)械學(xué)報(bào),2008,39(9):158-160.[J]. Transactions of the Chinese Society for Agricultural Machinery,2008,39(9):158-160.

復(fù)制
分享
文章指標(biāo)
  • 點(diǎn)擊次數(shù):
  • 下載次數(shù):
  • HTML閱讀次數(shù):
  • 引用次數(shù):
歷史
  • 收稿日期:
  • 最后修改日期:
  • 錄用日期:
  • 在線發(fā)布日期:
  • 出版日期:
文章二維碼