Skip to main content

Novel Applications of the Team Orienteering Problem in Health Care Logistics

  • Conference paper
  • First Online:
Optimization in Artificial Intelligence and Data Sciences

Part of the book series: AIRO Springer Series ((AIROSS,volume 8))

Abstract

The team orienteering problem is a routing problem belonging to the class of the vehicle routing problems with profits. We present two problems arising in the health care logistics that are modelled as team orienteering problem. To the best of our knowledge, these are the first applications to health care logistics problems. The former is a problem arising in the digital contact tracing system as a measure for the containment of the Covid-19 pandemic. The latter is a problem arising in post-disaster management to transport the injured to hospitals. We discuss the novelty of some of their features with respect to the current literature. We present and discuss the mathematical formulation of a new variant of the team orienteering problem that includes such new features.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 159.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 159.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Angelica Salazar-Aguilar, M., Langevin, A., Laporte, G.: The multi-district team orienteering problem. Comput. Oper. Res. 41, 76–82 (2014)

    Article  MathSciNet  Google Scholar 

  2. Archetti, C., Speranza, M.G., Vigo, D.: Vehicle Routing Problems with Profits, chap. 10, pp. 273–297 (2014)

    Google Scholar 

  3. Aringhieri, R., Bigharaz, S., Druetto, A., Duma, D., Grosso, A., Guastalla, A.: The daily swab test collection problem (2021). Submitted for publication

    Google Scholar 

  4. Aringhieri, R., Bigharaz, S., Duma, D., Guastalla, A.: Fairness in ambulance routing for post disaster management. Cent. Eur. J. Oper. 30, 189–211 (2022)

    Article  MathSciNet  Google Scholar 

  5. Bourgeois, M., Laporte, G., Semet, F.: Heuristics for the black and white traveling salesman problem. Comput. Oper. Res. 30(1), 75–85 (2003)

    Article  MathSciNet  Google Scholar 

  6. Butt, S.E., Cavalier, T.M.: A heuristic for the multiple tour maximum collection problem. Comput. Oper. Res. 21(1), 101–111 (1994)

    Article  Google Scholar 

  7. Chao, I.M., Golden, B.L., Wasil, E.A.: The team orienteering problem. Eur. J. Oper. Res. 88(3), 464–474 (1996)

    Article  Google Scholar 

  8. Erdogan, G., Laporte, G.: The orienteering problem with variable profits. Networks 61(2), 104–116 (2013)

    Article  MathSciNet  Google Scholar 

  9. Ferretti, L., Wymant, C., Kendall, M., Zhao, L., Nurtay, A., Abeler-Dörner, L., Parker, M., Bonsall, D., Fraser, C.: Quantifying sars-cov-2 transmission suggests epidemic control with digital contact tracing. Science 368(6491), eabb6936 (2020)

    Google Scholar 

  10. Gouveia, L., Leitner, M., Ruthmair, M.: Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem. Eur. J. Oper. Res. 262(3), 908–928 (2017)

    Article  MathSciNet  Google Scholar 

  11. Gunawan, A., Lau, H.C., Vansteenwegen, P.: Orienteering problem: A survey of recent variants, solution approaches and applications. Eur. J. Oper. Res. 255(2), 315 – 332 (2016)

    Article  MathSciNet  Google Scholar 

  12. Karsu, O., Morton, A.: Inequity averse optimization in operational research. Eur. J. Oper. Res. 245(2), 343–359 (2015)

    Article  MathSciNet  Google Scholar 

  13. Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulation of traveling salesman problems. J. ACM 7(4), 326–329 (1960)

    Article  MathSciNet  Google Scholar 

  14. Nicosia, G., Pacifici, A., Pferschy, U.: Price of fairness for allocating a bounded resource. Eur. J. Oper. Res. 257(3), 933–943 (2017)

    Article  MathSciNet  Google Scholar 

  15. Talarico, L., Meisel, F., Sorensen, K.: Ambulance routing for disaster response with patient groups. Comput. Oper. Res. 56, 120–133 (2015)

    Article  MathSciNet  Google Scholar 

  16. Vansteenwegen, P., Gunawan, A.: Orienteering Problems: Models and Algorithms for Vehicle Routing Problems with Profits. Springer Nature Switzerland AG (2019)

    Google Scholar 

  17. Vansteenwegen, P., Souffriau, W., Oudheusden, D.V.: The orienteering problem: A survey. Eur. J. Oper. Res. 209(1), 1–10 (2011)

    Article  MathSciNet  Google Scholar 

  18. Yu, V.F., Jewpanya, P., Lin, S.W., Redi, A.P.: Team orienteering problem with time windows and time-dependent scores. Comput. Ind. Eng. 127, 213–224 (2019)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Roberto Aringhieri .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Aringhieri, R., Bigharaz, S., Duma, D., Guastalla, A. (2022). Novel Applications of the Team Orienteering Problem in Health Care Logistics. In: Amorosi, L., Dell’Olmo, P., Lari, I. (eds) Optimization in Artificial Intelligence and Data Sciences. AIRO Springer Series, vol 8. Springer, Cham. https://doi.org/10.1007/978-3-030-95380-5_21

Download citation

Publish with us

Policies and ethics