A Heuristic Algorithm for Solving the Pre-marshalling Problem of Container Yard with Two Gantry Cranes
碩士 === 國立成功大學 === 工業與資訊管理學系 === 107 === It is possible to reduce the container ship’s docking time by making good use of time to pre-arrange containers when there is no ship stopping by the quay. In order to determine the order of pre-marshalling operations, we built an integer programming model to...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2019
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/p85szc |