The Computer System of Motion-Time Measurement and Application

• Main Authors: Chen chi chang, 陳啟昌
• Other Authors: Wei-Cheng Lin
• Format: Others
• Language: zh-TW
• Online Access: http://ndltd.ncl.edu.tw/handle/h537j6

碩士 === 國立高雄應用科技大學 === 資訊工程系 === 100 === Three-dimensional cutting problems is a common problem. For example, in a company, the goods to put in the warehouse, the container to put on the boats or air- transportation to put the goods in the airplane, The main problem is how to effectively use the space and put the goods, makes use of space to maximize the reach and thus save a lot of space and time cost. Three-dimensional cutting problems is based on Two-dimensional cutting problems, the two-dimensional cutting problems is difficult to obtain the optimal solution in a short time, so three-dimensional cutting problems are more difficult, we hope to in a short time to obtain an acceptable solution, we call a near optimum solution. In this paper we study how to use the Genetic Algorithms to solving two-dimensional cutting problems, the cube in a certain space, the stacking order of the near optimum solution, to find an acceptable answer in a short time, can be a reference to help in dealing with similar problems, to achieve savings in time and space costs.