English  |  正體中文  |  简体中文  |  Items with full text/Total items : 27287/39131
Visitors : 2444435      Online Users : 36
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/37658

Title: Modelling ship's routing bounded by the cycle time for marine liner.
Authors: Lu, Hua-An
Contributors: 國立台灣海洋大學:航運管理學系
Keywords: Ship's routing、cycle time、branch-and-bound algorithm
Date: 2002-06-01
Issue Date: 2016-04-08T03:10:22Z
Publisher: Journal of Marine Science and Technology
Abstract: 中文摘要:本文討論定期船受循環週期時間限制時,如何進行航線排程最佳規劃之模式構建。透過航商實務流程之探討對航線設計核心問題之分析,本文討論之問題除規劃階段之產業特性外,近似旅行推銷員問題。在滿足循環週期時間與部署船舶數量之關係下,本研究建議一航線排程之混合整數規劃模式,其中加入了若干防止發生分割途程之限制式。在求解部分則仍分成兩個階段進行分枝限界法之求解,第一階段選取目標下限值所拜訪之候選港口,以供第二階段求解使用。經測試所得之排程結果,除可獲得適當之排程計畫外,亦比直接進行求解之方式,有較穩定的求解時間。
Abstract:This paper addresses the problem of determining an optimal routing that bounded by the cycle time for marine liner. Through exploring the practical planning procedure of shipping company and analyzing the core of route design, this problem is realized as similar as the traveling salesman problem (TSP), but, with some specially industrial properties. A mixed integer programming model is proposed to optimize ship’s routing under satisfying the relationships between the cycle time and deployed vessels with given service frequency in a week. Some constraints, besides, are organized to avoid the routing sequence has separated tours. Intuitively, we also divide the solving procedure into two parts. The first chooses some visited ports from relaxed problem as routing candidates for determining the final routing in the next, both through implemented by the branch-and-bound algorithm. Test results show that our procedure can obtain the suitable route service plan within the stable consumed CPU times of calculation.
Relation: 10(1),P61 - 67
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/37658
Appears in Collections:[航運管理學系] 期刊論文

Files in This Item:

File Description SizeFormat

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


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback