Based on Hub-Spoke Network a Practice Heuristic Algorithm Applied to Airline Fleet Assignment
The fleet assignment problem of Hub-spoke network airlines in making flight schedules is addressed.According to the demand distribution of passengers and resulting in the flight costs from the airline's historical data,an optimization algorithm by tabular operation method based on the flight cost model is designed,and an heuristic algorithm is proposed for flight planning specialist to facilitate manual calculation and to adjust aircraft types,which solves the airline fleet assignment 0-1 integer programming problem,The algorithm integrates the ideas of Hungarian algorithm and backtracking algorithm.Starting from the minimum cost of flight optimiza-tion,the algorithm searches the optimal value by the depth-first-search method subject to the optimization constraints,and backtracks in the nodes when the aircraft constraints are not met,finds the minimum flight cost that meets the aircraft side constraints,and obtains the optimal fleet assignment and hence gives a theoretical proof.The effectiveness of the heuristic algorithm is obtained through case study.The total cost of ten B737 and five B757 scenarios is found to be the lowest among all scenarios by manual calculation using the tabular method,reaching $409,860,which proves that a reasonable mix of aircraft types can make the company oper-ate better.Compared with the traditional operations research algorithm this algorithm is straightforward in construction and natural in optimization mechanism,which is simple and practical,also easy to understand and master,especially for small airlines or branches to manually formulate and adjust flight schedules.
万方数据
维普
