题名

岸肩橋式起重機工作排程之研究

并列篇名

Quay Crane Scheduling at Container Terminal

DOI

10.6402/TPJ.200609.0281

作者

盧華安(Hua-An Lu);林正偉(Cheng-Wei Lin)

关键词

岸肩橋式起重機 ; 戰術性排程 ; 極小極大化 ; 混合整數規劃 ; Quay crane ; Tactical scheduling ; Min-max ; Mixed integer programming model

期刊名称

運輸計劃季刊

卷期/出版年月

35卷3期(2006 / 09 / 30)

页次

281 - 308

内容语文

繁體中文

中文摘要

岸肩橋式起重機為貨櫃在港裝卸之主要機具,扮演貨櫃流程中樞角色,除具備港灣與貨櫃棧埠界面功能外,亦是貨櫃碼頭裝卸效率重要指標之一。通常貨櫃碼頭均配置多部橋式起重機以利相互支援,但在進行排程規劃時,除需安排各自於各船之作業時窗外,仍要考慮相互禁止跨越,以及同一船舶需由相鄰機具服務之限制。本研究據此建構一極小極大化作業工時之戰術性排程模式,並將其轉換為混合整數規劃問題。經運用商用套裝軟體OPL進行業者提供實際營運資料之求解分析,顯示部署於中間席位之橋式起重機較能發揮相互支援之特性,與實務單位日常指派橋式起重機之概念相符。進一步透過敏感性分析發現,欲達成平均各部橋式起重機作業工時之目標,靠泊船席的安排則為關鍵因素。

英文摘要

Quay crane is the main equipment to play the core role of loading and unloading containers in seaport terminal. Besides it possesses the interface function between waterside and stevedoring systems, the performance of quay cranes is naturally one of the most important indexes for assessing the efficiency of a container terminal. The problem of quay crane scheduling not only considers the arrangement of service time windows, but also needs to avoid crossing each other and to assign neighbored cranes for a vessel. Following to these physical limitations, we formulated a tactical crane scheduling model with a min-max objective function of working times for all concerned cranes. It can be transferred into a mixed integer programming model. We applied it to a real-world case from the studied company and solved by the commercial optimization software OPL. Test results show as same as the practical concept that cranes deployed in the middle positions can support the task assignment of others. From the sensitivity analysis, we found that the berth allocation for each concerned vessel is a critical factor to reach the target of averaging working times for all cranes.

主题分类 工程學 > 交通運輸工程
社會科學 > 管理學
参考文献
  1. 陳春益、趙時樑(2004)。貨櫃碼頭出口儲區門型起重機小車取櫃問題之研究。運輸計劃季刊,33(3),449-470。
    連結:
  2. 趙時樑、陳春益(2003)。港區貨櫃場多部軌道型門式起重機移動路徑之研究。運輸計劃季刊,33(4),681-714。
    連結:
  3. 藍武王、高傳凱(2002)。貨櫃儲存場儲位指派模式建構與求解。運輸學刊,14(4),99-117。
    連結:
  4. Daganzo, C. F.(1989).The Crane Scheduling Problem.Transportation Research Part B,23(3),159-176.
  5. ILOG OPL(2001).Studio 3.5 Reference Manual.ILOG, Inc..
  6. Kim, K. H.,Park, Y. M.(2004).A Crane Scheduling Method for Port Container Terminals.European Journal of Operational Research,156,752-768.
  7. Lim, A.,Rodrigues, B.,Xiao, F.,Zhu, Y.(2002).Crane Scheduling Using Tabu Search.Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence
  8. Peterkofsky, R. I.,Daganzo, C. F.(1990).A Branch and Bound Solution Method for the Crane Scheduling Problem.Transportation Research Part B,24(3),159-172.
  9. Vis, I. F. A.,Koster, R.(2003).Transshipment of Containers at a Container Terminal: An Overview.European Journal of Operational Research,147,1-16.