Skip to main content
SpringerLink
Log in

A Genetic Algorithm for the TOPdTW at Operating Rooms

  • Conference paper
Computational Science and Its Applications – ICCSA 2013 (ICCSA 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7971))

Included in the following conference series:

Abstract

This paper presents a genetic algorithm for the Team Orienteering Problem with double Time Windows (TOPdTW). The aim is to study TOPdTW to model a real problem that arises within the operating rooms in a hospital. The Genetic Algorithm uses a peculiar way to construct solutions that only generates valid solutions, which improves the global performance. This constructive algorithm reads the chromosome and decides which operation is scheduled next in the route. The algorithm was tested using some public instances of the TOPTW and instances generated for TOPdTW. The computational results are presented.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alejo, J.S., Martín, M.G., Ortega-Mier, M., García-Sánchez, A.: Mixed integer programming model for optimizing the layout of an ICU vehicle. BMC Health Services Research 9, 224 (2009)

    Article  Google Scholar 

  2. Lapierre, S., Ruiz, A.: Scheduling logistic activities to improve hospital supply systems. Computers & Operations Research 34, 624–641 (2007)

    Article  MATH  Google Scholar 

  3. Topaloglu, S.: A shift scheduling model for employees with different seniority levels and an application in healthcare. European Journal of Operational Research 198, 943–957 (2009)

    Article  MATH  Google Scholar 

  4. Jaumard, B., Semet, F., Vovor, T.: A generalized linear programming model for nurse scheduling. European Journal of Operational Research 107, 1–18 (1998)

    Article  MATH  Google Scholar 

  5. Cheang, B., Li, H., Lim, A., Rodrigues, B.: Nurse rostering problems - a bibliographic survey. European Journal of Operational Research 151, 447–460 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  6. Burke, E., De Causmaecker, P., Berghe, G.V., Van Landeghem, H.: The state of the art of nurse rostering. Journal of Scheduling 7, 441–499 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  7. van Essen, J., Hans, E., Hurink, J., Oversberg, A.: Minimizing the waiting time for emergency surgery. Operations Research for Health Care 1, 34–44 (2012)

    Article  Google Scholar 

  8. Su, M.C., Lai, S.C., Wang, P.C., Hsieh, Y.Z., Lin, S.C.: A SOMO-based approach to the operating room scheduling problem. Expert Systems with Applications 38, 15447–15454 (2011)

    Article  Google Scholar 

  9. Augusto, V., Xie, X., Perdomo, V.: Operating theatre scheduling with patient recovery in both operating rooms and recovery beds. Computers & Industrial Engineering 58, 231–238 (2010)

    Article  Google Scholar 

  10. van Essen, J.T., Hurink, J.L., Hartholt, W., van den Akker, B.J.: Decision support system for the operating room rescheduling problem. Health Care Management Science 15, 355–372 (2012)

    Article  Google Scholar 

  11. Hovlid, E., Bukve, O., Haug, K., Aslaksen, A.B., von Plessen, C.: A new pathway for elective surgery to reduce cancellation rates. BMC Health Services Research 12, 154 (2012)

    Article  Google Scholar 

  12. Cardoen, B., Demeulemeester, E., Belien, J.: Operating room planning and scheduling: A literature review. European Journal of Operational Research 201, 921–932 (2010)

    Article  MATH  Google Scholar 

  13. Ben Bachouch, R., Guinet, A., Hajri-Gabou, S.: An integer linear model for hospital bed planning. International Journal of Production Economics 143, 833–843 (2012)

    Article  Google Scholar 

  14. Hulshof, P., Boucherie, R., Hans, E., Hurink, J.: Tactical resource allocation and elective patient admission planning in care processes. Health care management science (2013)

    Google Scholar 

  15. Pham, D.N., Klinkert, A.: Surgical case scheduling as a generalized job shop scheduling problem. European Journal of Operational Research 185, 1011–1025 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  16. Jebali, A., Hadj Alouane, A.B., Ladet, P.: Operating rooms scheduling. International Journal of Production Economics 99, 52–62 (2006)

    Article  Google Scholar 

  17. Butt, S.E., Cavalier, T.M.: A heuristic for the multiple tour maximum collection problem. Computers & Operations Research 21, 101–111 (1994)

    Article  MATH  Google Scholar 

  18. Chao, I.M., Golden, B., Wasil, E.A.: The team orienteering problem. European Journal of Operational Research 88, 464–474 (1996)

    Article  MATH  Google Scholar 

  19. Archetti, C., Hertz, A., Speranza, M.G.: Metaheuristics for the team orienteering problem. Journal of Heuristics 13, 49–76 (2007)

    Article  Google Scholar 

  20. Vieira, F., Macedo, J., Carcao, T., Leite, T., Murta, D., Ferreira, J., Dias, L., Pereira, G., Oliveira, J.A.: Developing tools for the team orienteering problem - A simple genetic algorithm. In: Proceedings of 2nd International Conference on Operations Research and Enterprise Systems (ICORES 2013), Barcelona, Spain, February 16-18 (2013)

    Google Scholar 

  21. Ferreira, J., Quintas, A., Oliveira, J.A., Pereira, G., Dias, L.: Solving the team orienteering problem - Developing a solution tool using a genetic algorithm approach. In: Snasel, V., Kromer, P. (eds.) Proceedings of 17th Online World Conference on Soft Computing in Industrial Applications (WSC17), December 21-31 (2012)

    Google Scholar 

  22. Lin, S.W., Yu, V.F.: A simulated annealing heuristic for the team orienteering problem with time windows. European Journal of Operational Research 217, 94–107 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  23. Labadie, N., Mansini, R., Melechovsky, J., Wolfler Calvo, R.: The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search. European Journal of Operational Research 220, 15–27 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  24. Garcia, A., Vansteenwegen, P., Arbelaitz, O., Souffriau, W., Linaza, M.T.: Integrating public transportation in personalised electronic tourist guides. Computers & Operations Research 40, 758–774 (2013)

    Article  Google Scholar 

  25. Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., Van Oudheusden, D.: Iterated local search for the team orienteering problem with time windows. Computers & Operations Research 36, 3281–3290 (2009)

    Article  MATH  Google Scholar 

  26. Tricoire, F., Romauch, M., Doerner, K.F., Hartl, R.F.: Heuristics for the multi-period orienteering problem with multiple time windows. Computers & Operations Research 37, 351–367 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  27. Garcia, A., Vansteenwegen, P., Souffriau, W., Arbelaitz, O., Linaza, M.: Solving Multi Constrained Team orienteering Problems to Generate Tourist Routes. Working paper (2009)

    Google Scholar 

  28. Dohn, A., Kolind, E., Clausen, J.: The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach. Computers & Operations Research 36, 1145–1157 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  29. Solomon, M., Desrosiers, J.: Time windows constrained routing and scheduling problems. Transportation Science 22, 1–22 (1998)

    Article  MathSciNet  Google Scholar 

  30. Czyzyk, J., Mesnier, M.P., Moré, J.J.: The NEOS server. IEEE J. Computational Sci. Engrg. 5, 68–75 (1998)

    Article  Google Scholar 

  31. Gropp, W., Moré, J.J.: Optimization environments and the NEOS server. In: Buhmann, M.D., Iserles, A. (eds.) Approximation Theory and Optimization: Tributes to M. J. D. Powell, pp. 167–182. Cambridge University Press, Cambridge (1997)

    Google Scholar 

  32. Dolan, E.D.: NEOS server 4.0 administrative guide. Technical Memorandum ANL/MCS-TM-250, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre ALGORITMI, Escola de Engenharia, Universidade do Minho, Campus Azurém, 4800-058, Guimarães, Portugal

    Gabriel Mota, Mário Abreu, Artur Quintas, João Ferreira, Luis S. Dias, Guilherme A. B. Pereira & José A. Oliveira

Authors
  1. Gabriel Mota
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mário Abreu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Artur Quintas
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. João Ferreira
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Luis S. Dias
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Guilherme A. B. Pereira
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. José A. Oliveira
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. L-I.S.U.T. - D.A.P.I.t. Facoltà Ingegneria, Università degli Studi della Basilicata, Viale dell’Ateneo Lucano, 10, 85100, Potenza, Italy

    Beniamino Murgante

  2. Covenant University, Canaanland, Ota, Nigeria

    Sanjay Misra

  3. Partimento di Scienze e Tecnologie per LAgricoltura, le Foreste, la Natura e lEnergia, Università degli Studi della Tuscia, Via S. Camillo de Lellis, snc, 01100, Viterbo, Italy

    Maurizio Carlini

  4. Dipartimento di Scienze dell’Ingegneria Civile e dell’Architecttura, Politecnico di Bari, Via Orabona, 4, 70125, Bari, Italy

    Carmelo M. Torre

  5. International University VNU-HCM, Quarter 6, Linh Trung, Thu Duc, Ho Chi Minh City, Vietnam

    Hong-Quang Nguyen

  6. School of Business Systems, Monash University, 3800, Clayton, VIC, Australia

    David Taniar

  7. Department of Intelligent Informatics, Kyushu Sangyo University, 2-3-1 Matsukadai, 813-8503, Higashi-ku, Fukuoka, Japan

    Bernady O. Apduhan

  8. Department of Mathematics and Computer Science, University of Perugia, Via Vanvitelli, 1, 06123, Perugia, Italy

    Osvaldo Gervasi

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mota, G. et al. (2013). A Genetic Algorithm for the TOPdTW at Operating Rooms. In: Murgante, B., et al. Computational Science and Its Applications – ICCSA 2013. ICCSA 2013. Lecture Notes in Computer Science, vol 7971. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39637-3_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39637-3_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39636-6

  • Online ISBN: 978-3-642-39637-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation