IDEAS home Printed from https://ideas.repec.org/a/hin/jnddns/6049062.html
   My bibliography  Save this article

An Improved Whale Algorithm for Setting Standard Scheduled Block Time Based on the Airline Fairness

Author

Listed:
  • Qian Wang
  • Yong Tian
  • Lili Lin
  • Ratnaji Vanga
  • Lina Ma

Abstract

Standard scheduled flight block time (SBT) setting is of great concern for Civil Aviation Administration of China (CAAC) and airlines in China. However, the standard scheduled flight block times are set in the form of on-site meetings in practice and current literature has not provided any efficient mathematical models to calculate the flight block times fairly among the airlines. The objective of this paper is to develop and solve a mathematical model for standard SBT setting with consideration of both fairness and reliability. We use whale optimization algorithm (WOA) and an improved version of the whale optimization algorithm (IWOA) to solve the SBT setting problem. A novel nonlinear update equation of convergence factor for random iterations is used in place of the original linear one in the proposed IWOA algorithm. Experimental results show that the suggested approach is effective, and IWOA performs better than WOA in the concerned problem, whose solutions are better compared to the flight block times released by CAAC. In particular, it is interesting to find that MSE, RMSE, MAE, MAPE and Theil of the reliability in 60%–70% range are always the smallest and the average fairness of airlines is better than that of 60%–75% range. The model and solving approach presented in this article have great potential to be applied by CAAC to determine the standard SBTs strategically.

Suggested Citation

  • Qian Wang & Yong Tian & Lili Lin & Ratnaji Vanga & Lina Ma, 2020. "An Improved Whale Algorithm for Setting Standard Scheduled Block Time Based on the Airline Fairness," Discrete Dynamics in Nature and Society, Hindawi, vol. 2020, pages 1-14, October.
  • Handle: RePEc:hin:jnddns:6049062
    DOI: 10.1155/2020/6049062
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/DDNS/2020/6049062.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/DDNS/2020/6049062.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2020/6049062?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnddns:6049062. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.