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: | Tien-WeiLan, 藍天蔚 |
---|---|
Other Authors: | Shiow-Yun Chang |
Format: | Others |
Language: | zh-TW |
Published: |
2019
|
Online Access: | http://ndltd.ncl.edu.tw/handle/p85szc |
Similar Items
-
A heuristic of the pre-marshalling problem in the container yards
by: Chien-Hung Sung, et al.
Published: (2004) -
The Study of Performance Evaluation with Mounted Gantry Crane Operational Simulation in the Container Yard
by: Yang, Chi-Hao, et al.
Published: (2017) -
Optimization of Gantry Crane Scheduling in Container Sea-Rail Intermodal Transport Yard
by: Tian Luo, et al.
Published: (2018-01-01) -
An optimal network model for pre-marshalling in the container yard
by: Nai-Yun Hsu, et al.
Published: (2002) -
Heuristic Algorithms for Multi-Depot Container Yard Transportation Problem
by: 王常殷
Published: (2010)