IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v50y1999i6d10.1057_palgrave.jors.2600728.html
   My bibliography  Save this article

Subgraph ejection chains and tabu search for the crew scheduling problem

Author

Listed:
  • L Cavique

    (Instituto Politécnico, EST)

  • C Rego

    (Faculdade de Ciências, DEIO)

  • I Themido

    (Instituto Superior Técnico, CESUR)

Abstract

The tabu search algorithms for the Crew Scheduling Problem (CSP) reported in this paper are part of a decision support system for crew scheduling management of the Lisbon Underground. The CPS is formulated as the minimum number of duties necessary to cover a pre-defined timetable under a set of contractual rules. An initial solution is constructed following a traditional run-cutting approach. Two alternative improvement algorithms are subsequently used to reduce the number of duties in the initial solution. Both algorithms are embedded in a tabu search framework: Tabu-crew takes advantage of a form of strategic oscillation for the neighbourhood search while the run-ejection algorithm considers compound moves based on a subgraph ejection chain method. Computational results are reported for a set of real problems.

Suggested Citation

  • L Cavique & C Rego & I Themido, 1999. "Subgraph ejection chains and tabu search for the crew scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(6), pages 608-616, June.
    • Handle: RePEc:pal:jorsoc:v:50:y:1999:i:6:d:10.1057_palgrave.jors.2600728
    DOI: 10.1057/palgrave.jors.2600728
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2600728
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2600728?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.

    Citations

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


    Cited by:

    1. Okan Örsan Özener & Melda Örmeci Matoğlu & Güneş Erdoğan & Mohamed Haouari & Hasan Sözer, 2017. "Solving a large-scale integrated fleet assignment and crew pairing problem," Annals of Operations Research, Springer, vol. 253(1), pages 477-500, June.
    2. Ciancio, Claudio & Laganà, Demetrio & Musmanno, Roberto & Santoro, Francesco, 2018. "An integrated algorithm for shift scheduling problems for local public transport companies," Omega, Elsevier, vol. 75(C), pages 139-153.
    3. Marta Gomes & Luís Cavique & Isabel Themido, 2006. "The crew timetabling problem: An extension of the crew scheduling problem," Annals of Operations Research, Springer, vol. 144(1), pages 111-132, April.
    4. Kress, Dominik & Meiswinkel, Sebastian & Pesch, Erwin, 2019. "Straddle carrier routing at seaport container terminals in the presence of short term quay crane buffer areas," European Journal of Operational Research, Elsevier, vol. 279(3), pages 732-750.
    5. Haase, Knut, 1999. "Retail business staff scheduling under complex labor relations," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 511, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    6. Rodriguez-Tello, Eduardo & Hao, Jin-Kao & Torres-Jimenez, Jose, 2008. "An improved simulated annealing algorithm for bandwidth minimization," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1319-1335, March.
    7. César Rego & Fred Glover, 2010. "Ejection chain and filter-and-fan methods in combinatorial optimization," Annals of Operations Research, Springer, vol. 175(1), pages 77-105, March.
    8. Mohamed Haouari & Farah Zeghal Mansour & Hanif D. Sherali, 2019. "A New Compact Formulation for the Daily Crew Pairing Problem," Transportation Science, INFORMS, vol. 53(3), pages 811-828, May.
    9. Ernst, A. T. & Jiang, H. & Krishnamoorthy, M. & Sier, D., 2004. "Staff scheduling and rostering: A review of applications, methods and models," European Journal of Operational Research, Elsevier, vol. 153(1), pages 3-27, February.
    10. Jaime Miranda & Pablo A. Rey & Antoine Sauré & Richard Weber, 2018. "Metro Uses a Simulation-Optimization Approach to Improve Fare-Collection Shift Scheduling," Interfaces, INFORMS, vol. 48(6), pages 529-542, November.
    11. Attila Tóth & Miklós Krész, 2013. "An efficient solution approach for real-world driver scheduling problems in urban bus transportation," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 21(1), pages 75-94, June.
    12. Shen, Yindong & Peng, Kunkun & Chen, Kai & Li, Jingpeng, 2013. "Evolutionary crew scheduling with adaptive chromosomes," Transportation Research Part B: Methodological, Elsevier, vol. 56(C), pages 174-185.
    13. Anthony Han & Elvis Li, 2014. "A constraint programming-based approach to the crew scheduling problem of the Taipei mass rapid transit system," Annals of Operations Research, Springer, vol. 223(1), pages 173-193, December.
    14. Rego, César & Duarte, Renato, 2009. "A filter-and-fan approach to the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 194(3), pages 650-662, May.
    15. G Beddoe & S Petrovic, 2007. "Enhancing case-based reasoning for personnel rostering with selected tabu search concepts," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(12), pages 1586-1598, December.

    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:pal:jorsoc:v:50:y:1999:i:6:d:10.1057_palgrave.jors.2600728. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.