| 摘要 |
PROBLEM TO BE SOLVED: To make an optimal carrying plan by deciding the grouping of all the material to be carried into plural sets so that the total of the loading time over the full sets becomes the minimum, and deciding the carrying order of the plural sets so that the total of the vacant time over the full sets becomes the minimum. SOLUTION: Containers are piled at multiple stages in a container yard. Working time per each pair of the containers of the top stage at that time is computed. Next, the maximum matching subject is solved so as to obtain the optimal grouping of all the pairs. In the case where a software for the minimum subject is used, it is necessary to be converted for the maximum matching subject, and the maximum matching subject is solved. Moving time between each pair is computed over all the pairs. At this stage, carrying order of each pair is decided over all or a part of the pairs. Since two-stage piling and one-stage piling exist in each block, all or a part of the pairs are handled over all the blocks. When a residual container is not detected, the operation is concluded. |
