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

數(shù)控多輪廓加工走刀空行程路徑優(yōu)化
作者:
作者單位:

作者簡介:

通訊作者:

中圖分類號:

基金項目:


Author:
Affiliation:

Fund Project:

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

    將多輪廓加工走刀空行程路徑優(yōu)化歸結(jié)為廣義旅行商問題，基于蟻群算法和最近鄰算法，提出一種走刀空行程路徑優(yōu)化算法。采用蟻群算法優(yōu)化任意選擇的走刀路徑，得到一條輪廓排列序列，對該輪廓序列，采用最近鄰算法在相鄰輪廓上尋找節(jié)點構(gòu)建走刀路徑，再采用蟻群優(yōu)化及最近鄰算法由此路徑構(gòu)建新的走刀路徑，如此反復(fù)迭代，就得到一條優(yōu)化的走刀路徑。給出一個優(yōu)化實例，驗證了算法可有效構(gòu)建走刀空行程路徑。采用單因素分析和均勻試驗設(shè)計的方法，詳細(xì)給出了優(yōu)化參數(shù)選擇方法。

    Abstract:

    Multi-contour processing empty run optimization was regarded as generalized salesman problem. A novel algorithm based on ant colony system optimization and nearest neighbor rule was proposed. Ant colony algorithm was applied to a selected cutting path arbitrarily, an optimal contour sequence was found, with nearest neighbor rule, nodes on each adjacent contour were obtained to construct a cutting path. A new cutting path was built with ant colony optimization algorithm and nearest neighbor rule based on this constructed path. An optimal cutting path was constructed through several iterations in this way. A multi-contour processing instance was given and the results of it indicated a reasonable cutting path could be gained with this algorithm effectively. With single factor analysis and uniform design, the method of how to select optimization parameters was given. 

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

季國順,王文,陳子辰.數(shù)控多輪廓加工走刀空行程路徑優(yōu)化[J].農(nóng)業(yè)機械學(xué)報,2008,39(7):154-158.[J]. Transactions of the Chinese Society for Agricultural Machinery,2008,39(7):154-158.

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