IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v7y1973i1p34-48.html
   My bibliography  Save this article

A Technique for the Solution of Massive Set Covering Problems, with Application to Airline Crew Scheduling

Author

Listed:
  • Jerrold Rubin

    (Philadelphia Scientific Center, IBM Corp., Philadelphia, Pennsylvania)

Abstract

Recent set covering algorithms have been able to solve problems for which the constraint matrix has as many as 10 columns. Unfortunately, in certain applications, the number of columns is combinatorially dependent on the number of rows, and can reach many orders of magnitude greater, for 500--1,000 rows. For these problems, the constraint matrix cannot be generated, much less solved, unless severe ad hoc limitations are imposed. It stems clear that we must reluctantly abandon the search for the true mathematical optimum in such cases. One method of attack is to use a set covering algorithm repeatedly on much smaller matrices extracted from the overall problem, generating columns as needed. Such an approach has been used on an airline crew-scheduling problem, with excellent practical success on test cases involving close to 1,000 rows. It utilizes some techniques that are more generally applicable, and some that make use of the structure of the crew-scheduling problem, and that therefore are specific to it.

Suggested Citation

  • Jerrold Rubin, 1973. "A Technique for the Solution of Massive Set Covering Problems, with Application to Airline Crew Scheduling," Transportation Science, INFORMS, vol. 7(1), pages 34-48, February.
    • Handle: RePEc:inm:ortrsc:v:7:y:1973:i:1:p:34-48
    DOI: 10.1287/trsc.7.1.34
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.7.1.34
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.7.1.34?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
    ---><---

    Citations

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


    Cited by:

    1. Desaulniers, G. & Desrosiers, J. & Dumas, Y. & Marc, S. & Rioux, B. & Solomon, M. M. & Soumis, F., 1997. "Crew pairing at Air France," European Journal of Operational Research, Elsevier, vol. 97(2), pages 245-259, March.
    2. Yan, Shangyao & Chang, Jei-Chi, 2002. "Airline cockpit crew scheduling," European Journal of Operational Research, Elsevier, vol. 136(3), pages 501-511, February.
    3. E. Rod Butchers & Paul R. Day & Andrew P. Goldie & Stephen Miller & Jeff A. Meyer & David M. Ryan & Amanda C. Scott & Chris A. Wallace, 2001. "Optimized Crew Scheduling at Air New Zealand," Interfaces, INFORMS, vol. 31(1), pages 30-56, February.
    4. Balaji Gopalakrishnan & Ellis. Johnson, 2005. "Airline Crew Scheduling: State-of-the-Art," Annals of Operations Research, Springer, vol. 140(1), pages 305-337, November.
    5. Wark, Peter & Holt, John & Ronnqvist, Mikael & Ryan, David, 1997. "Aircrew schedule generation using repeated matching," European Journal of Operational Research, Elsevier, vol. 102(1), pages 21-35, October.
    6. Sarin, Subhash C. & Aggarwal, Sanjay, 2001. "Modeling and algorithmic development of a staff scheduling problem," European Journal of Operational Research, Elsevier, vol. 128(3), pages 558-569, February.
    7. Lucic, Panta & Teodorovic, Dusan, 1999. "Simulated annealing for the multi-objective aircrew rostering problem," Transportation Research Part A: Policy and Practice, Elsevier, vol. 33(1), pages 19-45, January.
    8. Joyce W. Yen & John R. Birge, 2006. "A Stochastic Programming Approach to the Airline Crew Scheduling Problem," Transportation Science, INFORMS, vol. 40(1), pages 3-14, February.
    9. Beasley, J. E. & Cao, B., 1996. "A tree search algorithm for the crew scheduling problem," European Journal of Operational Research, Elsevier, vol. 94(3), pages 517-526, November.
    10. Monique Guignard & Ellis Johnson & Kurt Spielberg, 2005. "Logical Processing for Integer Programming," Annals of Operations Research, Springer, vol. 140(1), pages 263-304, November.

    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:inm:ortrsc:v:7:y:1973:i:1:p:34-48. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.