IDEAS home Printed from https://ideas.repec.org/a/ids/eujine/v16y2022i2p215-240.html
   My bibliography  Save this article

Solving an integrated mathematical model for crew pairing and rostering problems by an ant colony optimisation algorithm

Author

Listed:
  • Saeed Saemi
  • Alireza Rashidi Komijan
  • Reza Tavakkoli-Moghaddam
  • Mohammad Fallah

Abstract

The crew pairing problem (CPP) and the crew rostering problem (CRP) are two sub-problems of a crew scheduling problem (CSP). Solving these problems based on a sequential approach may not yield the optimum solution. Therefore, the present study aims to consider the integrated CPP and CRP and present a new mathematical formulation. Due to its NP-hardness complexity, a meta-heuristic algorithm based on ant colony optimisation (ACO) is designed and used to solve the integrated problem and sequential approach (CRP followed by CPP) in some test problems extracted from a data set. The solutions provided by ACO for the integrated problem show 21.64% cost reduction in a reasonable time increase in comparison with those obtained by the sequential approach. Also, the ACO algorithm can provide solutions with a 2.96% average gap to the optimal solutions (by the exact method) for small-sized problems. Also, the proposed integrated approach leads to solutions with the best/optimal number of crew members to be assigned. The findings indicate that the proposed ACO has an efficient performance in solving the integrated problem. [Received: 20 May 2020; Accepted: 8 April 2021]

Suggested Citation

  • Saeed Saemi & Alireza Rashidi Komijan & Reza Tavakkoli-Moghaddam & Mohammad Fallah, 2022. "Solving an integrated mathematical model for crew pairing and rostering problems by an ant colony optimisation algorithm," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 16(2), pages 215-240.
    • Handle: RePEc:ids:eujine:v:16:y:2022:i:2:p:215-240
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=121188
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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:ids:eujine:v:16:y:2022:i:2:p:215-240. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=210 .

    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.