| DC 欄位 |
值 |
語言 |
| DC.contributor | 土木工程學系 | zh_TW |
| DC.creator | 張耿宗 | zh_TW |
| DC.creator | Keng-Chung Chang | en_US |
| dc.date.accessioned | 2003-7-16T07:39:07Z | |
| dc.date.available | 2003-7-16T07:39:07Z | |
| dc.date.issued | 2003 | |
| dc.identifier.uri | http://ir.lib.ncu.edu.tw:444/thesis/view_etd.asp?URN=90322079 | |
| dc.contributor.department | 土木工程學系 | zh_TW |
| DC.description | 國立中央大學 | zh_TW |
| DC.description | National Central University | en_US |
| dc.description.abstract | 為了降低貨櫃運輸的成本，船舶的大型化為目前貨櫃運輸的趨勢，影響貨櫃
裝卸成本的排艙規劃將因而變得更複雜，而以人工經驗為主的排艙規劃作業難度
亦將隨之增加。由於過去的研究皆假設航線上各港口的出口貨櫃需求量為固定，
與實際情形不符，故本研究針對變動需求下貨櫃船排艙規劃發展有效率之求解方
法。
本研究參考相關文獻將排艙規劃分成兩階段，以最小化翻櫃成本為目標，在
考量船舶平衡及壓櫃的限制條件下，分別構建最佳化數學模式進行求解。第一階
段為艙區指派模式：將貨櫃船的艙位分區，且將性質相近的貨櫃編為同組，構建
貨櫃組指派數學模式；第二階段為艙位指派模式，依據第一階段的指派結果對每
一艙區內的貨櫃進行指派。兩階段的數學模式皆為零壹整數規劃問題，本研究使
用數學規劃軟體進行求解。
為測試本研究構建之模式的正確性及演算法的績效，本研究以一國籍海運業
者的營運資料為例進行測試，並分析演算法中的參數對求解結果的影響。最後根
據測試結果提出結論與建議。 | zh_TW |
| dc.description.abstract | This research deals with a stowage plan for containers in a container ship. Since
1970s, shipping companies compete around the world to provide profitable container
transportation services. In order to increase the benefits of economy of scale, the
capacity of container ships has increased. The complexity of stowage planning is
increased by the capacity of containership naturally. The work of perform stowage
plan is arranged by the human planners today. Future, this work will be more
difficult for human planners because the capacity of container ship increasing. In the
literatures, they have assumed that container demand is fixed. In reality, container
demand is variable, so we consider a container ship stowage plan with variable
demand.
We consider a solution algorithm which embodies two stage processes to computerize
the planning. The objective of this algorithm is to minimize the number of container
shifting. The mathematical programming technique is used to formulate each model
of two stages. The first stage deal with assigning groups of container with the same
OD into the holds, which be formulated as binary integer programming problem
which includes the constraints of stability of the ship to reduce overstow. In the
second stage, the model deal with assigning each container into slots according the
solution from fist stage. We solve the two models by ILOG CPLEX. In order to
evaluate the model and the solution framework, we perform a case study using data
based on information obtained from an ocean container liner in Taiwan, and this
algorithm can generate a solution in a reasonable time. | en_US |
| DC.subject | 貨櫃 | zh_TW |
| DC.subject | 排艙 | zh_TW |
| DC.subject | 變動需求 | zh_TW |
| DC.subject | 零壹整數規劃問題 | zh_TW |
| DC.subject | binary integer programming problem | en_US |
| DC.subject | stowage planning | en_US |
| DC.subject | container | en_US |
| DC.subject | variable demand | en_US |
| DC.title | 變動需求下貨櫃船排艙最佳化之研究 | zh_TW |
| dc.language.iso | zh-TW | zh-TW |
| DC.type | 博碩士論文 | zh_TW |
| DC.type | thesis | en_US |
| DC.publisher | National Central University | en_US |