IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v295y2020i1d10.1007_s10479-020-03713-6.html
   My bibliography  Save this article

Optimizing waste storage areas in health care centers

Author

Listed:
  • Lorena Pradenas

    (Universidad de Concepción)

  • Marco Fuentes

    (Universidad de Concepción)

  • Víctor Parada

    (Universidad de Santiago de Chile)

Abstract

Waste management is a critical issue for public health care services. Although operations management provides several tools for completing some stages of this process, the definition of a storage policy and the optimal packing of boxes with sharps waste in a storage area of a health care center are particular problems of high complexity. In this paper, a two-stage approach is proposed: The first stage considers the subproblem associated with the selection of the best policy. The second stage addresses the issue of waste packaging optimization. The multicriteria aspect of the first stage is addressed using the analytic hierarchy process, whereas the optimization of waste packaging is conducted using two heuristic methods: a sorting heuristic and the simulated annealing method. The best alternative method that is identified for the storage area considers the establishment of a specific room that is intended for the temporary storage of sharps waste. Furthermore, both heuristic methods provide suitable waste packaging options. The results suggest that the most appropriate method for each health care center must be selected by considering the order and sizes of the packing boxes, the required computational time and the required packaging efficiency.

Suggested Citation

  • Lorena Pradenas & Marco Fuentes & Víctor Parada, 2020. "Optimizing waste storage areas in health care centers," Annals of Operations Research, Springer, vol. 295(1), pages 503-516, December.
    • Handle: RePEc:spr:annopr:v:295:y:2020:i:1:d:10.1007_s10479-020-03713-6
    DOI: 10.1007/s10479-020-03713-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-020-03713-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-020-03713-6?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.

    References listed on IDEAS

    as
    1. Gomes, Carlos F. Simões & Nunes, Kátia R.A. & Helena Xavier, Lucia & Cardoso, Rosangela & Valle, Rogerio, 2008. "Multicriteria decision making applied to waste recycling in Brazil," Omega, Elsevier, vol. 36(3), pages 395-404, June.
    2. Yaesoubi, Reza & Cohen, Ted, 2011. "Generalized Markov models of infectious disease spread: A novel framework for developing dynamic health policies," European Journal of Operational Research, Elsevier, vol. 215(3), pages 679-687, December.
    3. Xianguo Li & Qian Zhang, 2015. "AHP-based resources and environment efficiency evaluation index system construction about the west side of Taiwan Straits," Annals of Operations Research, Springer, vol. 228(1), pages 97-111, May.
    4. Liu, Hu-Chen & You, Jian-Xin & Lu, Chao & Chen, Yi-Zeng, 2015. "Evaluating health-care waste treatment technologies using a hybrid multi-criteria decision making model," Renewable and Sustainable Energy Reviews, Elsevier, vol. 41(C), pages 932-942.
    5. Wascher, Gerhard & Hau[ss]ner, Heike & Schumann, Holger, 2007. "An improved typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1109-1130, December.
    6. Ricardo Andrade & Ernesto G Birgin & Reinaldo Morabito & Débora P Ronconi, 2014. "MIP models for two-dimensional non-guillotine cutting problems with usable leftovers," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 65(11), pages 1649-1663, November.
    7. El-Ghazali Talbi, 2016. "Combining metaheuristics with mathematical programming, constraint programming and machine learning," Annals of Operations Research, Springer, vol. 240(1), pages 171-215, May.
    8. Hinostroza, Ignacio & Pradenas, Lorena & Parada, Víctor, 2013. "Board cutting from logs: Optimal and heuristic approaches for the problem of packing rectangles in a circle," International Journal of Production Economics, Elsevier, vol. 145(2), pages 541-546.
    9. Duanbing Chen & Wenqi Huang, 2007. "A New Heuristic Algorithm For Constrained Rectangle-Packing Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 24(04), pages 463-478.
    10. Rafael Caballero & Carlos Romero & Francisco Ruiz, 2016. "Multiple criteria decision making and economics: an introduction," Annals of Operations Research, Springer, vol. 245(1), pages 1-5, October.
    11. Brent, Alan C. & Rogers, David E.C. & Ramabitsa-Siimane, Tsaletseng S.M. & Rohwer, Mark B., 2007. "Application of the analytical hierarchy process to establish health care waste management systems that minimise infection risks in developing countries," European Journal of Operational Research, Elsevier, vol. 181(1), pages 403-424, August.
    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. Vladimir Simic & Ali Ebadi Torkayesh & Abtin Ijadi Maghsoodi, 2023. "Locating a disinfection facility for hazardous healthcare waste in the COVID-19 era: a novel approach based on Fermatean fuzzy ITARA-MARCOS and random forest recursive feature elimination algorithm," Annals of Operations Research, Springer, vol. 328(1), pages 1105-1150, September.

    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. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    2. Gonçalves, José Fernando & Wäscher, Gerhard, 2020. "A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects," European Journal of Operational Research, Elsevier, vol. 286(3), pages 867-882.
    3. Hakim Akeb & Mhand Hifi, 2010. "A hybrid beam search looking-ahead algorithm for the circular packing problem," Journal of Combinatorial Optimization, Springer, vol. 20(2), pages 101-130, August.
    4. Wei, Lijun & Hu, Qian & Lim, Andrew & Liu, Qiang, 2018. "A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem," European Journal of Operational Research, Elsevier, vol. 270(2), pages 448-474.
    5. Defu Zhang & Lijun Wei & Stephen C. H. Leung & Qingshan Chen, 2013. "A Binary Search Heuristic Algorithm Based on Randomized Local Search for the Rectangular Strip-Packing Problem," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 332-345, May.
    6. Vlachokostas, Ch. & Michailidou, A.V. & Achillas, Ch., 2021. "Multi-Criteria Decision Analysis towards promoting Waste-to-Energy Management Strategies: A critical review," Renewable and Sustainable Energy Reviews, Elsevier, vol. 138(C).
    7. Santiago V. Ravelo & Cláudio N. Meneses & Maristela O. Santos, 2020. "Meta-heuristics for the one-dimensional cutting stock problem with usable leftover," Journal of Heuristics, Springer, vol. 26(4), pages 585-618, August.
    8. Silva, Allyson & Coelho, Leandro C. & Darvish, Maryam & Renaud, Jacques, 2022. "A cutting plane method and a parallel algorithm for packing rectangles in a circular container," European Journal of Operational Research, Elsevier, vol. 303(1), pages 114-128.
    9. Defu Zhang & Yuxin Che & Furong Ye & Yain-Whar Si & Stephen C. H. Leung, 2016. "A hybrid algorithm based on variable neighbourhood for the strip packing problem," Journal of Combinatorial Optimization, Springer, vol. 32(2), pages 513-530, August.
    10. Bouzid, Mouaouia Cherif & Salhi, Said, 2020. "Packing rectangles into a fixed size circular container: Constructive and metaheuristic search approaches," European Journal of Operational Research, Elsevier, vol. 285(3), pages 865-883.
    11. Jean-François Côté & Manuel Iori, 2018. "The Meet-in-the-Middle Principle for Cutting and Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 30(4), pages 646-661, November.
    12. Francisco Trespalacios & Ignacio E. Grossmann, 2017. "Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem," Annals of Operations Research, Springer, vol. 258(2), pages 747-759, November.
    13. Gahm, Christian & Uzunoglu, Aykut & Wahl, Stefan & Ganschinietz, Chantal & Tuma, Axel, 2022. "Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning," European Journal of Operational Research, Elsevier, vol. 296(3), pages 819-836.
    14. François Clautiaux & Cláudio Alves & José Valério de Carvalho & Jürgen Rietz, 2011. "New Stabilization Procedures for the Cutting Stock Problem," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 530-545, November.
    15. José García & José Lemus-Romani & Francisco Altimiras & Broderick Crawford & Ricardo Soto & Marcelo Becerra-Rozas & Paola Moraga & Alex Paz Becerra & Alvaro Peña Fritz & Jose-Miguel Rubio & Gino Astor, 2021. "A Binary Machine Learning Cuckoo Search Algorithm Improved by a Local Search Operator for the Set-Union Knapsack Problem," Mathematics, MDPI, vol. 9(20), pages 1-19, October.
    16. Akang Wang & Christopher L. Hanselman & Chrysanthos E. Gounaris, 2018. "A customized branch-and-bound approach for irregular shape nesting," Journal of Global Optimization, Springer, vol. 71(4), pages 935-955, August.
    17. Christoph Zimmer & Reza Yaesoubi & Ted Cohen, 2017. "A Likelihood Approach for Real-Time Calibration of Stochastic Compartmental Epidemic Models," PLOS Computational Biology, Public Library of Science, vol. 13(1), pages 1-21, January.
    18. Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.
    19. Russo, Mauro & Sforza, Antonio & Sterle, Claudio, 2013. "An improvement of the knapsack function based algorithm of Gilmore and Gomory for the unconstrained two-dimensional guillotine cutting problem," International Journal of Production Economics, Elsevier, vol. 145(2), pages 451-462.
    20. Gregory S. Taylor & Yupo Chan & Ghulam Rasool, 2017. "A three-dimensional bin-packing model: exact multicriteria solution and computational complexity," Annals of Operations Research, Springer, vol. 251(1), pages 397-427, April.

    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:spr:annopr:v:295:y:2020:i:1:d:10.1007_s10479-020-03713-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.