IDEAS home Printed from https://ideas.repec.org/a/eee/jaitra/v124y2025ics0969699725000080.html
   My bibliography  Save this article

Schedule optimization and staff allocation for airport security checkpoints using guided simulated annealing and integer linear programming

Author

Listed:
  • Brun, Alexis
  • Feron, Eric
  • Alam, Sameer
  • Delahaye, Daniel

Abstract

Security checkpoints are an important matter of concern for airport operators. When functioning effectively, they not only maintain the airport overall safety at a high level, but also provide passengers with a positive airport experience. The perceived quality of service at the airport greatly depends on the time spent by passengers at the security lines. To ensure optimal safety performance, screening lines have a limited capacity of passengers they can handle. Thus, to prevent extended waiting times for passengers, airports can only adjust the number of simultaneously open check lines. The airport operator must establish optimal schedules for opening security checkpoints and allocating necessary staff. Building upon a prior study focused on predicting the flow of passengers through the security checkpoints, this paper explores simulated annealing algorithm in conjunction with a queue simulator and an integer programming algorithm to establish the most effective opening schedule for security checkpoints based on the prediction given by this previous study. The presented approach also determines the best allocation for dedicated staff based on the forecasted passenger flow. This approach limits the number of open security lines and ensures a waiting time below the maximum limit of 45 min set by the airport. It also complies with the work regulations that security agents are subject to.

Suggested Citation

  • Brun, Alexis & Feron, Eric & Alam, Sameer & Delahaye, Daniel, 2025. "Schedule optimization and staff allocation for airport security checkpoints using guided simulated annealing and integer linear programming," Journal of Air Transport Management, Elsevier, vol. 124(C).
  • Handle: RePEc:eee:jaitra:v:124:y:2025:i:c:s0969699725000080
    DOI: 10.1016/j.jairtraman.2025.102746
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0969699725000080
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.jairtraman.2025.102746?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
    ---><---

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

    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:jaitra:v:124:y:2025:i:c:s0969699725000080. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/journal-of-air-transport-management/ .

    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.