IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v1y2009i1-2p163-190.html
   My bibliography  Save this article

A ring-based diversification scheme for routing problems

Author

Listed:
  • Rafael E. Aleman
  • Xinhui Zhang
  • Raymond R. Hill

Abstract

The split delivery vehicle routing problem (SDVRP) relaxes the classical vehicle routing problem (VRP) by allowing multiple vehicles to supply the demand of individual customers thereby potentially reducing costs. This article provides an up-to-date review of the SDVRP literature and presents a new solution diversification scheme based on concentric rings centred at the depot that partitions the original problem. The resulting subproblems are then solved using a constructive approach. Different ring settings produce varied partitions and thus different solutions to the original problem are obtained and improved via a variable neighbourhood descent. Computational results on available test problems demonstrate the effectiveness of the proposed algorithm and present new best solutions to some of the tested problems.

Suggested Citation

  • Rafael E. Aleman & Xinhui Zhang & Raymond R. Hill, 2009. "A ring-based diversification scheme for routing problems," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 1(1/2), pages 163-190.
    • Handle: RePEc:ids:ijmore:v:1:y:2009:i:1/2:p:163-190
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=22880
    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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Berbotto, Leonardo & García, Sergio & Nogales, Francisco J., 2011. "A vehicle routing model with split delivery and stop nodes," DES - Working Papers. Statistics and Econometrics. WS ws110906, Universidad Carlos III de Madrid. Departamento de Estadística.
    2. Max Leyerer & Marc-Oliver Sonneberg & Maximilian Heumann & Tim Kammann & Michael H. Breitner, 2019. "Individually Optimized Commercial Road Transport: A Decision Support System for Customizable Routing Problems," Sustainability, MDPI, vol. 11(20), pages 1-21, October.
    3. Leonardo Berbotto & Sergio García & Francisco Nogales, 2014. "A Randomized Granular Tabu Search heuristic for the split delivery vehicle routing problem," Annals of Operations Research, Springer, vol. 222(1), pages 153-173, November.
    4. Archetti, Claudia & Bianchessi, Nicola & Speranza, M. Grazia, 2014. "Branch-and-cut algorithms for the split delivery vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 238(3), pages 685-698.

    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:1:y:2009:i:1/2:p:163-190. 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.