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

Multi-objective optimisation for the vehicle routing problem using metaheuristics

Author

Listed:
  • Sonu Rajak
  • P. Parthiban
  • R. Dhanalakshmi
  • S. Sujith

Abstract

The capacitated vehicle routing problem is a combinatorial optimisation problem that determines a set of routes of minimum distance to deliver the goods, using a fleet of identical vehicles with restricted capacity. The objective of this article it to optimise the total distance required to deliver the goods and also the workload imbalance in terms of distances travelled by the vehicles and their loads. Due to the combinatorial in nature, it requires metaheuristic to solve these types of problems and this is a rapidly growing field of research. Here two metaheuristics such as ant colony optimisation (ACO) and simulated annealing (SA) are proposed and analysed for solving this multi-objective formulation of the vehicle routing problem. The results obtained from these two methods were compared and found that the ACO gives better results than the SA for the VRP.

Suggested Citation

  • Sonu Rajak & P. Parthiban & R. Dhanalakshmi & S. Sujith, 2018. "Multi-objective optimisation for the vehicle routing problem using metaheuristics," International Journal of Enterprise Network Management, Inderscience Enterprises Ltd, vol. 9(2), pages 117-128.
    • Handle: RePEc:ids:ijenma:v:9:y:2018:i:2:p:117-128
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=93706
    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:9:y:2018:i:2:p:117-128. 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.