English  |  正體中文  |  简体中文  |  Items with full text/Total items : 65275/65275 (100%)
Visitors : 20890835      Online Users : 316
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/64790


    Title: 貨櫃船舶排艙問題之研究─限制規劃法之應用;The study of container ship stowage plan – application of constraint programming method
    Authors: 徐胤埕;Hsu,Yin-cheng
    Contributors: 土木工程學系
    Keywords: 貨櫃排艙問題;艙位規劃問題;限制規劃;Container stowage problem;Slot planning;Constraint programming
    Date: 2014-07-22
    Issue Date: 2014-10-15 14:24:42 (UTC+8)
    Publisher: 國立中央大學
    Abstract: 貨櫃船舶之貨櫃排艙問題為定期航商重要的管理課題之一,於滿足船舶穩度安全限制下,最小化壓櫃情形,以降低貨櫃船舶滯港時間,進而使航商之碼頭作業成本下降。近年來,受貨櫃船舶大型化之影響,人工貨櫃排艙作業日漸複雜,故航商需要一套兼具安全與效率之輔助決策排艙系統,貨櫃排艙研究也因此應運而生。
    以往貨櫃排艙問題研究多使用數學規劃方法配合啟發式演算法或巨集式啟發演算法,但其無法考量艙內之貨櫃擺放規則限制、貨櫃堆疊高度、重量等細部貨艙內限制式,故Delgado et al. (2012) 將貨櫃排艙問題分為兩階段子問題,分別為主積載規劃問題 (master planning)及艙位規劃問題(slot planning),主積載規劃問題使用數學規劃方法求解全船之貨艙貨櫃分配數量,於艙位規劃階段使用限制規劃法處理貨艙內細部限制式,但未探討貨艙內船舶橫向穩度問題以及甲版以上艙位規劃問題。
    本研究延續其第二階段之艙位規劃問題,並利用限制規劃法能快速搜尋可行解之特性,建構及求解貨艙內之艙位規劃問題,包含貨櫃堆疊高度及重量、貨艙結構、20呎貨櫃無法堆疊於40呎貨櫃上方等限制,同時增加考量貨艙內平衡問題及甲板以上艙位規劃問題,並以航商A所提供之實際船舶資料進行測試,共9個貨艙範例,所有範例均能在1秒內尋找到可行解,且與實務人工排艙比較後,發現本研究所得到之可行解甚佳。
    ;The container stowage problem is one of the important problem in liner shipping company, in order to decrease the port operating costs , this problem has to satisfy the ship’s stability and also has to minimize the number of over-stowage. Recently, due to the enlargement of containership, the manual operation of stowage plan is getting harder than before, so the liner shipping company is desperate for a container stowage decision making system that can reach both safety and efficiency.
    It is our knowledge that the most research in the past are using mathematical programming method to solve the container stowage problem, but they can not considering the detail constraint in a bay, such as the limit of stack height and weight, 20’ containers cannot be stacked on top of 40’ containers and ship structure limit. Delgado et al. (2012) separated the container stowage problem into two phases, the master planning phase and the slot planning phase respectively, they use mathematical programming method to solve the master bay planning problem by distributing containers into bays without specific slot information, then use the constraint programming method to solve the slot planning problem, however, they didn’t mentioned the stability problem in a bay.
    Our research is based on slot planning phase, by using the constraint programming method to build and solved the slot planning problem, including the limit of stack height and weight, 20’ containers cannot be stacked on top of 40’ containers and ship structure limit, in addition to considering the balance in a bay and solved the bay above deck. Without loss of generality, our test instances are all provided by the liner shipping company A, and able to solve all of the instances in less than 1 second, after compared with the manual stowage plan, we found that our feasible solution is quite good.
    Appears in Collections:[土木工程研究所] 博碩士論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML463View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明