Skip to main content

Synchronization in Vehicle Routing: Benders’ Decomposition for the Home Health Care Routing and Scheduling Problem

  • Conference paper
  • First Online:
Dynamics in Logistics

Part of the book series: Lecture Notes in Logistics ((LNLO))

  • 2180 Accesses

Abstract

This chapter investigates a vehicle routing problem with synchronization requirements for the services provided to customers. The problem finds an application in the home health care branch, where staff members of health care agencies have to be routed and services at patients’ homes have to be scheduled. The latter can involve simultaneous services, where two staff members have to serve one patient jointly, and services with given precedence, where two service operations have to be provided to a patient within a given time distance. This paper presents a Benders’ decomposition method for solving this problem exactly.

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

  • Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numer Math 4:238–252

    Article  MathSciNet  MATH  Google Scholar 

  • Bredström D, Rönnqvist M (2008) Combined vehicle routing and scheduling with temporal precedence and synchronization constraints. Eur J Oper Res 191(1):19–31

    Article  MATH  Google Scholar 

  • Codato G, Fischetti M (2006) Combinatorial Benders’ cuts for mixed-integer linear programming. Oper Res 54(4):756–766

    Article  MathSciNet  MATH  Google Scholar 

  • Cordeau J-F, Soumis F, Desrosiers J (2000) A Benders decomposition approach for the locomotive and car assignment problem. Transport Sci 34(2):133–149

    Article  MATH  Google Scholar 

  • Cordeau J-F, Stojkovic G, Soumis F, Desrosiers J (2001) Benders decomposition for simultaneous aircraft routing and crew scheduling. Transport Sci 35(4):375–388

    Article  MATH  Google Scholar 

  • De Camargo RS, Miranda G Jr, Luna HP (2008) Benders decomposition for the uncapacitated multiple allocation hub location problem. Comput Oper Res 35(4):1047–1067

    Article  MATH  Google Scholar 

  • Drexl M (2012) Synchronization in vehicle routing–A survey of VRPs with multiple synchronization constraints. Transport Sci 46(3):297–316

    Article  Google Scholar 

  • Eveborn P, Fliesberg P, Rönnqvist M (2006) Laps care–an operational system for staff planning of home care. Eur J Oper Res 171:962–976

    Google Scholar 

  • Freling R, Huisman D, Wagelmans APM (2003) Models and algorithms for integration of vehicle and crew scheduling. J Sched 6(1):63–85

    Article  MathSciNet  MATH  Google Scholar 

  • Goel A, Meisel F (2013) Workforce routing and scheduling for electricity network maintenance with downtime minimization. Eur J Oper Res 213(1):210–228

    Article  MathSciNet  MATH  Google Scholar 

  • Haase K, Desaulniers G, Desrosiers J (2001) Simultaneous vehicle and crew scheduling in urban mass transit systems. Transport Sci 35(3):286–303

    Article  MATH  Google Scholar 

  • Kergosien Y, Lenté C, Billaut J-C (2009) Home health care problem: an extended multiple traveling salesman problem. In: Blazewicz J et al. (2009) Proceedings of the 4th multidisciplinary international scheduling conference: theory and applications (MISTA 2009), Dublin, 85–92

    Google Scholar 

  • Li Y, Lim A, Rodrigues B (2005) Manpower allocation with time windows and jobteaming constraints. Nav Res Log 52(4):302–311

    Article  MATH  Google Scholar 

  • Mankowska DS, Meisel F, Bierwirth C (2014) The home health care routing and scheduling problem with interdependent services. Health Care Manag Sci 17(1):15–30

    Article  Google Scholar 

  • Rasmussen MS, Justesen T, Dohn A, Larsen J (2012) The home care crew scheduling problem: preference-based visit clustering and temporal dependencies. Eur J Oper Res 219(3):598–610

    Article  MATH  Google Scholar 

  • Tarricone R, Tsouros AD (2008) Home care in Europe: the solid facts. Regional Office for Europe of the World Health Organization, Copenhagen

    Google Scholar 

  • Wen M, Larsen J, Clausen J, Cordeau J, Laporte G (2008) Vehicle routing with cross-docking. J Oper Res Soc 60(11):1708–1718

    MATH  Google Scholar 

Download references

Acknowledgments

This research is funded by the Deutsche Forschungsgemeinschaft (DFG) under project reference B02110263.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dorota Slawa Mankowska .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Mankowska, D.S. (2016). Synchronization in Vehicle Routing: Benders’ Decomposition for the Home Health Care Routing and Scheduling Problem. In: Kotzab, H., Pannek, J., Thoben, KD. (eds) Dynamics in Logistics. Lecture Notes in Logistics. Springer, Cham. https://doi.org/10.1007/978-3-319-23512-7_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23512-7_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23511-0

  • Online ISBN: 978-3-319-23512-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics