Solution for Container Stuffing Problems Considering the Loading Limit and Cargo Stability Based on Genetic Algorithm
| Autor: | 柯宜伶 |
|---|---|
| Rok vydání: | 2008 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 96 Container stuffing work is one of quite important link in container transportation, even though it is still be accomplished by the worker who has actual experience on doing this, but because different packing experience, habit, cargo types and multiple sizes in order to have the best space utilization under safe and steady condition, they usually apply their own experience and try and error to load and discharge again and again, it may lost plenty of time and made cost increased. Secondly, related research in being for two or three dimension algorithm mode for space packing problem, almost get the important factor of cargo weight, container stability and center of gravity and so on ignore or simplify, as a result, hardly to bring effective bestead on actual stuffing work. Accordingly, the purpose of this study is to use genetic algorithm in loading stable condition to solve for combination optimization problem, joining important factors which effect cargo loading and best space utilization especially cargo, container loading limit and stability at the same time, adjusting current cargo collocation datum point, and develop a improved bottom-back-left packing approach, using MATAB computational tool to compile a analysis model to solve for container stuffing problems. By multi-scene condition, classical sample test, and compared with AutoLoad. The results turned out that a good container space utilization and stability is good enough to certify this model is to be provided with good applicability. Finally, compare with actual sample, and use AutoCAD to draw the result. This study may be a reference to stuffing worker and forwarder in the following case. |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|