IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v15y2019i1p65-91.html
   My bibliography  Save this article

A matheuristic approach for the split delivery vehicle routing problem: an efficient set covering-based model with guided route generation schemes

Author

Listed:
  • Nurul Huda Mohamed
  • Said Salhi
  • Gábor Nagy
  • Nurul Akmal Mohamed

Abstract

The split delivery vehicle routing problem (SDVRP) is a relaxed version of the classical VRP where customers can be visited more than once. The SDVRP is also applicable for problems where one or more of the customers require a demand larger than the vehicle capacity. Constructive heuristics adapted from the parallel savings and the sweep methods are first proposed to generate a set of solutions which is then used in the new and more efficient set covering-based formulation which we put forward. An effective repair mechanism to remedy any infeasibility due to the set covering problem is presented. A reduced set of promising routes is used in our model, instead of the original set of routes, proposing and using well defined reduction schemes. This set covering-based approach is tested on large datasets from the literature with encouraging results. In brief, seven best solutions including ties are found among the 137 SDVRP instances.

Suggested Citation

  • Nurul Huda Mohamed & Said Salhi & Gábor Nagy & Nurul Akmal Mohamed, 2019. "A matheuristic approach for the split delivery vehicle routing problem: an efficient set covering-based model with guided route generation schemes," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 15(1), pages 65-91.
    • Handle: RePEc:ids:ijmore:v:15:y:2019:i:1:p:65-91
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=101613
    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:ijmore:v:15:y:2019:i:1:p:65-91. 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=320 .

    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.