• DocumentCode
    2806226
  • Title

    Metal cutting with hybrid genetic algorithm

  • Author

    Tang, Kwok-Wah ; Tang, Wallace Kit-Sang

  • Author_Institution
    Dept. of Electron. Eng., City Univ. of Hong Kong, China
  • fYear
    2005
  • fDate
    10-12 Aug. 2005
  • Firstpage
    735
  • Lastpage
    739
  • Abstract
    A hybrid genetic approach is proposed for the metal cutting process. Metal cutting can be modeled as a two-dimensional strip-packing problem with rotation allowed, and is known to be NP-complete. With a heuristic placement method, the complicated and highly constrained cutting problem is transformed into a simple permutation problem with a much smaller searching domain, solved by an order-based genetic algorithm. In our simulations, it is demonstrated that optimal results can be duly obtained in a reasonably short period of time.
  • Keywords
    bin packing; computational complexity; cutting; genetic algorithms; heuristic programming; metals; constrained cutting problem; heuristic placement method; hybrid genetic algorithm; metal cutting process; strip-packing problem; Genetic algorithms; Genetic engineering; H infinity control; Heuristic algorithms; Manufacturing; Measurement; Production; Resource management; Shape; Strips;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Industrial Informatics, 2005. INDIN '05. 2005 3rd IEEE International Conference on
  • Print_ISBN
    0-7803-9094-6
  • Type

    conf

  • DOI
    10.1109/INDIN.2005.1560465
  • Filename
    1560465