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

Metaheuristic Approaches for Vehicle Routing Problems

Author

Listed:
  • M. Saravanan

    (Department of Mechanical Engineering, RVS College of Engineering & Technology, Tamilnadu, India)

  • K.A.Sundararaman

    (Department of Mechanical Engineering, RVS College of Engineering & Technology, Tamilnadu, India)

Abstract

Routing of service vehicles are the heart of many service operations. Exclusively vehicle routing problem (VRP) plays a central role in the optimization of distribution networks. The routing of service vehicles has a major impact on the quality of the service provided. In distribution of goods and services, it is time and again required to determine a combination of least cost vehicle routes through a set of geographically scattered customers, subject to side constraints. The case most commonly studied is where all vehicles are identical. Due to the complexity involved in solving the VRP, most researchers concentrate on using meta-heuristics for solving real-life problems. In this paper, heuristic methods based on Ant Colony Optimization and Simulated Annealing algorithms are developed and search strategies are investigated. Computational results are reported on randomly generated problems. These methods significantly improve in minimizing the total distances travelled by the vehicles.

Suggested Citation

  • M. Saravanan & K.A.Sundararaman, 2013. "Metaheuristic Approaches for Vehicle Routing Problems," International Journal of Information Systems and Supply Chain Management (IJISSCM), IGI Global, vol. 6(2), pages 17-32, April.
    • Handle: RePEc:igg:jisscm:v:6:y:2013:i:2:p:17-32
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jisscm.2013040102
    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:6:y:2013:i:2:p:17-32. 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.