An efficient approximation algorithm for aircraft arrival sequencing and scheduling problem (Q1717908): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Changed an Item
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank

Revision as of 08:20, 28 February 2024

scientific article
Language Label Description Also known as
English
An efficient approximation algorithm for aircraft arrival sequencing and scheduling problem
scientific article

    Statements

    An efficient approximation algorithm for aircraft arrival sequencing and scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 February 2019
    0 references
    Summary: The aircraft arrival sequencing and scheduling (ASS) problem is a salient problem in airports' runway scheduling system, which proves to be nondeterministic polynomial (NP) hard. This paper formulates the ASS in the form of a constrained permutation problem and designs a new approximation algorithm to solve it. Then the numerical study is conducted, which validates that this new algorithm has much better performance than ant colony (AC) algorithm and CPLEX, especially when the aircraft types are not too many. In the end, some conclusions are summarized.
    0 references

    Identifiers