IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0196146.html
   My bibliography  Save this article

A bi-objective integer programming model for partly-restricted flight departure scheduling

Author

Listed:
  • Han Zhong
  • Wei Guan
  • Wenyi Zhang
  • Shixiong Jiang
  • Lingling Fan

Abstract

The normal studies on air traffic departure scheduling problem (DSP) mainly deal with an independent airport in which the departure traffic is not affected by surrounded airports, which, however, is not a consistent case. In reality, there still exist cases where several commercial airports are closely located and one of them possesses a higher priority. During the peak hours, the departure activities of the lower-priority airports are usually required to give way to those of higher-priority airport. These giving-way requirements can inflict a set of changes on the modeling of departure scheduling problem with respect to the lower-priority airports. To the best of our knowledge, studies on DSP under this condition are scarce. Accordingly, this paper develops a bi-objective integer programming model to address the flight departure scheduling of the partly-restricted (e.g., lower-priority) one among several adjacent airports. An adapted tabu search algorithm is designed to solve the current problem. It is demonstrated from the case study of Tianjin Binhai International Airport in China that the proposed method can obviously improve the operation efficiency, while still realizing superior equity and regularity among restricted flows.

Suggested Citation

  • Han Zhong & Wei Guan & Wenyi Zhang & Shixiong Jiang & Lingling Fan, 2018. "A bi-objective integer programming model for partly-restricted flight departure scheduling," PLOS ONE, Public Library of Science, vol. 13(5), pages 1-18, May.
  • Handle: RePEc:plo:pone00:0196146
    DOI: 10.1371/journal.pone.0196146
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0196146
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0196146&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0196146?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
    ---><---

    References listed on IDEAS

    as
    1. L. Bianco & P. Dell'Olmo & S. Giordani, 1999. "Minimizing total completion time subject to release dates and sequence‐dependentprocessing times," Annals of Operations Research, Springer, vol. 86(0), pages 393-415, January.
    2. Lucio Bianco & Salvatore Ricciardelli & Giovanni Rinaldi & Antonio Sassano, 1988. "Scheduling tasks with sequence‐dependent processing times," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(2), pages 177-184, April.
    3. Lieder, Alexander & Briskorn, Dirk & Stolletz, Raik, 2015. "A dynamic programming approach for the aircraft landing problem with aircraft classes," European Journal of Operational Research, Elsevier, vol. 243(1), pages 61-69.
    4. J. E. Beasley & M. Krishnamoorthy & Y. M. Sharaiha & D. Abramson, 2000. "Scheduling Aircraft Landings—The Static Case," Transportation Science, INFORMS, vol. 34(2), pages 180-197, May.
    5. Jason A. D. Atkin & Edmund K. Burke & John S. Greenwood & Dale Reeson, 2007. "Hybrid Metaheuristics to Aid Runway Scheduling at London Heathrow Airport," Transportation Science, INFORMS, vol. 41(1), pages 90-106, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ahmed Ghoniem & Hanif D. Sherali & Hojong Baik, 2014. "Enhanced Models for a Mixed Arrival-Departure Aircraft Sequencing Problem," INFORMS Journal on Computing, INFORMS, vol. 26(3), pages 514-530, August.
    2. Guépet, Julien & Briant, Olivier & Gayon, Jean-Philippe & Acuna-Agost, Rodrigo, 2017. "Integration of aircraft ground movements and runway operations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 104(C), pages 131-149.
    3. Bo Xu & Weimin Ma & Hui Huang & Lei Yue, 2016. "Weighted Constrained Position Shift Model for Aircraft Arrival Sequencing and Scheduling Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(04), pages 1-22, August.
    4. Jason A. D. Atkin & Edmund K. Burke & John S. Greenwood & Dale Reeson, 2009. "An examination of take-off scheduling constraints at London Heathrow airport," Public Transport, Springer, vol. 1(3), pages 169-187, August.
    5. Daniel Karapetyan & Jason A. D. Atkin & Andrew J. Parkes & Juan Castro-Gutierrez, 2017. "Lessons from building an automated pre-departure sequencer for airports," Annals of Operations Research, Springer, vol. 252(2), pages 435-453, May.
    6. Rakesh Prakash & Jitamitra Desai & Rajesh Piplani, 2022. "An optimal data-splitting algorithm for aircraft sequencing on a single runway," Annals of Operations Research, Springer, vol. 309(2), pages 587-610, February.
    7. Jason A. D. Atkin & Geert De Maere & Edmund K. Burke & John S. Greenwood, 2013. "Addressing the Pushback Time Allocation Problem at Heathrow Airport," Transportation Science, INFORMS, vol. 47(4), pages 584-602, November.
    8. Pasquale Avella & Maurizio Boccia & Carlo Mannino & Igor Vasilyev, 2017. "Time-Indexed Formulations for the Runway Scheduling Problem," Transportation Science, INFORMS, vol. 51(4), pages 1196-1209, November.
    9. Julia Bennell & Mohammad Mesgarpour & Chris Potts, 2013. "Airport runway scheduling," Annals of Operations Research, Springer, vol. 204(1), pages 249-270, April.
    10. Geert De Maere & Jason A. D. Atkin & Edmund K. Burke, 2018. "Pruning Rules for Optimal Runway Sequencing," Transportation Science, INFORMS, vol. 52(4), pages 898-916, August.
    11. A R Brentnall & R C H Cheng, 2009. "Some effects of aircraft arrival sequence algorithms," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(7), pages 962-972, July.
    12. Salehipour, Amir, 2020. "An algorithm for single- and multiple-runway aircraft landing problem," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 175(C), pages 179-191.
    13. Jason A. D. Atkin & Edmund K. Burke & John S. Greenwood & Dale Reeson, 2007. "Hybrid Metaheuristics to Aid Runway Scheduling at London Heathrow Airport," Transportation Science, INFORMS, vol. 41(1), pages 90-106, February.
    14. Pohl, Maximilian & Kolisch, Rainer & Schiffer, Maximilian, 2021. "Runway scheduling during winter operations," Omega, Elsevier, vol. 102(C).
    15. J. E. Beasley & M. Krishnamoorthy & Y. M. Sharaiha & D. Abramson, 2000. "Scheduling Aircraft Landings—The Static Case," Transportation Science, INFORMS, vol. 34(2), pages 180-197, May.
    16. Lieder, Alexander & Stolletz, Raik, 2016. "Scheduling aircraft take-offs and landings on interdependent and heterogeneous runways," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 88(C), pages 167-188.
    17. Zhang, Junfeng & Zhao, Pengli & Zhang, Yu & Dai, Ximei & Sui, Dong, 2020. "Criteria selection and multi-objective optimization of aircraft landing problem," Journal of Air Transport Management, Elsevier, vol. 82(C).
    18. Samà, Marcella & D’Ariano, Andrea & D’Ariano, Paolo & Pacciarelli, Dario, 2017. "Scheduling models for optimal aircraft traffic control at busy airports: Tardiness, priorities, equity and violations considerations," Omega, Elsevier, vol. 67(C), pages 81-98.
    19. Heidt, Andreas & Helmke, Hartmut & Kapolke, Manu & Liers, Frauke & Martin, Alexander, 2016. "Robust runway scheduling under uncertain conditions," Journal of Air Transport Management, Elsevier, vol. 56(PA), pages 28-37.
    20. Pohl, Maximilian & Artigues, Christian & Kolisch, Rainer, 2022. "Solving the time-discrete winter runway scheduling problem: A column generation and constraint programming approach," European Journal of Operational Research, Elsevier, vol. 299(2), pages 674-689.

    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:plo:pone00:0196146. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.