study on fleet assignment problem model and algorithm

Clicks: 82
ID: 180410
2013
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Popular

Ranked #817 of 1,093 articles by views in journal of power sources

Most read Least read

Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 1,093 in total.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Abstract
The Fleet Assignment Problem (FAP) of aircraft scheduling in airlines is studied, and the optimization model of FAP is proposed. The objective function of this model is revenue maximization, and it considers comprehensively the difference of scheduled flights and aircraft models in flight areas and mean passenger flows. In order to solve the model, a self-adapting genetic algorithm is supposed to solve the model, which uses natural number coding, adjusts dynamically crossover and mutation operator probability, and adopts intelligent heuristic adjusting to quicken optimization pace. The simulation with production data of an airline shows that the model and algorithms suggested in this paper are feasible and have a good application value.
Reference Key
li2013mathematicalstudy Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors ;Yaohua Li;Na Tan
Journal journal of power sources
Year 2013
DOI
10.1155/2013/581586
URL
Keywords

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

No comments yet. Be the first to comment on this article.