| DC 欄位 |
值 |
語言 |
| DC.contributor | 土木工程學系 | zh_TW |
| DC.creator | 洪逸樺 | zh_TW |
| DC.creator | Yi-Hua Hong | en_US |
| dc.date.accessioned | 2017-12-1T07:39:07Z | |
| dc.date.available | 2017-12-1T07:39:07Z | |
| dc.date.issued | 2017 | |
| dc.identifier.uri | http://ir.lib.ncu.edu.tw:444/thesis/view_etd.asp?URN=104322079 | |
| dc.contributor.department | 土木工程學系 | zh_TW |
| DC.description | 國立中央大學 | zh_TW |
| DC.description | National Central University | en_US |
| dc.description.abstract | 在開拓新航點與航線多元發展下，桃園國際機場正積極為成為東亞地區轉運樞紐做準備。除了機場捷運開通以及興建第三航廈計畫外，目前第二航廈也做了許多更新，包含整合各項軟硬體設備、跑道整建工程等，其中出境部分直線型行李卸載道也於2015年更新成轉盤型行李卸載轉盤，期能提高作業效率。隨著桃園國際機場航空運量大幅成長，每天有超越10萬件以上的行李需處理運送，但目前實務上作法仍仰賴人工經驗進行行李運送規劃，缺乏系統性整合，容易造成資源浪費。因此本研究在參考航班運量預報資訊，並考量實務問題之複雜度，建構出機場行李卸載轉盤指派之模式。
本研究利用數學規劃方法，在滿足所有航班皆指派至一行李卸載轉盤和實務方面限制為前提下，以追求最小化航班行李卸載轉盤重疊作業時間為目標，構建機場行李卸載轉盤指派之模式。在求解方法上，因模式問題規模龐大，本研究發展一啟發式演算法，利用撰寫基因演算法並搭配2-OPT區域搜尋法求解問題。而為評估模式之實用性，本研究以國內某國際機場為例進行範例測試，並針對不同參數進行敏感度分析，結果顯示本研究提出之模式在航班指派行李卸載轉盤上能有效規劃，故本研究之模式與求解演算法可提供決策單位作為航班指派行李卸載轉盤規劃之參考。 | zh_TW |
| dc.description.abstract | Taoyuan International Airport is actively preparing to become a transit hub in East Asia by expanding new routes. In addition to activating the airport MRT and the construction of third terminal, the existing second terminal is also going to update such as various hardware, software and runway construction projects. Among those, the straight-line baggage conveyor in the departure section had been updated to baggage loading carousel in 2015, hoping to improve the efficiency. As the traffic at Taoyuan International Airport grows significantly and there are more than 100,000 pieces of luggage transported everyday, the current practice still depends on manual labor to perform the planning of luggage transportation which lacks systematic integration and causes resource waste. Therefore, this study refers to flight traffic forecast and considers the complexity of practical problems to construct an assignment model for luggage carousel at the airport.
In this study we use the mathematical programming method to formulate a luggage carousel assignment model to minimize the overlapping time between flights. The proposed model is characterized as NP-hard. To solve the large scale problem efficiently, a genetic algorithm, coupled with a 2-OPT local search, is developed. Finally, a case study using real data from an international airport in Taiwan is performed to evaluate the model and the heuristic algorithm. The results show that the model and the algorithm are useful for assigning luggage carousel and decrease the overlapping time between flights efficiently. | en_US |
| DC.subject | 行李卸載轉盤 | zh_TW |
| DC.subject | 基因演算法 | zh_TW |
| DC.subject | 2-OPT區域搜尋 | zh_TW |
| DC.subject | 行李分揀系統 | zh_TW |
| DC.subject | 共用資源指派 | zh_TW |
| DC.subject | Luggage loading carousel | en_US |
| DC.subject | Genetic algorithm | en_US |
| DC.subject | 2-OPT | en_US |
| DC.subject | Baggage handling system | en_US |
| DC.subject | Common use resource assignment | en_US |
| DC.title | 機場行李卸載轉盤指派問題之研究 | zh_TW |
| dc.language.iso | zh-TW | zh-TW |
| DC.title | The Airport Luggage Loading Carousel Assignment Problem | en_US |
| DC.type | 博碩士論文 | zh_TW |
| DC.type | thesis | en_US |
| DC.publisher | National Central University | en_US |