Please use this identifier to cite or link to this item:
A Simulated Annealing Algorithm Approach to Container Stuffing Problem
|Keywords: ||模擬退火演算法;配櫃;堆疊問題;平穩度;Simulated annealing algorithm;Stuffing;Container loading problem;Stability|
|Issue Date: ||2017-03-28T02:53:39Z
Container stuffing work is a quite important and complicated assignment in container transportation. It is still he accomplished by the workers with actual experiences, but they usually depend mainly on the trial-and-error experiences to load and discharge again and again in order to multiple types and sizes of the cargo could be packed successfully. It may consume much of time and make cost increased. Based on the optimal space utilization and stability conditions, therefore, the purpose of this study is to develop a simulated annealing algorithm approach considering the effects of cargo allocated constraints, container loading limits and stability on packing and integrating with a improved bottom-back-left packing model to solve for actual container stuffing problems. The numerical approach is programmed by MATLAB(R)and a 3D graphic demonstrated interface is also constructed in this study to show the analyzed results specifically. Finally, the computational results indicated that a good container space utilization and stability is good enough to satisfy the requirement of container stuffing assignment. The analyzed results for packing simulation on objects of multiple sizes, irregular shapes, various loading constraints and combination with pallet are agreed well with the practical stuffing work to certify this approach is to be provided with good applicability.
|Relation: ||20(3) pp.61-88|
|Appears in Collections:||[商船學系] 演講及研討會|
Files in This Item:
There are no files associated with this item.
All items in NTOUR are protected by copyright, with all rights reserved.