DocumentCode
584308
Title
Study on GRAPS-ACO Algorithm for Irregular Flight Rescheduling
Author
Xiuli, Zhao ; Yanchi, Guo
Author_Institution
Sch. of Manage., Jiangsu Univ., Zhenjiang, China
fYear
2012
fDate
11-13 Aug. 2012
Firstpage
266
Lastpage
269
Abstract
Disrupted flight schedules trouble passengers travelling, and increase operation cost in airline. Irregular flight recovery is an NP-hard problem. This article develops a new hybrid heuristic procedure based on Greedy Random Adaptive Search Procedure (GRASP), and Ant Colony Optimization (ACO) is presented to solve this problem. As compared with the original GRASP method, the proposed algorithm demonstrates quite high global optimization capability. Computational experiments on large-scale problems show that the proposed procedure is able to generate feasible revised flight schedules of a good quality in less than 5 seconds.
Keywords
ant colony optimisation; greedy algorithms; randomised algorithms; scheduling; search problems; travel industry; GRAPS-ACO algorithm; GRASP; NP-hard problem; airline passengers; ant colony optimization; flight schedule disruption; global optimization capability; greedy random adaptive search procedure; hybrid heuristic procedure; irregular flight rescheduling; operation cost; Aircraft; Aircraft manufacture; Airports; Atmospheric modeling; Computational modeling; Maintenance engineering; Schedules; Ant Colony Optimization; GRASP; hybrid heuristics; schedule recovery;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science & Service System (CSSS), 2012 International Conference on
Conference_Location
Nanjing
Print_ISBN
978-1-4673-0721-5
Type
conf
DOI
10.1109/CSSS.2012.74
Filename
6394312
Link To Document