Title page for etd-0727109-002208


[Back to Results | New Search]

URN etd-0727109-002208
Author Ming-Jian Su
Author's Email Address No Public.
Statistics This thesis had been viewed 5350 times. Download 3272 times.
Department Information Management
Year 2008
Semester 2
Degree Master
Type of Document
Language zh-TW.Big5 Chinese
Title A Study on Multi-objective Section Steel Cutting Plan Using Meta-Heuristic Approaches
Date of Defense 2009-06-25
Page Count 61
Keyword
  • optimization
  • one-dimensional cutting stock problem
  • heuristic methods
  • Abstract Section Steel usually is a order-oriented production and not easy to resell. The material cost is large percentages of overall production cost. Hence, the key to boost efficient management is to increase the material output rate. In other words, we need to publish a efficient and reasonable cutting plan before production. And the cutting plan can cope with change to meet the market demand.
    The cutting plan designing is a one-dimensional cutting stock problem, and also is a typical bin packing problem. In this study we examine a combined heuristic approach for this problem. The proposed approach combines two themes of solving method:a neighborhood search algorithm with threshold accepting techniques, and a Branch and Bound method.
    The performance of the combined heuristic approach was verified by running several benchmarking problems and the results were reported. Experimental results indicate that the proposed solving process can effectively search the feasible region and avoid being trapped in local optimal.
    Advisory Committee
  • Chin - Fu Ho - chair
  • Yi - Min Tu - co-chair
  • Pin - Yang Liu - advisor
  • Files
  • etd-0727109-002208.pdf
  • indicate in-campus access immediately and off_campus access in a year
    Date of Submission 2009-07-27

    [Back to Results | New Search]


    Browse | Search All Available ETDs

    If you have more questions or technical problems, please contact eThesys