IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v190y2008i1p277-291.html
   My bibliography  Save this article

Scheduling aircraft landings using airlines' preferences

Author

Listed:
  • Soomer, M.J.
  • Franx, G.J.

Abstract

Arrival runways are a critical resource in the air traffic system. Arrival delays have a great impact on airline operations and cost. Therefore, tactical arrival planning is becoming increasingly important. In this paper, we consider the tactical single runway arrival problem. The current focus on collaborative decision making is reflected by giving airlines the possibility to provide cost functions related to arrival delays for their flights. A scaling method for these cost is introduced to ensure equity. Our formulation will assign landing times to the flights, while taking the costs into account. A problem-specific local search heuristic has been implemented to obtain reasonable solutions within acceptable computation times. A large number of instances, created using schedule data from a major European hub, have been tested. These experiments show large cost savings for the airlines compared to current practice. All airlines achieve improvements, which is important for the acceptance of the method. The heuristic is able to solve instances with over 100 flights in a few minutes. A simulation experiment shows the method can also be used in a dynamic setting and produces robust schedules.

Suggested Citation

  • Soomer, M.J. & Franx, G.J., 2008. "Scheduling aircraft landings using airlines' preferences," European Journal of Operational Research, Elsevier, vol. 190(1), pages 277-291, October.
    • Handle: RePEc:eee:ejores:v:190:y:2008:i:1:p:277-291
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)00569-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Giovanni Andreatta & Lorenzo Brunetta & Guglielmo Guastalla, 2000. "From Ground Holding to Free Flight: An Exact Approach," Transportation Science, INFORMS, vol. 34(4), pages 394-401, November.
    2. J E Beasley & J Sonander & P Havelock, 2001. "Scheduling aircraft landings at London Heathrow using a population heuristic," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(5), pages 483-493, May.
    3. J E Beasley & M Krishnamoorthy & Y M Sharaiha & D Abramson, 2004. "Displacement problem and dynamically scheduling aircraft landings," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(1), pages 54-64, January.
    4. Octavio Richetta, 1995. "Optimal Algorithms and a Remarkably Efficient Heuristic for the Ground-Holding Problem in Air Traffic Control," Operations Research, INFORMS, vol. 43(5), pages 758-770, October.
    5. S.J. Rassenti & V.L. Smith & R.L. Bulfin, 1982. "A Combinatorial Auction Mechanism for Airport Time Slot Allocation," Bell Journal of Economics, The RAND Corporation, vol. 13(2), pages 402-417, Autumn.
    6. Robert Hoffman & Michael O. Ball, 2000. "A Comparison of Formulations for the Single-Airport Ground-Holding Problem with Banking Constraints," Operations Research, INFORMS, vol. 48(4), pages 578-590, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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.
    2. Marie-Sklaerder Vié & Nicolas Zufferey & Roel Leus, 2022. "Aircraft landing planning under uncertain conditions," Journal of Scheduling, Springer, vol. 25(2), pages 203-228, April.
    3. 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.
    4. Pellegrini, Paola & Rodriguez, Joaquin, 2013. "Single European Sky and Single European Railway Area: A system level analysis of air and rail transportation," Transportation Research Part A: Policy and Practice, Elsevier, vol. 57(C), pages 64-86.
    5. Lorenzo Castelli & Paola Pellegrini & Raffaele Pesenti, 2012. "Airport slot allocation in Europe: economic efficiency and fairness," International Journal of Revenue Management, Inderscience Enterprises Ltd, vol. 6(1/2), pages 28-44.
    6. Ghoniem, Ahmed & Farhadi, Farbod & Reihaneh, Mohammad, 2015. "An accelerated branch-and-price algorithm for multiple-runway aircraft sequencing problems," European Journal of Operational Research, Elsevier, vol. 246(1), pages 34-43.
    7. Dönmez, Kadir & Çetek, Cem & Kaya, Onur, 2022. "Air traffic management in parallel-point merge systems under wind uncertainties," Journal of Air Transport Management, Elsevier, vol. 104(C).
    8. Agnetis, Alessandro & Chen, Bo & Nicosia, Gaia & Pacifici, Andrea, 2019. "Price of fairness in two-agent single-machine scheduling problems," European Journal of Operational Research, Elsevier, vol. 276(1), pages 79-87.
    9. Marcella Samà & Andrea D’Ariano & Konstantin Palagachev & Matthias Gerdts, 2019. "Integration methods for aircraft scheduling and trajectory optimization at a busy terminal manoeuvring area," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(3), pages 641-681, September.
    10. Anna Kwasiborska & Jacek Skorupski, 2021. "Assessment of the Method of Merging Landing Aircraft Streams in the Context of Fuel Consumption in the Airspace," Sustainability, MDPI, vol. 13(22), pages 1-18, November.
    11. Bennell, Julia A. & Mesgarpour, Mohammad & Potts, Chris N., 2017. "Dynamic scheduling of aircraft landings," European Journal of Operational Research, Elsevier, vol. 258(1), pages 315-327.
    12. 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.
    13. Kapolke, Manu & Fürstenau, Norbert & Heidt, Andreas & Liers, Frauke & Mittendorf, Monika & Weiß, Christian, 2016. "Pre-tactical optimization of runway utilization under uncertainty," Journal of Air Transport Management, Elsevier, vol. 56(PA), pages 48-56.
    14. Senay Solak & Gustaf Solveling & John-Paul B. Clarke & Ellis L. Johnson, 2018. "Stochastic Runway Scheduling," Transportation Science, INFORMS, vol. 52(4), pages 917-940, August.
    15. Faye, Alain, 2015. "Solving the Aircraft Landing Problem with time discretization approach," European Journal of Operational Research, Elsevier, vol. 242(3), pages 1028-1038.
    16. Julia Bennell & Mohammad Mesgarpour & Chris Potts, 2013. "Airport runway scheduling," Annals of Operations Research, Springer, vol. 204(1), pages 249-270, April.
    17. Yunqiang Yin & Du‐Juan Wang & Chin‐Chia Wu & T.C.E. Cheng, 2016. "CON/SLK due date assignment and scheduling on a single machine with two agents," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(5), pages 416-429, August.
    18. 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.
    19. Pellegrini, Paola & Castelli, Lorenzo & Pesenti, Raffaele, 2012. "Secondary trading of airport slots as a combinatorial exchange," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(5), pages 1009-1022.
    20. Wang, Jun-Qiang & Fan, Guo-Qiang & Zhang, Yingqian & Zhang, Cheng-Wu & Leung, Joseph Y.-T., 2017. "Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes," European Journal of Operational Research, Elsevier, vol. 258(2), pages 478-490.

    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. Balázs Kotnyek & Octavio Richetta, 2006. "Equitable Models for the Stochastic Ground-Holding Problem Under Collaborative Decision Making," Transportation Science, INFORMS, vol. 40(2), pages 133-146, May.
    2. 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.
    3. Cynthia Barnhart & Dimitris Bertsimas & Constantine Caramanis & Douglas Fearing, 2012. "Equitable and Efficient Coordination in Traffic Flow Management," Transportation Science, INFORMS, vol. 46(2), pages 262-280, May.
    4. Hancerliogullari, Gulsah & Rabadi, Ghaith & Al-Salem, Ameer H. & Kharbeche, Mohamed, 2013. "Greedy algorithms and metaheuristics for a multiple runway combined arrival-departure aircraft sequencing problem," Journal of Air Transport Management, Elsevier, vol. 32(C), pages 39-48.
    5. Pinol, H. & Beasley, J.E., 2006. "Scatter Search and Bionomic Algorithms for the aircraft landing problem," European Journal of Operational Research, Elsevier, vol. 171(2), pages 439-462, June.
    6. Faye, Alain, 2015. "Solving the Aircraft Landing Problem with time discretization approach," European Journal of Operational Research, Elsevier, vol. 242(3), pages 1028-1038.
    7. 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.
    8. Ng, K.K.H. & Lee, C.K.M. & Chan, Felix T.S. & Qin, Yichen, 2017. "Robust aircraft sequencing and scheduling problem with arrival/departure delay using the min-max regret approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 115-136.
    9. 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.
    10. Pellegrini, Paola & Rodriguez, Joaquin, 2013. "Single European Sky and Single European Railway Area: A system level analysis of air and rail transportation," Transportation Research Part A: Policy and Practice, Elsevier, vol. 57(C), pages 64-86.
    11. Avijit Mukherjee & Mark Hansen, 2007. "A Dynamic Stochastic Model for the Single Airport Ground Holding Problem," Transportation Science, INFORMS, vol. 41(4), pages 444-456, November.
    12. Julia Bennell & Mohammad Mesgarpour & Chris Potts, 2013. "Airport runway scheduling," Annals of Operations Research, Springer, vol. 204(1), pages 249-270, April.
    13. Bennell, Julia A. & Mesgarpour, Mohammad & Potts, Chris N., 2017. "Dynamic scheduling of aircraft landings," European Journal of Operational Research, Elsevier, vol. 258(1), pages 315-327.
    14. Cavusoglu, Sabriye Sera & Macário, Rosário, 2021. "Minimum delay or maximum efficiency? Rising productivity of available capacity at airports: Review of current practice and future needs," Journal of Air Transport Management, Elsevier, vol. 90(C).
    15. Mishra, Debasis & Parkes, David C., 2007. "Ascending price Vickrey auctions for general valuations," Journal of Economic Theory, Elsevier, vol. 132(1), pages 335-366, January.
    16. Thomas W. M. Vossen & Michael O. Ball, 2006. "Slot Trading Opportunities in Collaborative Ground Delay Programs," Transportation Science, INFORMS, vol. 40(1), pages 29-43, February.
    17. Paul J. Brewer & Charles R. Plott, 2002. "A Decentralized, Smart Market Solution to a Class of Back-Haul Transportation Problems: Concept and Experimental Test Beds," Interfaces, INFORMS, vol. 32(5), pages 13-36, October.
    18. Soumyakanti Chakraborty & Anup K. Sen & Amitava Bagchi, 2015. "Addressing the valuation problem in multi-round combinatorial auctions," Information Systems Frontiers, Springer, vol. 17(5), pages 1145-1160, October.
    19. Anthony M. Kwasnica & John O. Ledyard & Dave Porter & Christine DeMartini, 2005. "A New and Improved Design for Multiobject Iterative Auctions," Management Science, INFORMS, vol. 51(3), pages 419-434, March.
    20. Kursad Derinkuyu & Fehmi Tanrisever & Nermin Kurt & Gokhan Ceyhan, 2020. "Optimizing Day-Ahead Electricity Market Prices: Increasing the Total Surplus for Energy Exchange Istanbul," Manufacturing & Service Operations Management, INFORMS, vol. 22(4), pages 700-716, July.

    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:eee:ejores:v:190:y:2008:i:1:p:277-291. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.