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

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

Title: 時空網路應用於機門指派問題之研究
A Time-Space Network Model for the Airport Gate Assignment Problem
Authors: 陳春益
李宇欣
盧華安
Contributors: 國立臺灣海洋大學:航運管理學系
Keywords: 機門指派;多元商品流量問題;時空網路;具額外限制式之成本最小化流量問題;分支定限法
Airport Gate Assignment;Multicommodity Flow Problem;Time-Space Network;Minimum Cost Flow Problem with Side Constraints;Branch-and-Bound Algorithm
Date: 1997-09
Issue Date: 2016-11-24T06:26:03Z
Publisher: 運輸學刊,
Abstract: 摘要:傳統上,機門指派之最佳化模式,大多被構建成整數規劃問題,如應用於實務問題上,每每成為大型問題而無法快速求解。近來,該問題被定式為多元商品流量問題,遭遇大型問題演算績效不佳之課題。本研究嘗試運用時空網路協助模式構建,所建模式為具額外限制式之成本小化流量問題,該額外限制式為變數間之流量對稱等式限制,改善了模式構建的複雜性。經以分支定限法求解苦干範例與中正機場簡化實例,所得線性規劃之實數解即為整數最佳解,測試結果亦顯示該模式確能提供合理的指派結果。
Abstract:The airport gate assignment problem is conventionally modeled as aninteger programming problem and is heuristically solved for real-world cases.Recently, it had been formulated as a multicommdity flow problem. However, areal-time algorithm is needed. In this paper, we make use of the time-spacenetwork to formulate it as a minimum cost flow problem with side contraints, aset of flow equality constraints. Fruthermore, integer solutions can beobtained at the first phase without branching with the branch-and -boundalgorithm in our case studies. The experimental result shows that our model ispromising.
Relation: 10(3), pp.1-20
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/39131
Appears in Collections:[航運管理學系] 期刊論文

Files in This Item:

File Description SizeFormat
index.html0KbHTML43View/Open


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