| Glen Stevens. An Approach to Scheduling Aircraft Landing Times Using Genetic Algorithms. Honours thesis, RMIT, Department of Computer Science, November 1995. |
....area added. This results in a sequence fixed length optimization problems. The encoding described above was chosen after considerable analysis and experimentation with alternatives. Originally we treated the problem as a rearrangement permutation problem and used order and position based operators[7]. A pair of genes on the chromosome corresponded to a 3 minute landing slot on each of two runways. Each slot contained the Id of the plane scheduled to land at that time. This encoding, while it is a relatively natural encoding of the problem had a number of disadvantages: 1. It resulted in ....
Glen Stevens. An Approach to Scheduling Aircraft Landing Times Using Genetic Algorithms. Honours thesis, RMIT, Department of Computer Science, November 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC