IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v72y2021i11p2396-2411.html
   My bibliography  Save this article

A multistage optimisation algorithm for the large vehicle routing problem with time windows and synchronised visits

Author

Listed:
  • Mateusz Polnik
  • Annalisa Riccardi
  • Kerem Akartunalı

Abstract

We propose a multistage algorithm for the vehicle routing problem with time windows and synchronised visits, which is capable of solving large problem instances arising in home health care applications. The algorithm is based on a constraint programming formulation of the daily home care scheduling and routing problem. It contains visits with hard time windows and pairwise synchronisation to be staffed by carers who have different skills and work custom shift patterns with contractual breaks. In a computational study, we first experiment with a benchmark set from the literature for the vehicle routing problem with time windows and synchronised visits. Our algorithm reproduced the majority of the best-known solutions, and strictly improved results for several other instances. Most importantly, we demonstrate that the algorithm can effectively solve real scheduling instances obtained from a UK home care provider. Their size significantly surpass similar scheduling problems considered in the literature. The multistage algorithm solved each of these instances in a matter of minutes, and outperformed human planners, scheduling more visits and significantly reducing total travel time.

Suggested Citation

  • Mateusz Polnik & Annalisa Riccardi & Kerem Akartunalı, 2021. "A multistage optimisation algorithm for the large vehicle routing problem with time windows and synchronised visits," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 72(11), pages 2396-2411, November.
    • Handle: RePEc:taf:tjorxx:v:72:y:2021:i:11:p:2396-2411
    DOI: 10.1080/01605682.2020.1792365
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2020.1792365
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2020.1792365?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.

    More about this item

    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:taf:tjorxx:v:72:y:2021:i:11:p:2396-2411. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.