Name
Title | ||
|---|---|---|
Flower pollination algorithm with runway balance strategy for the aircraft landing scheduling problem. |
Abstract | ||
|---|---|---|
Aircraft landing scheduling is a challenging problem in the field of air traffic, whose objective is to determine the best combination of assigning the sequence and corresponding landing time for a given set of aircraft to a runway, and then minimize the sum of the deviations of the actual and target landing times under the condition of safe landing. In this paper, a flower pollination algorithm embedded with runway balance is proposed to solve it. Context cognitive learning and runway balance strategy are devised here to enhance its searching ability. 36 scheduling instances are selected from OR-Library to validate its performance. The experimental results show that the proposed algorithm can get the optimal solutions for instances up to 100 aircrafts, and is also capable of obtaining better solutions compared with SS, BA and FCFS for instances up to 500 aircrafts in a shorter time. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/s10586-018-2051-0 | Cluster Computing |
Keywords | Field | DocType |
Aircraft landing scheduling, Context cognitive learning, Flower pollination algorithm, Runway balance, Walking one strategy | Job shop scheduling,Aircraft landing,Air traffic control,Computer science,Scheduling (computing),Algorithm,Real-time computing,Runway | Journal |
Volume | Issue | ISSN |
21 | 3 | 1386-7857 |
Citations | PageRank | References |
3 | 0.38 | 18 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guo Zhou | 1 | 54 | 1.81 |
| Rui Wang | 2 | 139 | 53.65 |
| Yongquan Zhou | 3 | 431 | 48.08 |