IDEAS home Printed from https://ideas.repec.org/a/ids/ijisen/v11y2012i1-2p110-121.html
   My bibliography  Save this article

A new hybrid algorithm for multi-depot vehicle routing problem with time windows and split delivery

Author

Listed:
  • U.S.S. Dharmapriya
  • S.B. Siyambalapitiya
  • A.K. Kulatunga

Abstract

Effective coordination of distribution operations of a manufacturing organisation is paramount since it represents the major cost component of the logistic supply chain. To deal with high demand of orders with shorter lead time, distributed warehouse concept is introduced, and this is currently being practised. Furthermore, due to inherent deficiencies in vehicle routing problem (VRP), rules have been extended to accommodate large-scale orders by splitting the delivery. Time-constrained routing is relevant in an application where timely scheduled productions occur. Artificial intelligences based approaches are widely used in the literature to solve VRP problems with extensions. In this research, hybrid algorithm (SATS) is developed based on simulated annealing (SA) and Tabu search (TS) techniques to improve the solution quality of the complex multi-depot VRP with time windows and split delivery. The simulation results reveal that SATS outperforms in solution quality when it is compared with the result of Cordeau et al. (2001). Results reveal SATS gives best results for more than 50% instances.

Suggested Citation

  • U.S.S. Dharmapriya & S.B. Siyambalapitiya & A.K. Kulatunga, 2012. "A new hybrid algorithm for multi-depot vehicle routing problem with time windows and split delivery," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 11(1/2), pages 110-121.
    • Handle: RePEc:ids:ijisen:v:11:y:2012:i:1/2:p:110-121
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=46658
    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:ijisen:v:11:y:2012:i:1/2:p:110-121. 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=188 .

    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.