DocumentCode :
2927054
Title :
Real time genetic scheduling of aircraft landing times
Author :
Ciesielski, Vic ; Scerri, Paul
Author_Institution :
Dept. of Comput. Sci., R. Melbourne Inst. of Technol., Vic., Australia
fYear :
1998
fDate :
4-9 May 1998
Firstpage :
360
Lastpage :
364
Abstract :
Evolutionary approaches are not usually considered for real time scheduling problems due to long computation times and uncertainty about the length of the computation time. The authors argue that for some kinds of problems, such as optimizing aircraft landing times, genetic algorithms have advantages over other methods as a best solution is always available when needed, and, since the computation is inherently parallel, more processors can be added to get higher quality solutions if necessary. Furthermore, the computation time can be decreased and the quality of the generated schedules increased by seeding the genetic algorithm from a previous population. They have performed a series of experiments on landing data for Sydney airport on the busiest day of the year. Their results show that high quality solutions can be computed in the time window between aircraft landings
Keywords :
aircraft; computational complexity; genetic algorithms; real-time systems; scheduling; Sydney airport; aircraft landing times; computation time; evolutionary approaches; optimization; parallel processing; population; real time genetic scheduling; schedules; seeding; time window; Air traffic control; Aircraft; Airports; Genetic algorithms; Genetic mutations; Optimal scheduling; Optimization methods; Processor scheduling; Scheduling algorithm; Uncertainty;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Evolutionary Computation Proceedings, 1998. IEEE World Congress on Computational Intelligence., The 1998 IEEE International Conference on
Conference_Location :
Anchorage, AK
Print_ISBN :
0-7803-4869-9
Type :
conf
DOI :
10.1109/ICEC.1998.699759
Filename :
699759
Link To Document :
بازگشت