IDEAS home Printed from https://ideas.repec.org/a/igg/jisscm/v12y2019i4p1-26.html
   My bibliography  Save this article

An Improved Genetic Algorithm for Solving Multi Depot Vehicle Routing Problems

Author

Listed:
  • Varimna Singh

    (Som Lalit Institute of Management Studies, Ahmedabad, India)

  • L. Ganapathy

    (National Institute of Industrial Engineering, Mumbai, India)

  • Ashok K. Pundir

    (National Institute of Industrial Engineering, Mumbai, India)

Abstract

The classical Vehicle Routing Problem (VRP) tries to minimise the cost of dispatching goods from depots to customers using vehicles with limited carrying capacity. As a generalisation of the TSP, the problem is known to be NP-hard and several authors have proposed heuristics and meta-heuristics for obtaining good solutions. The authors present genetic algorithm-based approaches for solving the problem and compare the results with available results from other papers, in particular, the hybrid clustering based genetic algorithm. The authors find that the proposed methods give encouraging results on all these instances. The approach can be extended to solve multi depot VRPs with heterogeneous fleet of vehicles.

Suggested Citation

  • Varimna Singh & L. Ganapathy & Ashok K. Pundir, 2019. "An Improved Genetic Algorithm for Solving Multi Depot Vehicle Routing Problems," International Journal of Information Systems and Supply Chain Management (IJISSCM), IGI Global, vol. 12(4), pages 1-26, October.
    • Handle: RePEc:igg:jisscm:v:12:y:2019:i:4:p:1-26
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJISSCM.2019100101
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:igg:jisscm:v:12:y:2019:i:4:p:1-26. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.