IDEAS home Printed from https://ideas.repec.org/p/hhs/sdueko/2013_001.html
   My bibliography  Save this paper

A column generation approach for solving the patient admission scheduling problem

Author

Listed:
  • Range, Troels Martin

    (Department of Business and Economics)

  • Lusby, Richard Martin

    (Department of Engineering Management)

  • Larsen, Jesper

    (Department of Engineering Management)

Abstract

This paper addresses the Patient Admission Scheduling (PAS) problem. The PAS problem deals with assigning elective patients to beds, satisfying a number of soft and hard constraints. The problem can be seen as part of the functions of hospital management at an operational level. There exists a small number of different variants on this problem. We propose an optimization-based heuristic building on branch-and-bound, column generation, and dynamic constraint aggregation for one of the variants. We achieve tighter bounds than previously reported in the literature, and in addition we are able to produce new best solutions for five out of six instances from a publicly available repository.

Suggested Citation

  • Range, Troels Martin & Lusby, Richard Martin & Larsen, Jesper, 2013. "A column generation approach for solving the patient admission scheduling problem," Discussion Papers on Economics 1/2013, University of Southern Denmark, Department of Economics.
    • Handle: RePEc:hhs:sdueko:2013_001
    as

    Download full text from publisher

    File URL: https://www.sdu.dk/-/media/files/om_sdu/institutter/ivoe/disc_papers/disc_2013/dpbe1_2013.pdf
    File Function: Full text
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Issmail Elhallaoui & Abdelmoutalib Metrane & Guy Desaulniers & François Soumis, 2011. "An Improved Primal Simplex Algorithm for Degenerate Linear Programs," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 569-577, November.
    2. R Lusby & A Dohn & T M Range & J Larsen, 2012. "A column generation-based heuristic for rostering with work patterns," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 63(2), pages 261-277, February.
    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. Range, Troels Martin & Lusby, Richard Martin & Larsen, Jesper, 2013. "Solving the selective multi-category parallel-servicing problem," Discussion Papers on Economics 5/2013, University of Southern Denmark, Department of Economics.

    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. Range, Troels Martin & Lusby, Richard Martin & Larsen, Jesper, 2014. "A column generation approach for solving the patient admission scheduling problem," European Journal of Operational Research, Elsevier, vol. 235(1), pages 252-264.
    2. Omer, Jérémy & Soumis, François, 2015. "A linear programming decomposition focusing on the span of the nondegenerate columns," European Journal of Operational Research, Elsevier, vol. 245(2), pages 371-383.
    3. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
    4. Range, Troels Martin & Kozlowski, Dawid & Petersen, Niels Chr., 2019. "Dynamic job assignment: A column generation approach with an application to surgery allocation," European Journal of Operational Research, Elsevier, vol. 272(1), pages 78-93.
    5. Adil Tahir & Guy Desaulniers & Issmail El Hallaoui, 2022. "Integral Column Generation for Set Partitioning Problems with Side Constraints," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2313-2331, July.
    6. Philippe Racette & Frédéric Quesnel & Andrea Lodi & François Soumis, 2024. "Gaining insight into crew rostering instances through ML-based sequential assignment," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 32(3), pages 537-578, October.
    7. Abdelouahab Zaghrouti & Issmail El Hallaoui & François Soumis, 2020. "Improving set partitioning problem solutions by zooming around an improving direction," Annals of Operations Research, Springer, vol. 284(2), pages 645-671, January.
    8. Szymula, Christopher & Bešinović, Nikola, 2020. "Passenger-centered vulnerability assessment of railway networks," Transportation Research Part B: Methodological, Elsevier, vol. 136(C), pages 30-61.
    9. Rosat, Samuel & Quesnel, Frédéric & Elhallaoui, Issmail & Soumis, François, 2017. "Dynamic penalization of fractional directions in the integral simplex using decomposition: Application to aircrew scheduling," European Journal of Operational Research, Elsevier, vol. 263(3), pages 1007-1018.
    10. Guy Desaulniers & François Lessard & Mohammed Saddoune & François Soumis, 2020. "Dynamic Constraint Aggregation for Solving Very Large-scale Airline Crew Pairing Problems," SN Operations Research Forum, Springer, vol. 1(3), pages 1-23, September.
    11. Jérémy Omer & Samuel Rosat & Vincent Raymond & François Soumis, 2015. "Improved Primal Simplex: A More General Theoretical Framework and an Extended Experimental Analysis," INFORMS Journal on Computing, INFORMS, vol. 27(4), pages 773-787, November.
    12. Lusby, Richard Martin & Range, Troels Martin & Larsen, Jesper, 2016. "A Benders decomposition-based matheuristic for the Cardinality Constrained Shift Design Problem," European Journal of Operational Research, Elsevier, vol. 254(2), pages 385-397.
    13. Range, Troels Martin & Kozlowski, Dawid & Petersen, Niels Chr., 2016. "Dynamic job assignment: A column generation approach with an application to surgery allocation," Discussion Papers on Economics 4/2016, University of Southern Denmark, Department of Economics.
    14. Abdelouahab Zaghrouti & Issmail El Hallaoui & François Soumis, 2018. "Improved integral simplex using decomposition for the set partitioning problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(2), pages 185-206, June.
    15. Adil Tahir & Guy Desaulniers & Issmail El Hallaoui, 2019. "Integral column generation for the set partitioning problem," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(5), pages 713-744, December.
    16. Toni I. Wickert & Pieter Smet & Greet Vanden Berghe, 2021. "Quantifying and enforcing robustness in staff rostering," Journal of Scheduling, Springer, vol. 24(3), pages 347-366, June.
    17. Jean Bertrand Gauthier & Jacques Desrosiers & Marco E. Lübbecke, 2016. "Tools for primal degenerate linear programs: IPS, DCA, and PE," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 5(2), pages 161-204, June.
    18. Luciano Costa & Claudio Contardo & Guy Desaulniers & Julian Yarkony, 2022. "Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1141-1156, March.
    19. Gauthier, Jean Bertrand & Desrosiers, Jacques, 2022. "The minimum mean cycle-canceling algorithm for linear programs," European Journal of Operational Research, Elsevier, vol. 298(1), pages 36-44.
    20. Bouarab, Hocine & El Hallaoui, Issmail & Metrane, Abdelmoutalib & Soumis, François, 2017. "Dynamic constraint and variable aggregation in column generation," European Journal of Operational Research, Elsevier, vol. 262(3), pages 835-850.

    More about this item

    Keywords

    Patient admission scheduling; column generation; dynamic constraint aggregation; dual disaggregation; branch-and-bound;
    All these keywords.

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:hhs:sdueko:2013_001. 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: Astrid Holm Nielsen (email available below). General contact details of provider: https://edirc.repec.org/data/okioudk.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.