|Author's Email Address
||This thesis had been viewed 5350 times. Download 3272 times.|
|Type of Document
||A Study on Multi-objective Section Steel Cutting Plan Using Meta-Heuristic Approaches|
|Date of Defense
one-dimensional cutting stock problem
||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.
||Chin - Fu Ho - chair|
Yi - Min Tu - co-chair
Pin - Yang Liu - advisor
indicate in-campus access immediately and off_campus access in a year|
|Date of Submission