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

A decomposition approach for the periodic consistent vehicle routeing problem with an application in the cleaning sector

Author

Listed:
  • Bilal Messaoudi
  • Ammar Oulamara
  • Said Salhi

Abstract

This study is inspired by a challenging logistic problem encountered in the cleaning service sector. The company wishes to solve the consistent vehicle routeing problem over a three-month planning horizon. The company has a heterogeneous vehicle fleet to guarantee multiple frequencies of visits to its customers. The objective is to minimise the number of vehicles used and the total distance travelled. This problem is a generalisation of the periodic vehicle routeing problem. We decompose the problem into two sub-problems, namely, the planning and routeing optimisation sub-problems. We construct a mathematical model for the former and a large neighbourhood search for the latter. We evaluate the performance of our approach using the results of the industrial partner and instances from the literature on problems that are closely related to our case study. Our approach is found to be effective and robust. Our results outperform the existing company's plan in terms of solution quality, and staff convenience, and speed. We also discovered new best solutions on some of the instances from the literature.

Suggested Citation

  • Bilal Messaoudi & Ammar Oulamara & Said Salhi, 2023. "A decomposition approach for the periodic consistent vehicle routeing problem with an application in the cleaning sector," International Journal of Production Research, Taylor & Francis Journals, vol. 61(22), pages 7727-7748, November.
    • Handle: RePEc:taf:tprsxx:v:61:y:2023:i:22:p:7727-7748
    DOI: 10.1080/00207543.2022.2162145
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2022.2162145
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2022.2162145?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:61:y:2023:i:22:p:7727-7748. 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.