臺灣人文及社會科學引文索引資料庫系統

:::

詳目顯示

回上一頁
第 1 筆 / 總合 1 筆   第一頁 上一頁 下一頁 最後一頁
/1頁
題名：貨櫃碼頭岸肩拖車派遺規劃之研究
書刊名：運輸計劃
作者：盧華安／鄭景怡
作者(外文)：Lu, Hua-an／Jeng, Jing-yi
出版日期：2005
卷期：34:3
頁次：頁325-353
主題關鍵詞：橋式起重機；極小極大化；非線性整數規劃模式；啟發式演算法；Quay crane；Min-max；Nonlinear integer programming model；Heuristic algorithm
原始連結：連回原系統網址new window
相關次數：
  • 被引用次數被引用次數:期刊(0) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:4
  • 點閱點閱:40
本研究以專用貨櫃碼頭之營運型態為對象，探討碼頭岸肩與貨櫃堆積場間，載運貨櫃車輛之派遣規劃。在各櫃次之橋式起重機與貨櫃堆積場作業時間已知的前提下，建構一極小極大化之非線性整數規劃模式，並發展符合實務作業之啟發式演算法，解析多部拖車支援單部起重機之規劃作業。其中建議「由近至遠」、「由遠至近」、「一遠一近」、「隨機選取」四種距離原則作為儲區指派策略，除對實例之原始裝卸順序進行解算外，另配合「全卸全裝」、「依艙位序裝卸」與「同時裝卸」的貨櫃船裝卸作業型態，進行不同拖車數之派遣分析。其結果顯示儲區指派原則因案例不同而裝卸效率互異，宜做事先規劃；而作業型態若能在充分配合下，「同時裝卸」方式較能達到縮短作業時間之成效。本研究之成果不僅可預先規劃拖車之指派與完工時間的估算，就長期規劃課題而言，亦能作為機具數量與部署決策之參考。
In this study we analyzed the dispatching problem of truck trailers to support transferring tasks of containers between quay cranes and yard areas of private container terminals. Given the waiting time of crane and yard handling for each task, we formulated a min-max nonlinear integer programming model for multiple track trailers working with one crane. Based on certain operational concepts, a heuristic algorithm is also designed to solve this problem. They include four assignment principles of container storage/pick-up location: shortest-route assignment, furthest-route assignment, shortest and furthest-route mixed assignment, and random assignment, as well as three loading and discharging patterns ( i.e., whole discharging plus loading, bay-to-bay, and double cycle operation). We exploited the algorithm to analyze some real-world cases. The results showed that none of the operations worked better in four location assignment principles for different cases, but the double cycle operation was able to obtain a fair performance, if the real environment of container terminal could match the requirement of handling. Our study can provide companies not only the dispatching program of truck trailers and the estimated period of tasks finished but also the required number of deployed truck trailers for a long-term planning.
期刊論文
1.Kim, K. Y.、Kim, K. H.(1999)。A routing algorithm for a single straddle carrier to load export containers onto containership。International journal of production economics，59(1/3)，425-433。  new window
2.Bish, Ebru K.、Leong, Thin-Yin、李仲麟、Ng, Jonathan W. C.、Simchi-Levi, David(2001)。Analysis of a New Vehicle Scheduling and Location Problem。Naval Research Logistics，48(5)，363-385。  new window
3.Das, S. K.、Spasovic, L.(2003)。Scheduling material handling vehicles in a container terminal。Production Planning and Control，14(7)，623-633。  new window
4.Steenken, Dirk、Voß, Stefan、Stahlbock, Robert(2004)。Container terminal operation and operations research-a classification and literature review。OR Spectrum，26(1)，3-49。  new window
5.Yun, Won Young、Choi, Yong Seok(1999)。A Simulation Model for Container-terminal Operation Analysis Using an Object-oriented Approach。International Journal of Production Economics，59(1-3)，221-230。  new window
6.Kim, K. H.、Kim, K. Y.(1999)。An Optimal Routing Algorithm for a Transfer Crane in Port Container Terminals。Transportation Science，33(1)，17-33。  new window
7.Kim, K. H.、Kim, K. Y.(1999)。Routing Straddle Carriers for the Loading Operation of Containers Using a Beam Search Algorithm。Computers Industrial Engineering，36(1)，109-136。  new window
8.陳韜(1999)。Yard Operations in the Container Terminal - a Study in the 'Unproductive Moves'。Maritime Policy and Management，26(1)，27-38。  new window
9.Daganzo, C. F.(1989)。The Crane Scheduling Problem。Transportation Research, Part B: Methodological，23(3)，159-175。  new window
10.Peterkofsky, R. I.、Daganzo, C. F.(1990)。A Branch and Bound Solution Method for the Crane Scheduling Problem。Transportation Research, Part B: Methodological，24(3)，159-172。  new window
11.趙時樑、陳春益(2003)。港區貨櫃場多部軌道式門型起重機移動路徑之研究。運輸計劃季刊，32(4)，681-714。new window  延伸查詢new window
12.靳蓉章(2002)。如何提高貨櫃船船邊作業的效率。中華海員月刊，580附冊，1-22。  延伸查詢new window
13.Vis, Iris F. A.、De Koster, René(2003)。Transshipment of Containers at a Container Terminal: An Overview。European Journal of Operational Research，147(1)，1-16。  new window
14.Bish, Ebru K.(2003)。A Multiple-crane-constrained Scheduling Problem In a Container Terminal。European Journal of Operational Research，144(1)，83-107。  new window
15.Kim, Kap-Hwan、Kim, Ki Young(2003)。Heuristic Algorithms for Routing Yard-side Equipment for Minimizing Loading Times in Container Terminals。Naval Research Logistics，50(5)，498-514。  new window
16.Ballis, A.、Golias, J.、Abarkoumkin, C.(1997)。A Comparison between Conventional and Advanced Handling Systems for Low Volume Container Maritime Terminals。Maritime Policy & Management，24(1)，73-92。  new window
17.Evers, Joseph J. M.、Koppers, Stijn A. J.(1996)。Automated Guided Vehicle Traffic Control at a Container Terminal。Transportation Research Part A: Policy and Practice，30(1)，21-34。  new window
18.Vis, I. F. A.、De Koster, R. M. B. M.、Roodbergen, K. J.、Peeters, L. W. P.(2001)。Determination of the Number of Automated Guided Vehicles Required at a Semi-automated Container Terminal。Journal of the Operational Research Society，52(4)，409-417。  new window
19.Kozan, Erhan(1997)。Comparison of Analytical and Simulation Planning Models of Seaport Container Terminals。Transportation Planning and Technology，20(3)，235-248。  new window
20.Daganzo, C. F.(1990)。The Productivity of Multipurpose Seaport Terminals。Transportation Science，24(3)，205-216。  new window
21.Easa, Said M.(1987)。Approximate Queueing Models for Analyzing Harbor Terminal Operations。Transportation Research Part B: Methodological，21(4)，269-286。  new window
22.Edmond, E.(1975)。Operation Capacity of Container Berths for Scheduled Service by Queueing Theory。The Dock and Harbour Authority，56 (661)，230-234。  new window
23.Jones, J. H.、Blunden, W. R.(1968)。Ship Turn-around Time at the Port of Bangkok。Journal of the Waterways and Harbors Division，94(2)，135-148。  new window
24.Kozan, Erhan、Preston, Peter(1999)。Genetic Algorithms to Schedule Container Transfers at Multimodal Terminals。International Transactions in Operational Research，6(3)，311-329。  new window
25.Kim, Ki Young、Kim, Kap-Hwan(1997)。A Routing Algorithm for a Single Transfer Crane to Load Export Containers onto a Containership。Computers & Industrial Engineering，33(3/ 4)，673-676。  new window
會議論文
1.Liu, C.I.、Jula, H.、Vukadinovic, K.、Ioannou, P. A.(2000)。Comparing Different Technologies Movement in Marine Container for Containers Terminals。Piscataway, NJ。488-493。  new window
2.Böse, Jürgen、Reiners, Torsten、Voß, Stefan、Steenken, Dirk(2000)。Vehicle Dispatching at Seaport Container Terminals Using Evolutionary Algorithms。Los Alamitos, CA。377-388。  new window
3.Nishimura, E.、Imai, A.(2000)。Optimal Vehicle Routing for Container Handling in a Multi-user Container Terminal。Kobe, Japan。123-132。  new window
4.Garrido, Rodrigo A.、Allendes, Felipe A.(2000)。Analysis and Modeling of Container Terminals Operations。Reston, VA。232-239。  new window
研究報告
1.Kiesling, M. K.、Walton, C. M.(1995)。Loading/Unloading Operations and Vehicle Queuing Processes at Container Ports。College Station, TX。  new window
2.Meersmans, Patrick J. M.、Dekker, Rommert(2001)。Operations Research Supports Container Handling。Rotterdam, Netherlands。  new window
學位論文
1.謝玉霜(2001)。限制式規劃應用於港區貨櫃場軌道式門型起重機移動路徑之研究(碩士論文)。國立成功大學。  延伸查詢new window
2.趙時樑(2003)。出口儲區門型起重機取櫃問題之研究(博士論文)。國立成功大學。new window  延伸查詢new window
3.鄭景怡(2004)。貨櫃裝卸作業與岸肩載運機具指派之研究(碩士論文)。國立臺灣海洋大學。  延伸查詢new window
4.李光益(1995)。高雄港貨櫃中心作業流程之模擬研究(碩士論文)。國立成功大學。  延伸查詢new window
5.許乃云(2002)。貨櫃儲區整櫃之最佳化網路模式，0。  延伸查詢new window
6.陳壽山(1995)。貨櫃堆積場機具作業時間模式之構建及比較，0。  延伸查詢new window
7.高傳凱(2002)。貨櫃儲存場堆積策略模擬與儲位指派模式構建，0。new window  延伸查詢new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE

臺灣人文及社會科學引文索引資料庫

目前上線人數：965（臺灣：954，外國：11） ／ 本年度總使用人次：2516201 ／ 訪客人次（自102年09月）：68331985
國家圖書館著作權聲明 Copyright © 2013 All rights reserved.
本館地址: 100201臺北市中山南路20號． 本館地圖及交通資訊．
總機：(02)23619132．最佳瀏覽解析度為1024x768以上