The Scheduling of Multiple Yard Cranes in a Container Block by a Look-Ahead Heuristic
碩士 === 國立東華大學 === 運籌管理研究所 === 101 === Ocean transportation has tremendous growth. The throughput of each port increases, and the competition of among ports become fierce. In order to attract customers, ports enhance the efficiency of container processing. Yard cranes are the most important factor...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Published: |
2013
|
Online Access: | http://ndltd.ncl.edu.tw/handle/92631519766073503871 |
id |
ndltd-TW-101NDHU5682007 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-101NDHU56820072015-10-13T22:40:50Z http://ndltd.ncl.edu.tw/handle/92631519766073503871 The Scheduling of Multiple Yard Cranes in a Container Block by a Look-Ahead Heuristic 應用前向啟發式演算法於單一貨櫃堆塊中多部起重機的排程問題 Chen-Hung Chen 陳竑成 碩士 國立東華大學 運籌管理研究所 101 Ocean transportation has tremendous growth. The throughput of each port increases, and the competition of among ports become fierce. In order to attract customers, ports enhance the efficiency of container processing. Yard cranes are the most important factor for the efficiency of container processing, and it is the most important equipment in the yard zone. In other words, a good yard crane scheduling can increase the efficiency of container processing. Because yard cranes cannot cross each other, our thesis investigates avoiding the interference of yard cranes, and then we can enhance the efficiency of container processing. Our method first follows the heuristic of Ng (2005). We partition the block into different parts. Each part is assigned a yard crane to handle containers. For each yard crane, we use the greedy heuristic to find the best scheduling of container processing. Then we use dynamic program to compare different situations and choose the best one which minimizes the total completion time. Then we use the look-ahead heuristic and the modified look-ahead heuristic to replace the greedy heuristic from Ng (2005) to deduce whether the result is better or not. All the computation is carried out by Java programs. Yat-Wah Wan 溫日華 2013 學位論文 ; thesis 76 |
collection |
NDLTD |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立東華大學 === 運籌管理研究所 === 101 === Ocean transportation has tremendous growth. The throughput of each port increases, and the competition of among ports become fierce. In order to attract customers, ports enhance the efficiency of container processing. Yard cranes are the most important factor for the efficiency of container processing, and it is the most important equipment in the yard zone. In other words, a good yard crane scheduling can increase the efficiency of container processing.
Because yard cranes cannot cross each other, our thesis investigates avoiding the interference of yard cranes, and then we can enhance the efficiency of container processing. Our method first follows the heuristic of Ng (2005). We partition the block into different parts. Each part is assigned a yard crane to handle containers. For each yard crane, we use the greedy heuristic to find the best scheduling of container processing. Then we use dynamic program to compare different situations and choose the best one which minimizes the total completion time.
Then we use the look-ahead heuristic and the modified look-ahead heuristic to replace the greedy heuristic from Ng (2005) to deduce whether the result is better or not. All the computation is carried out by Java programs.
|
author2 |
Yat-Wah Wan |
author_facet |
Yat-Wah Wan Chen-Hung Chen 陳竑成 |
author |
Chen-Hung Chen 陳竑成 |
spellingShingle |
Chen-Hung Chen 陳竑成 The Scheduling of Multiple Yard Cranes in a Container Block by a Look-Ahead Heuristic |
author_sort |
Chen-Hung Chen |
title |
The Scheduling of Multiple Yard Cranes in a Container Block by a Look-Ahead Heuristic |
title_short |
The Scheduling of Multiple Yard Cranes in a Container Block by a Look-Ahead Heuristic |
title_full |
The Scheduling of Multiple Yard Cranes in a Container Block by a Look-Ahead Heuristic |
title_fullStr |
The Scheduling of Multiple Yard Cranes in a Container Block by a Look-Ahead Heuristic |
title_full_unstemmed |
The Scheduling of Multiple Yard Cranes in a Container Block by a Look-Ahead Heuristic |
title_sort |
scheduling of multiple yard cranes in a container block by a look-ahead heuristic |
publishDate |
2013 |
url |
http://ndltd.ncl.edu.tw/handle/92631519766073503871 |
work_keys_str_mv |
AT chenhungchen theschedulingofmultipleyardcranesinacontainerblockbyalookaheadheuristic AT chénhóngchéng theschedulingofmultipleyardcranesinacontainerblockbyalookaheadheuristic AT chenhungchen yīngyòngqiánxiàngqǐfāshìyǎnsuànfǎyúdānyīhuòguìduīkuàizhōngduōbùqǐzhòngjīdepáichéngwèntí AT chénhóngchéng yīngyòngqiánxiàngqǐfāshìyǎnsuànfǎyúdānyīhuòguìduīkuàizhōngduōbùqǐzhòngjīdepáichéngwèntí AT chenhungchen schedulingofmultipleyardcranesinacontainerblockbyalookaheadheuristic AT chénhóngchéng schedulingofmultipleyardcranesinacontainerblockbyalookaheadheuristic |
_version_ |
1718080286620647424 |