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 |
id |
ndltd-TW-107NCKU5041035 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-107NCKU50410352019-10-26T06:24:12Z http://ndltd.ncl.edu.tw/handle/p85szc A Heuristic Algorithm for Solving the Pre-marshalling Problem of Container Yard with Two Gantry Cranes 以啟發式演算法求解貨櫃儲區之雙門式起重機預先整櫃問題 Tien-WeiLan 藍天蔚 碩士 國立成功大學 工業與資訊管理學系 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 solve it. Our research is different from current literatures since we expand the scale of the problem from a single bay to multiple bays and add corresponding restrictions to meet the situation where two RMGCs operate simultaneously. However, results showed that we can only solve small-scale problems by using Gurobi to solve the model due to the complexity of pre-marshalling problem. For medium-to-large-scale problems, we proposed a heuristic algorithm to solve it. For small-scale problems, the heuristic algorithm can obtain result that is almost the same as the model’s solution. Moreover, when it comes to the large-scale problems that model can hardly solve with, the heuristic algorithm can acquire solution within reasonable time. Our research also showed that due to considering moving containers between different bays, the pre-marshalling operations would be more efficient based on our data. Moreover, if the objective is to minimize the workload of RMGCs, using one RMGC sometimes is better than using two. However, if the objective is to minimize the finish time, almost all results suggest that using two RMGCs is better. Shiow-Yun Chang 張秀雲 2019 學位論文 ; thesis 72 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立成功大學 === 工業與資訊管理學系 === 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 solve it. Our research is different from current literatures since we expand the scale of the problem from a single bay to multiple bays and add corresponding restrictions to meet the situation where two RMGCs operate simultaneously. However, results showed that we can only solve small-scale problems by using Gurobi to solve the model due to the complexity of pre-marshalling problem. For medium-to-large-scale problems, we proposed a heuristic algorithm to solve it. For small-scale problems, the heuristic algorithm can obtain result that is almost the same as the model’s solution. Moreover, when it comes to the large-scale problems that model can hardly solve with, the heuristic algorithm can acquire solution within reasonable time. Our research also showed that due to considering moving containers between different bays, the pre-marshalling operations would be more efficient based on our data. Moreover, if the objective is to minimize the workload of RMGCs, using one RMGC sometimes is better than using two. However, if the objective is to minimize the finish time, almost all results suggest that using two RMGCs is better.
|
author2 |
Shiow-Yun Chang |
author_facet |
Shiow-Yun Chang Tien-WeiLan 藍天蔚 |
author |
Tien-WeiLan 藍天蔚 |
spellingShingle |
Tien-WeiLan 藍天蔚 A Heuristic Algorithm for Solving the Pre-marshalling Problem of Container Yard with Two Gantry Cranes |
author_sort |
Tien-WeiLan |
title |
A Heuristic Algorithm for Solving the Pre-marshalling Problem of Container Yard with Two Gantry Cranes |
title_short |
A Heuristic Algorithm for Solving the Pre-marshalling Problem of Container Yard with Two Gantry Cranes |
title_full |
A Heuristic Algorithm for Solving the Pre-marshalling Problem of Container Yard with Two Gantry Cranes |
title_fullStr |
A Heuristic Algorithm for Solving the Pre-marshalling Problem of Container Yard with Two Gantry Cranes |
title_full_unstemmed |
A Heuristic Algorithm for Solving the Pre-marshalling Problem of Container Yard with Two Gantry Cranes |
title_sort |
heuristic algorithm for solving the pre-marshalling problem of container yard with two gantry cranes |
publishDate |
2019 |
url |
http://ndltd.ncl.edu.tw/handle/p85szc |
work_keys_str_mv |
AT tienweilan aheuristicalgorithmforsolvingthepremarshallingproblemofcontaineryardwithtwogantrycranes AT lántiānwèi aheuristicalgorithmforsolvingthepremarshallingproblemofcontaineryardwithtwogantrycranes AT tienweilan yǐqǐfāshìyǎnsuànfǎqiújiěhuòguìchǔqūzhīshuāngménshìqǐzhòngjīyùxiānzhěngguìwèntí AT lántiānwèi yǐqǐfāshìyǎnsuànfǎqiújiěhuòguìchǔqūzhīshuāngménshìqǐzhòngjīyùxiānzhěngguìwèntí AT tienweilan heuristicalgorithmforsolvingthepremarshallingproblemofcontaineryardwithtwogantrycranes AT lántiānwèi heuristicalgorithmforsolvingthepremarshallingproblemofcontaineryardwithtwogantrycranes |
_version_ |
1719278325628665856 |