English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

In this paper, a strategy based on Branch-andbound algorithm for an optimization problem was proposed, a scheduling method solving airliner fleet assignment problem was analyzed. By building a model, the requirement of balanced application of airplanes was transformed to optimizing schemes. The graph’s depth-first search and Branch-and -bound algorithm were presented. The algorithm was used in an example. As the result, the time cost of the optimized fleet assignment for 70 flights a day with 12 A320 aircrafts was less than 0.3 second, which was one order of magnitude less than that of the genetic algorithm. The experiment results show that the method is an effective way for fleet assignment problem and has high practical application value. KeywordsBranch-and-bound algorithm; fleet assignment problem; genetic algorithm; building mode

Fleet Assignment Problem Study Based on Branch-and-bound Algorithm