IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v60y2022i4p1265-1283.html
   My bibliography  Save this article

A constraint-programming based decomposition method for the Generalised Workforce Scheduling and Routing Problem (GWSRP)

Author

Listed:
  • E. Bourreau
  • T. Garaix
  • M. Gondran
  • P. Lacomme
  • N. Tchernev

Abstract

This paper deals with the Generalised Workforce Scheduling and Routing Problem (GWSRP) where 9 temporal constraints ensuring visit dependencies are all together taken into account and where customer and worker’s quality of service are taken into consideration. A Constraint-Programming based Decomposition Method (CPDM) is proposed, firstly based on a relaxation of coordination constraints and a column generation, and secondly with an iterative insertion of coordination constraint by constraint programming solver. Numerical experiments are achieved on huge instances derived from WSRP benchmark instances with up to 177 customers, 59 vehicles and coordination constraints. The CPDM is able to find nearly optimal solution for medium-size instances and find high-quality solution for huge-size instances whereas CPLEX solver applied to a mixed integer linear model is not able to give a solution in this case.

Suggested Citation

  • E. Bourreau & T. Garaix & M. Gondran & P. Lacomme & N. Tchernev, 2022. "A constraint-programming based decomposition method for the Generalised Workforce Scheduling and Routing Problem (GWSRP)," International Journal of Production Research, Taylor & Francis Journals, vol. 60(4), pages 1265-1283, February.
    • Handle: RePEc:taf:tprsxx:v:60:y:2022:i:4:p:1265-1283
    DOI: 10.1080/00207543.2020.1856436
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2020.1856436
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2020.1856436?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:tprsxx:v:60:y:2022:i:4:p:1265-1283. 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/TPRS20 .

    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.