航空公司餐車短期調度最佳化之研究

NCUIR > Engineering College > Graduate Institute of Civil Engineering > Electronic Thesis & Dissertation > Item 987654321/94447

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

Title:	航空公司餐車短期調度最佳化之研究
Authors:	陳章樑;Chen, Chang-Liang
Contributors:	土木工程學系
Keywords:	餐車調度;替代性;時空網路;最佳化;trolley scheduling;substitutability;time-space network;optimization
Date:	2024-07-22
Issue Date:	2024-10-09 14:44:08 (UTC+8)
Publisher:	國立中央大學
Abstract:	隨著旅遊風氣盛行，航空運量逐年增加外航空餐飲之需求也隨之增加，不論在全服務型航空(Full Service Airline, FSA)還是低成本航空(Low-cost Carrier, LCC)上都有飲食需求只是後者屬於加購型。一旦需要機上餐食就必須利用餐車(Trolley)來發送餐食，因此餐車扮演著運送和分發食物、飲料和其他物品之重要角色。目前實務上調度餐車之作法是將機上全部之餐車容量裝滿後載至目的地，若目的地機場之滯留數量過多則將載回出發地，這種以備不時之需又沒有規劃之調度方式會顯得很沒有效率，且會增加地勤作業時間及燃油成本等，因此本研究針對餐車調度最佳化模式進行探討，希望以此改善目前實務上之調度方法。本研究以時空網路流動技巧及數學規劃方式，在考量兩種餐車之替代性等相關限制條件下，以追求最小化餐車延台公里為目標，建構出餐車調度最佳化模式，並利用C++程式語言搭配CPLEX數學規劃進行求解。為評估模式之實用性，本研究以國內某家航空公司之相關資料為例進行範例測試，並測試不同參數之敏感度分析和方案分析，結果顯示本研究之模式在實務上能有效運作，可提供給航空公司做決策時之參考依據。 ;With the growing popularity of travel, the demand for airline catering has increased along with the annual rise in air traffic. This demand exists for both Full Service Airlines (FSA) and Low-Cost Carriers (LCC), although for the latter, meals are an add-on option. Once there is a need for in-flight meals, it becomes essential to utilize trolleys for distributing these meals. Therefore, trolleys play a crucial role in transporting and distributing food, beverages, and other items. Currently, the practical approach to scheduling trolleys involves filling all trolley capacity on board and transporting them to the destination. Once at the destination, all trolleys are unloaded. However, if there is an excess number of trolleys at the destination airport, the surplus must be reloaded onto the plane and transported back to the original airport. This unplanned scheduling method, done for contingency purposes, appears highly inefficient, increasing ground handling time and fuel costs. Therefore, this study explores the optimization of trolley scheduling to improve the current practical methods. This study employs time-space network flow techniques and mathematical programming methods, considering constraints such as the substitutability of two types of trolleys. A model for optimal trolley scheduling is constructed with the objective of minimizing trolley-kilometers. The C++ programming language is used in conjunction with CPLEX mathematical programming to solve the model. To evaluate the model′s practicality, relevant data from a domestic airline is used as a case study. Sensitivity analysis and scenario analysis with different parameters are conducted. The results indicate that the model developed in this study can operate effectively in practice and can serve as a reference for airlines in their decision-making processes.
Appears in Collections:	[Graduate Institute of Civil Engineering] Electronic Thesis & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	40	View/Open

社群 sharing

Loading...