碩士 / 國立中央大學 / 土木工程研究所 / 91 / 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.
| Identifer | oai:union.ndltd.org:TW/091NCU05015076 |
| Date | January 2003 |
| Creators | Keng-Chung Chang, 張耿宗 |
| Contributors | none, 顏上堯 |
| Source Sets | National Digital Library of Theses and Dissertations in Taiwan |
| Language | zh-TW |
| Detected Language | English |
| Type | 學位論文 ; thesis |
| Format | 88 |
Page generated in 0.0096 seconds