Research Article
An Airport Stand Assignment Problem considering the Passenger Boarding Distance
Algorithm 1
The NSGA-II algorithm for stand assignment pseudocode.
| Input: , , , , , , , , , , | (1) | Get by + | (2) | Initialize the population (·) | (3) | for to do | (4) | Selection cells in mating pool | (5) | Crossover and mutate of cells | (6) | Offspring cells into new population | (7) | if stand assignment not satisfy constraints then | (8) | Regenerate and replace set of flights’ stands | (9) | end if | (10) | Calculate objective functions result | (11) | Nondominate sort the cells | (12) | Calculate the crowd distance | (13) | Sort population in descending order | (14) | end for | | Output: Best solution for stand assignment |
|