IDEAS home Printed from https://ideas.repec.org/a/ids/ijlsma/v41y2022i1-2p205-224.html
   My bibliography  Save this article

Heuristic based on iterative exact method for multi-tour dynamic vehicle routing problem with overtime

Author

Listed:
  • Khaoula Ouaddi
  • Youssef Benadada
  • Fatima-Zahra Mhada

Abstract

In the last two decades, the DVRP has received a very particular interest from researchers. Because of its great utility in modern transport systems, the DVRP is now a very motivating and still attractive line of research for new studies. The complexity of this problem comes from the fact that it belongs to the VRP family in addition to the dynamism of its components. In this article, a very little studied variant of the DVRP is dealt with. This is the multi-tour DVRP with overtime (MTDVRPOT). We treat this problem from a multi-objective point of view, based on a bi-objective mathematical modelling. The first objective is to minimise the total travelled distance, while the second objective is to minimise to maximal performed overtime. A heuristic based on the iterative exact method was proposed to solve this problem. Its principle is to divide the working day into time periods and resolve iteratively the mathematical models. Each mathematical model corresponds to one subproblem of one time period.

Suggested Citation

  • Khaoula Ouaddi & Youssef Benadada & Fatima-Zahra Mhada, 2022. "Heuristic based on iterative exact method for multi-tour dynamic vehicle routing problem with overtime," International Journal of Logistics Systems and Management, Inderscience Enterprises Ltd, vol. 41(1/2), pages 205-224.
  • Handle: RePEc:ids:ijlsma:v:41:y:2022:i:1/2:p:205-224
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=120999
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ids:ijlsma:v:41:y:2022:i:1/2:p:205-224. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=134 .

    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.