Research Article
Weighted Time-Band Approximation Model for Flight Operations Recovery considering Simplex Group Cycle Approaches in China
Algorithm 1
Simplex group cycle partitioning (SGCP) algorithm (
Algorithm).
| Input: = Original flight schedule | | Aircraft = All the executive aircraft associated with the flights | | Output: Airport = An ordered list of all airports according to the number of related flights | | = The aircraft group in simplex group cycle | | = The flight group in simplex group cycle | | begin | | for each airport | | Count the related flights | | mark; | | Sort according to ; | | end /According to the node degree at the airport-flight adjacency graph, we sort the airport from large to small./ | | ; /where is the approximate simplex group cycle number/ | | = The related aircraft in airport ; | | for | | = The related aircraft in airport | | ; /Ensure that each aircraft is in the only one | | ; | | ; | | end | | if ; | | = The related aircraft in airport | | ; | | ; ; | | else output . | | end | | output , | | = The flight group comprised of all flights in all simplex group cycles; | | end |
|