IDEAS home Printed from https://ideas.repec.org/a/ids/ijenma/v3y2009i3p201-222.html
   My bibliography  Save this article

Saving based algorithm for multi-depot version of vehicle routing problem with simultaneous pickup and delivery

Author

Listed:
  • Y. Gajpal
  • P.L. Abad

Abstract

The paper presents saving based algorithm for the multi-depot version of VRPSPD. We developed four saving based algorithms for the problem. These algorithms are: 1) partition based algorithm; 2) nearest depot algorithm; 3) saving algorithm; 4) Tillman's saving algorithm. In the saving heuristics, a new route is created by merging two routes. Checking the feasibility of new route obtained after merging two routes is difficult because of the fluctuating load on the route. We use cumulative-net pick approach for checking the feasibility when two existing routes are merged. Numerical experiment is performed on benchmark problem instances available in literature. The numerical results show that the performance of the proposed heuristics is qualitatively better than the existing insertion based heuristics.

Suggested Citation

  • Y. Gajpal & P.L. Abad, 2009. "Saving based algorithm for multi-depot version of vehicle routing problem with simultaneous pickup and delivery," International Journal of Enterprise Network Management, Inderscience Enterprises Ltd, vol. 3(3), pages 201-222.
    • Handle: RePEc:ids:ijenma:v:3:y:2009:i:3:p:201-222
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=32395
    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:ijenma:v:3:y:2009:i:3:p:201-222. 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=187 .

    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.